./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/systemc/bist_cell.cil.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/systemc/bist_cell.cil.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 de455e90ef2ae1a82fb7a87bbcdb07831c7ef68e47976e1b2868a3e9de47a0a2 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:21:16,651 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:21:16,653 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:21:16,691 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:21:16,692 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:21:16,695 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:21:16,696 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:21:16,698 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:21:16,700 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:21:16,703 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:21:16,703 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:21:16,704 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:21:16,705 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:21:16,706 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:21:16,707 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:21:16,710 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:21:16,711 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:21:16,711 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:21:16,713 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:21:16,717 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:21:16,718 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:21:16,719 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:21:16,720 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:21:16,721 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:21:16,725 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:21:16,726 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:21:16,726 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:21:16,727 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:21:16,727 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:21:16,728 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:21:16,728 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:21:16,729 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:21:16,730 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:21:16,732 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:21:16,733 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:21:16,733 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:21:16,733 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:21:16,733 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:21:16,734 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:21:16,734 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:21:16,735 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:21:16,736 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:21:16,760 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:21:16,760 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:21:16,761 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:21:16,761 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:21:16,762 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:21:16,762 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:21:16,762 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:21:16,762 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:21:16,763 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:21:16,763 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:21:16,763 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:21:16,764 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:21:16,764 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:21:16,764 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:21:16,764 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:21:16,764 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:21:16,764 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:21:16,765 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:21:16,765 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:21:16,765 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:21:16,765 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:21:16,765 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:21:16,765 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:21:16,766 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:21:16,766 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:21:16,766 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:21:16,766 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:21:16,766 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:21:16,766 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:21:16,767 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:21:16,767 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:21:16,768 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:21:16,768 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 -> de455e90ef2ae1a82fb7a87bbcdb07831c7ef68e47976e1b2868a3e9de47a0a2 [2022-02-21 04:21:16,970 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:21:16,991 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:21:16,993 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:21:16,994 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:21:16,994 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:21:16,995 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/systemc/bist_cell.cil.c [2022-02-21 04:21:17,034 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71591b0ba/e98f4f30ef87407fb10723dca9fad811/FLAG9c752decb [2022-02-21 04:21:17,360 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:21:17,361 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/systemc/bist_cell.cil.c [2022-02-21 04:21:17,374 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71591b0ba/e98f4f30ef87407fb10723dca9fad811/FLAG9c752decb [2022-02-21 04:21:17,792 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/71591b0ba/e98f4f30ef87407fb10723dca9fad811 [2022-02-21 04:21:17,795 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:21:17,797 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:21:17,800 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:21:17,800 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:21:17,802 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:21:17,803 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:21:17" (1/1) ... [2022-02-21 04:21:17,804 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5bb8bd16 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:21:17, skipping insertion in model container [2022-02-21 04:21:17,804 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:21:17" (1/1) ... [2022-02-21 04:21:17,809 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:21:17,840 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:21:17,969 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/systemc/bist_cell.cil.c[639,652] [2022-02-21 04:21:18,010 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:21:18,016 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:21:18,024 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/systemc/bist_cell.cil.c[639,652] [2022-02-21 04:21:18,043 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:21:18,053 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:21:18,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:21:18 WrapperNode [2022-02-21 04:21:18,053 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:21:18,054 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:21:18,054 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:21:18,054 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:21:18,061 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:21:18" (1/1) ... [2022-02-21 04:21:18,074 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:21:18" (1/1) ... [2022-02-21 04:21:18,098 INFO L137 Inliner]: procedures = 30, calls = 30, calls flagged for inlining = 25, calls inlined = 31, statements flattened = 344 [2022-02-21 04:21:18,098 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:21:18,099 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:21:18,099 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:21:18,099 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:21:18,104 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:21:18" (1/1) ... [2022-02-21 04:21:18,104 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:21:18" (1/1) ... [2022-02-21 04:21:18,105 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:21:18" (1/1) ... [2022-02-21 04:21:18,105 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:21:18" (1/1) ... [2022-02-21 04:21:18,119 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:21:18" (1/1) ... [2022-02-21 04:21:18,125 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:21:18" (1/1) ... [2022-02-21 04:21:18,126 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:21:18" (1/1) ... [2022-02-21 04:21:18,128 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:21:18,128 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:21:18,128 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:21:18,128 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:21:18,129 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:21:18" (1/1) ... [2022-02-21 04:21:18,141 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:21:18,148 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:21:18,158 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:21:18,169 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:21:18,191 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:21:18,191 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:21:18,192 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:21:18,192 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:21:18,273 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:21:18,274 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:21:18,640 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:21:18,647 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:21:18,647 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-21 04:21:18,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:21:18 BoogieIcfgContainer [2022-02-21 04:21:18,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:21:18,650 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:21:18,650 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:21:18,652 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:21:18,653 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:21:18,653 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:21:17" (1/3) ... [2022-02-21 04:21:18,654 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@797e870d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:21:18, skipping insertion in model container [2022-02-21 04:21:18,654 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:21:18,654 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:21:18" (2/3) ... [2022-02-21 04:21:18,655 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@797e870d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:21:18, skipping insertion in model container [2022-02-21 04:21:18,655 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:21:18,655 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:21:18" (3/3) ... [2022-02-21 04:21:18,656 INFO L388 chiAutomizerObserver]: Analyzing ICFG bist_cell.cil.c [2022-02-21 04:21:18,694 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:21:18,694 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:21:18,695 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:21:18,695 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:21:18,695 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:21:18,695 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:21:18,695 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:21:18,695 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:21:18,715 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 125 states, 124 states have (on average 1.5887096774193548) internal successors, (197), 124 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:18,771 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 71 [2022-02-21 04:21:18,771 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:21:18,771 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:21:18,777 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:18,777 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:18,777 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:21:18,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 125 states, 124 states have (on average 1.5887096774193548) internal successors, (197), 124 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:18,785 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 71 [2022-02-21 04:21:18,785 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:21:18,785 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:21:18,786 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:18,786 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:18,792 INFO L791 eck$LassoCheckResult]: Stem: 113#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(16, 2);call #Ultimate.allocInit(12, 3);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 43#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~2#1;havoc main_~__retres1~2#1;assume { :begin_inline_init_model } true;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 18#L490true assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret8#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 77#L212true assume !(1 == ~b0_req_up~0); 125#L212-2true assume !(1 == ~b1_req_up~0); 85#L219-1true assume !(1 == ~d0_req_up~0); 44#L226-1true assume !(1 == ~d1_req_up~0); 67#L233-1true assume !(1 == ~z_req_up~0); 108#L240-1true assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 16#L255true assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 118#L255-2true assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 68#L321true assume !(0 == ~b0_ev~0); 84#L321-2true assume !(0 == ~b1_ev~0); 25#L326-1true assume !(0 == ~d0_ev~0); 28#L331-1true assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 9#L336-1true assume !(0 == ~z_ev~0); 123#L341-1true assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; 119#L107true assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; 107#L129true is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; 58#L130true activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; 92#L390true assume !(0 != activate_threads_~tmp~1#1); 112#L390-2true assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 57#L354true assume !(1 == ~b0_ev~0); 40#L354-2true assume !(1 == ~b1_ev~0); 90#L359-1true assume !(1 == ~d0_ev~0); 42#L364-1true assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 48#L369-1true assume !(1 == ~z_ev~0); 96#L374-1true assume { :end_inline_reset_delta_events } true; 35#L432-2true [2022-02-21 04:21:18,797 INFO L793 eck$LassoCheckResult]: Loop: 35#L432-2true assume !false; 71#L433true start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1; 8#L295true assume !true; 49#L311true assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; 86#L212-3true assume !(1 == ~b0_req_up~0); 109#L212-5true assume !(1 == ~b1_req_up~0); 89#L219-3true assume !(1 == ~d0_req_up~0); 5#L226-3true assume !(1 == ~d1_req_up~0); 38#L233-3true assume !(1 == ~z_req_up~0); 17#L240-3true assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; 82#L321-3true assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 66#L321-5true assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 93#L326-3true assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 52#L331-3true assume !(0 == ~d1_ev~0); 12#L336-3true assume 0 == ~z_ev~0;~z_ev~0 := 1; 19#L341-3true assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; 115#L107-1true assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; 45#L129-1true is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; 122#L130-1true activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; 10#L390-3true assume 0 != activate_threads_~tmp~1#1;~comp_m1_st~0 := 0; 24#L390-5true assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 33#L354-3true assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 101#L354-5true assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 99#L359-3true assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 83#L364-3true assume !(1 == ~d1_ev~0); 81#L369-3true assume 1 == ~z_ev~0;~z_ev~0 := 2; 50#L374-3true assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret7#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; 73#L268-1true assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; 120#L275-1true exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; 41#L276-1true stop_simulation_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret7#1;havoc stop_simulation_#t~ret7#1; 14#L407true assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 117#L414true stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 105#L415true start_simulation_#t~ret8#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret8#1;havoc start_simulation_#t~ret8#1; 74#L449true assume !(0 != start_simulation_~tmp~3#1); 35#L432-2true [2022-02-21 04:21:18,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:18,808 INFO L85 PathProgramCache]: Analyzing trace with hash -1345002148, now seen corresponding path program 1 times [2022-02-21 04:21:18,814 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:18,815 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [223164291] [2022-02-21 04:21:18,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:18,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:18,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:18,953 INFO L290 TraceCheckUtils]: 0: Hoare triple {129#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(16, 2);call #Ultimate.allocInit(12, 3);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; {129#true} is VALID [2022-02-21 04:21:18,954 INFO L290 TraceCheckUtils]: 1: Hoare triple {129#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~2#1;havoc main_~__retres1~2#1;assume { :begin_inline_init_model } true;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; {131#(= ~b0_req_up~0 1)} is VALID [2022-02-21 04:21:18,955 INFO L290 TraceCheckUtils]: 2: Hoare triple {131#(= ~b0_req_up~0 1)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret8#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; {131#(= ~b0_req_up~0 1)} is VALID [2022-02-21 04:21:18,956 INFO L290 TraceCheckUtils]: 3: Hoare triple {131#(= ~b0_req_up~0 1)} assume !(1 == ~b0_req_up~0); {130#false} is VALID [2022-02-21 04:21:18,956 INFO L290 TraceCheckUtils]: 4: Hoare triple {130#false} assume !(1 == ~b1_req_up~0); {130#false} is VALID [2022-02-21 04:21:18,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {130#false} assume !(1 == ~d0_req_up~0); {130#false} is VALID [2022-02-21 04:21:18,957 INFO L290 TraceCheckUtils]: 6: Hoare triple {130#false} assume !(1 == ~d1_req_up~0); {130#false} is VALID [2022-02-21 04:21:18,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {130#false} assume !(1 == ~z_req_up~0); {130#false} is VALID [2022-02-21 04:21:18,957 INFO L290 TraceCheckUtils]: 8: Hoare triple {130#false} assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; {130#false} is VALID [2022-02-21 04:21:18,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {130#false} assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; {130#false} is VALID [2022-02-21 04:21:18,958 INFO L290 TraceCheckUtils]: 10: Hoare triple {130#false} assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; {130#false} is VALID [2022-02-21 04:21:18,958 INFO L290 TraceCheckUtils]: 11: Hoare triple {130#false} assume !(0 == ~b0_ev~0); {130#false} is VALID [2022-02-21 04:21:18,959 INFO L290 TraceCheckUtils]: 12: Hoare triple {130#false} assume !(0 == ~b1_ev~0); {130#false} is VALID [2022-02-21 04:21:18,959 INFO L290 TraceCheckUtils]: 13: Hoare triple {130#false} assume !(0 == ~d0_ev~0); {130#false} is VALID [2022-02-21 04:21:18,959 INFO L290 TraceCheckUtils]: 14: Hoare triple {130#false} assume 0 == ~d1_ev~0;~d1_ev~0 := 1; {130#false} is VALID [2022-02-21 04:21:18,959 INFO L290 TraceCheckUtils]: 15: Hoare triple {130#false} assume !(0 == ~z_ev~0); {130#false} is VALID [2022-02-21 04:21:18,959 INFO L290 TraceCheckUtils]: 16: Hoare triple {130#false} assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; {130#false} is VALID [2022-02-21 04:21:18,960 INFO L290 TraceCheckUtils]: 17: Hoare triple {130#false} assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; {130#false} is VALID [2022-02-21 04:21:18,960 INFO L290 TraceCheckUtils]: 18: Hoare triple {130#false} is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; {130#false} is VALID [2022-02-21 04:21:18,962 INFO L290 TraceCheckUtils]: 19: Hoare triple {130#false} activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; {130#false} is VALID [2022-02-21 04:21:18,963 INFO L290 TraceCheckUtils]: 20: Hoare triple {130#false} assume !(0 != activate_threads_~tmp~1#1); {130#false} is VALID [2022-02-21 04:21:18,963 INFO L290 TraceCheckUtils]: 21: Hoare triple {130#false} assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; {130#false} is VALID [2022-02-21 04:21:18,963 INFO L290 TraceCheckUtils]: 22: Hoare triple {130#false} assume !(1 == ~b0_ev~0); {130#false} is VALID [2022-02-21 04:21:18,963 INFO L290 TraceCheckUtils]: 23: Hoare triple {130#false} assume !(1 == ~b1_ev~0); {130#false} is VALID [2022-02-21 04:21:18,963 INFO L290 TraceCheckUtils]: 24: Hoare triple {130#false} assume !(1 == ~d0_ev~0); {130#false} is VALID [2022-02-21 04:21:18,964 INFO L290 TraceCheckUtils]: 25: Hoare triple {130#false} assume 1 == ~d1_ev~0;~d1_ev~0 := 2; {130#false} is VALID [2022-02-21 04:21:18,964 INFO L290 TraceCheckUtils]: 26: Hoare triple {130#false} assume !(1 == ~z_ev~0); {130#false} is VALID [2022-02-21 04:21:18,964 INFO L290 TraceCheckUtils]: 27: Hoare triple {130#false} assume { :end_inline_reset_delta_events } true; {130#false} is VALID [2022-02-21 04:21:18,965 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:21:18,965 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:18,965 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [223164291] [2022-02-21 04:21:18,966 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [223164291] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:18,966 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:18,966 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:21:18,967 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [115084990] [2022-02-21 04:21:18,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:18,971 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:21:18,971 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:18,971 INFO L85 PathProgramCache]: Analyzing trace with hash 972845291, now seen corresponding path program 1 times [2022-02-21 04:21:18,972 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:18,972 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2135772708] [2022-02-21 04:21:18,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:18,972 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:18,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:18,993 INFO L290 TraceCheckUtils]: 0: Hoare triple {132#true} assume !false; {132#true} is VALID [2022-02-21 04:21:18,993 INFO L290 TraceCheckUtils]: 1: Hoare triple {132#true} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1; {132#true} is VALID [2022-02-21 04:21:18,994 INFO L290 TraceCheckUtils]: 2: Hoare triple {132#true} assume !true; {133#false} is VALID [2022-02-21 04:21:18,994 INFO L290 TraceCheckUtils]: 3: Hoare triple {133#false} assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; {133#false} is VALID [2022-02-21 04:21:18,994 INFO L290 TraceCheckUtils]: 4: Hoare triple {133#false} assume !(1 == ~b0_req_up~0); {133#false} is VALID [2022-02-21 04:21:18,994 INFO L290 TraceCheckUtils]: 5: Hoare triple {133#false} assume !(1 == ~b1_req_up~0); {133#false} is VALID [2022-02-21 04:21:18,994 INFO L290 TraceCheckUtils]: 6: Hoare triple {133#false} assume !(1 == ~d0_req_up~0); {133#false} is VALID [2022-02-21 04:21:18,995 INFO L290 TraceCheckUtils]: 7: Hoare triple {133#false} assume !(1 == ~d1_req_up~0); {133#false} is VALID [2022-02-21 04:21:18,995 INFO L290 TraceCheckUtils]: 8: Hoare triple {133#false} assume !(1 == ~z_req_up~0); {133#false} is VALID [2022-02-21 04:21:18,995 INFO L290 TraceCheckUtils]: 9: Hoare triple {133#false} assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; {133#false} is VALID [2022-02-21 04:21:18,995 INFO L290 TraceCheckUtils]: 10: Hoare triple {133#false} assume 0 == ~b0_ev~0;~b0_ev~0 := 1; {133#false} is VALID [2022-02-21 04:21:18,995 INFO L290 TraceCheckUtils]: 11: Hoare triple {133#false} assume 0 == ~b1_ev~0;~b1_ev~0 := 1; {133#false} is VALID [2022-02-21 04:21:18,995 INFO L290 TraceCheckUtils]: 12: Hoare triple {133#false} assume 0 == ~d0_ev~0;~d0_ev~0 := 1; {133#false} is VALID [2022-02-21 04:21:18,996 INFO L290 TraceCheckUtils]: 13: Hoare triple {133#false} assume !(0 == ~d1_ev~0); {133#false} is VALID [2022-02-21 04:21:18,996 INFO L290 TraceCheckUtils]: 14: Hoare triple {133#false} assume 0 == ~z_ev~0;~z_ev~0 := 1; {133#false} is VALID [2022-02-21 04:21:18,996 INFO L290 TraceCheckUtils]: 15: Hoare triple {133#false} assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; {133#false} is VALID [2022-02-21 04:21:18,996 INFO L290 TraceCheckUtils]: 16: Hoare triple {133#false} assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; {133#false} is VALID [2022-02-21 04:21:18,996 INFO L290 TraceCheckUtils]: 17: Hoare triple {133#false} is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; {133#false} is VALID [2022-02-21 04:21:18,996 INFO L290 TraceCheckUtils]: 18: Hoare triple {133#false} activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; {133#false} is VALID [2022-02-21 04:21:18,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {133#false} assume 0 != activate_threads_~tmp~1#1;~comp_m1_st~0 := 0; {133#false} is VALID [2022-02-21 04:21:18,997 INFO L290 TraceCheckUtils]: 20: Hoare triple {133#false} assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; {133#false} is VALID [2022-02-21 04:21:18,997 INFO L290 TraceCheckUtils]: 21: Hoare triple {133#false} assume 1 == ~b0_ev~0;~b0_ev~0 := 2; {133#false} is VALID [2022-02-21 04:21:18,997 INFO L290 TraceCheckUtils]: 22: Hoare triple {133#false} assume 1 == ~b1_ev~0;~b1_ev~0 := 2; {133#false} is VALID [2022-02-21 04:21:18,997 INFO L290 TraceCheckUtils]: 23: Hoare triple {133#false} assume 1 == ~d0_ev~0;~d0_ev~0 := 2; {133#false} is VALID [2022-02-21 04:21:18,997 INFO L290 TraceCheckUtils]: 24: Hoare triple {133#false} assume !(1 == ~d1_ev~0); {133#false} is VALID [2022-02-21 04:21:18,997 INFO L290 TraceCheckUtils]: 25: Hoare triple {133#false} assume 1 == ~z_ev~0;~z_ev~0 := 2; {133#false} is VALID [2022-02-21 04:21:18,998 INFO L290 TraceCheckUtils]: 26: Hoare triple {133#false} assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret7#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; {133#false} is VALID [2022-02-21 04:21:18,998 INFO L290 TraceCheckUtils]: 27: Hoare triple {133#false} assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; {133#false} is VALID [2022-02-21 04:21:18,998 INFO L290 TraceCheckUtils]: 28: Hoare triple {133#false} exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; {133#false} is VALID [2022-02-21 04:21:18,998 INFO L290 TraceCheckUtils]: 29: Hoare triple {133#false} stop_simulation_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret7#1;havoc stop_simulation_#t~ret7#1; {133#false} is VALID [2022-02-21 04:21:18,998 INFO L290 TraceCheckUtils]: 30: Hoare triple {133#false} assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; {133#false} is VALID [2022-02-21 04:21:18,998 INFO L290 TraceCheckUtils]: 31: Hoare triple {133#false} stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; {133#false} is VALID [2022-02-21 04:21:18,998 INFO L290 TraceCheckUtils]: 32: Hoare triple {133#false} start_simulation_#t~ret8#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret8#1;havoc start_simulation_#t~ret8#1; {133#false} is VALID [2022-02-21 04:21:18,999 INFO L290 TraceCheckUtils]: 33: Hoare triple {133#false} assume !(0 != start_simulation_~tmp~3#1); {133#false} is VALID [2022-02-21 04:21:18,999 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:21:18,999 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:18,999 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2135772708] [2022-02-21 04:21:18,999 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2135772708] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:19,000 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:19,000 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 04:21:19,000 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605911841] [2022-02-21 04:21:19,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:19,001 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:21:19,002 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:21:19,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:21:19,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:21:19,028 INFO L87 Difference]: Start difference. First operand has 125 states, 124 states have (on average 1.5887096774193548) internal successors, (197), 124 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:19,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:19,223 INFO L93 Difference]: Finished difference Result 124 states and 190 transitions. [2022-02-21 04:21:19,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:21:19,224 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:19,246 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:21:19,252 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 124 states and 190 transitions. [2022-02-21 04:21:19,266 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 71 [2022-02-21 04:21:19,272 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 124 states to 117 states and 183 transitions. [2022-02-21 04:21:19,273 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2022-02-21 04:21:19,275 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2022-02-21 04:21:19,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 183 transitions. [2022-02-21 04:21:19,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:21:19,276 INFO L681 BuchiCegarLoop]: Abstraction has 117 states and 183 transitions. [2022-02-21 04:21:19,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 183 transitions. [2022-02-21 04:21:19,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-02-21 04:21:19,303 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:21:19,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states and 183 transitions. Second operand has 117 states, 117 states have (on average 1.564102564102564) internal successors, (183), 116 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:19,309 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states and 183 transitions. Second operand has 117 states, 117 states have (on average 1.564102564102564) internal successors, (183), 116 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:19,311 INFO L87 Difference]: Start difference. First operand 117 states and 183 transitions. Second operand has 117 states, 117 states have (on average 1.564102564102564) internal successors, (183), 116 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:19,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:19,317 INFO L93 Difference]: Finished difference Result 117 states and 183 transitions. [2022-02-21 04:21:19,318 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 183 transitions. [2022-02-21 04:21:19,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:19,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:19,320 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 117 states have (on average 1.564102564102564) internal successors, (183), 116 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 117 states and 183 transitions. [2022-02-21 04:21:19,321 INFO L87 Difference]: Start difference. First operand has 117 states, 117 states have (on average 1.564102564102564) internal successors, (183), 116 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 117 states and 183 transitions. [2022-02-21 04:21:19,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:19,326 INFO L93 Difference]: Finished difference Result 117 states and 183 transitions. [2022-02-21 04:21:19,327 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 183 transitions. [2022-02-21 04:21:19,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:19,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:19,329 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:21:19,329 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:21:19,330 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 117 states have (on average 1.564102564102564) internal successors, (183), 116 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:19,333 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 183 transitions. [2022-02-21 04:21:19,334 INFO L704 BuchiCegarLoop]: Abstraction has 117 states and 183 transitions. [2022-02-21 04:21:19,334 INFO L587 BuchiCegarLoop]: Abstraction has 117 states and 183 transitions. [2022-02-21 04:21:19,334 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:21:19,334 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 183 transitions. [2022-02-21 04:21:19,336 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 71 [2022-02-21 04:21:19,336 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:21:19,336 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:21:19,339 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:19,339 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:19,340 INFO L791 eck$LassoCheckResult]: Stem: 372#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(16, 2);call #Ultimate.allocInit(12, 3);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 320#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~2#1;havoc main_~__retres1~2#1;assume { :begin_inline_init_model } true;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 282#L490 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret8#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 283#L212 assume 1 == ~b0_req_up~0;assume { :begin_inline_update_b0 } true; 345#L137 assume !(~b0_val~0 != ~b0_val_t~0); 346#L137-2 ~b0_req_up~0 := 0; 340#L145 assume { :end_inline_update_b0 } true; 341#L212-2 assume !(1 == ~b1_req_up~0); 363#L219-1 assume !(1 == ~d0_req_up~0); 264#L226-1 assume !(1 == ~d1_req_up~0); 322#L233-1 assume !(1 == ~z_req_up~0); 350#L240-1 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 278#L255 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 279#L255-2 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 351#L321 assume !(0 == ~b0_ev~0); 352#L321-2 assume !(0 == ~b1_ev~0); 295#L326-1 assume !(0 == ~d0_ev~0); 296#L331-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 267#L336-1 assume !(0 == ~z_ev~0); 268#L341-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; 374#L107 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; 288#L129 is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; 335#L130 activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; 336#L390 assume !(0 != activate_threads_~tmp~1#1); 365#L390-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 334#L354 assume !(1 == ~b0_ev~0); 315#L354-2 assume !(1 == ~b1_ev~0); 316#L359-1 assume !(1 == ~d0_ev~0); 318#L364-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 319#L369-1 assume !(1 == ~z_ev~0); 324#L374-1 assume { :end_inline_reset_delta_events } true; 307#L432-2 [2022-02-21 04:21:19,341 INFO L793 eck$LassoCheckResult]: Loop: 307#L432-2 assume !false; 308#L433 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1; 265#L295 assume !false; 266#L286 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; 292#L268 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; 293#L275 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; 258#L276 eval_#t~ret4#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___0~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; 259#L290 assume !(0 != eval_~tmp___0~0#1); 325#L311 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; 326#L212-3 assume !(1 == ~b0_req_up~0); 354#L212-5 assume !(1 == ~b1_req_up~0); 310#L219-3 assume !(1 == ~d0_req_up~0); 260#L226-3 assume !(1 == ~d1_req_up~0); 261#L233-3 assume !(1 == ~z_req_up~0); 280#L240-3 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; 281#L321-3 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 347#L321-5 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 348#L326-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 330#L331-3 assume !(0 == ~d1_ev~0); 274#L336-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 275#L341-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; 284#L107-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; 300#L129-1 is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; 323#L130-1 activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; 269#L390-3 assume 0 != activate_threads_~tmp~1#1;~comp_m1_st~0 := 0; 270#L390-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 294#L354-3 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 304#L354-5 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 368#L359-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 362#L364-3 assume !(1 == ~d1_ev~0); 361#L369-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 327#L374-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret7#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; 328#L268-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; 355#L275-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; 317#L276-1 stop_simulation_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret7#1;havoc stop_simulation_#t~ret7#1; 276#L407 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 277#L414 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 369#L415 start_simulation_#t~ret8#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret8#1;havoc start_simulation_#t~ret8#1; 356#L449 assume !(0 != start_simulation_~tmp~3#1); 307#L432-2 [2022-02-21 04:21:19,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:19,342 INFO L85 PathProgramCache]: Analyzing trace with hash -1840469421, now seen corresponding path program 1 times [2022-02-21 04:21:19,342 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:19,343 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1441191893] [2022-02-21 04:21:19,343 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:19,343 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:19,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:19,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {612#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(16, 2);call #Ultimate.allocInit(12, 3);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; {612#true} is VALID [2022-02-21 04:21:19,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {612#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~2#1;havoc main_~__retres1~2#1;assume { :begin_inline_init_model } true;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; {614#(not (= ~b0_val_t~0 ~b0_val~0))} is VALID [2022-02-21 04:21:19,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {614#(not (= ~b0_val_t~0 ~b0_val~0))} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret8#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; {614#(not (= ~b0_val_t~0 ~b0_val~0))} is VALID [2022-02-21 04:21:19,399 INFO L290 TraceCheckUtils]: 3: Hoare triple {614#(not (= ~b0_val_t~0 ~b0_val~0))} assume 1 == ~b0_req_up~0;assume { :begin_inline_update_b0 } true; {614#(not (= ~b0_val_t~0 ~b0_val~0))} is VALID [2022-02-21 04:21:19,399 INFO L290 TraceCheckUtils]: 4: Hoare triple {614#(not (= ~b0_val_t~0 ~b0_val~0))} assume !(~b0_val~0 != ~b0_val_t~0); {613#false} is VALID [2022-02-21 04:21:19,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {613#false} ~b0_req_up~0 := 0; {613#false} is VALID [2022-02-21 04:21:19,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {613#false} assume { :end_inline_update_b0 } true; {613#false} is VALID [2022-02-21 04:21:19,400 INFO L290 TraceCheckUtils]: 7: Hoare triple {613#false} assume !(1 == ~b1_req_up~0); {613#false} is VALID [2022-02-21 04:21:19,400 INFO L290 TraceCheckUtils]: 8: Hoare triple {613#false} assume !(1 == ~d0_req_up~0); {613#false} is VALID [2022-02-21 04:21:19,400 INFO L290 TraceCheckUtils]: 9: Hoare triple {613#false} assume !(1 == ~d1_req_up~0); {613#false} is VALID [2022-02-21 04:21:19,400 INFO L290 TraceCheckUtils]: 10: Hoare triple {613#false} assume !(1 == ~z_req_up~0); {613#false} is VALID [2022-02-21 04:21:19,400 INFO L290 TraceCheckUtils]: 11: Hoare triple {613#false} assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; {613#false} is VALID [2022-02-21 04:21:19,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {613#false} assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; {613#false} is VALID [2022-02-21 04:21:19,401 INFO L290 TraceCheckUtils]: 13: Hoare triple {613#false} assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; {613#false} is VALID [2022-02-21 04:21:19,401 INFO L290 TraceCheckUtils]: 14: Hoare triple {613#false} assume !(0 == ~b0_ev~0); {613#false} is VALID [2022-02-21 04:21:19,401 INFO L290 TraceCheckUtils]: 15: Hoare triple {613#false} assume !(0 == ~b1_ev~0); {613#false} is VALID [2022-02-21 04:21:19,401 INFO L290 TraceCheckUtils]: 16: Hoare triple {613#false} assume !(0 == ~d0_ev~0); {613#false} is VALID [2022-02-21 04:21:19,401 INFO L290 TraceCheckUtils]: 17: Hoare triple {613#false} assume 0 == ~d1_ev~0;~d1_ev~0 := 1; {613#false} is VALID [2022-02-21 04:21:19,401 INFO L290 TraceCheckUtils]: 18: Hoare triple {613#false} assume !(0 == ~z_ev~0); {613#false} is VALID [2022-02-21 04:21:19,401 INFO L290 TraceCheckUtils]: 19: Hoare triple {613#false} assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; {613#false} is VALID [2022-02-21 04:21:19,402 INFO L290 TraceCheckUtils]: 20: Hoare triple {613#false} assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; {613#false} is VALID [2022-02-21 04:21:19,402 INFO L290 TraceCheckUtils]: 21: Hoare triple {613#false} is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; {613#false} is VALID [2022-02-21 04:21:19,402 INFO L290 TraceCheckUtils]: 22: Hoare triple {613#false} activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; {613#false} is VALID [2022-02-21 04:21:19,402 INFO L290 TraceCheckUtils]: 23: Hoare triple {613#false} assume !(0 != activate_threads_~tmp~1#1); {613#false} is VALID [2022-02-21 04:21:19,402 INFO L290 TraceCheckUtils]: 24: Hoare triple {613#false} assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; {613#false} is VALID [2022-02-21 04:21:19,402 INFO L290 TraceCheckUtils]: 25: Hoare triple {613#false} assume !(1 == ~b0_ev~0); {613#false} is VALID [2022-02-21 04:21:19,402 INFO L290 TraceCheckUtils]: 26: Hoare triple {613#false} assume !(1 == ~b1_ev~0); {613#false} is VALID [2022-02-21 04:21:19,403 INFO L290 TraceCheckUtils]: 27: Hoare triple {613#false} assume !(1 == ~d0_ev~0); {613#false} is VALID [2022-02-21 04:21:19,403 INFO L290 TraceCheckUtils]: 28: Hoare triple {613#false} assume 1 == ~d1_ev~0;~d1_ev~0 := 2; {613#false} is VALID [2022-02-21 04:21:19,403 INFO L290 TraceCheckUtils]: 29: Hoare triple {613#false} assume !(1 == ~z_ev~0); {613#false} is VALID [2022-02-21 04:21:19,403 INFO L290 TraceCheckUtils]: 30: Hoare triple {613#false} assume { :end_inline_reset_delta_events } true; {613#false} is VALID [2022-02-21 04:21:19,403 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:21:19,403 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:19,404 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1441191893] [2022-02-21 04:21:19,404 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1441191893] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:19,404 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:19,404 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:21:19,404 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266882609] [2022-02-21 04:21:19,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:19,405 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:21:19,406 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:19,406 INFO L85 PathProgramCache]: Analyzing trace with hash 1200633539, now seen corresponding path program 1 times [2022-02-21 04:21:19,406 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:19,406 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [18607254] [2022-02-21 04:21:19,406 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:19,406 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:19,432 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:19,461 INFO L290 TraceCheckUtils]: 0: Hoare triple {615#true} assume !false; {615#true} is VALID [2022-02-21 04:21:19,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {615#true} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1; {615#true} is VALID [2022-02-21 04:21:19,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {615#true} assume !false; {615#true} is VALID [2022-02-21 04:21:19,464 INFO L290 TraceCheckUtils]: 3: Hoare triple {615#true} assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; {615#true} is VALID [2022-02-21 04:21:19,465 INFO L290 TraceCheckUtils]: 4: Hoare triple {615#true} assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; {617#(<= 1 |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1|)} is VALID [2022-02-21 04:21:19,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {617#(<= 1 |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1|)} exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; {618#(<= 1 |ULTIMATE.start_exists_runnable_thread_#res#1|)} is VALID [2022-02-21 04:21:19,466 INFO L290 TraceCheckUtils]: 6: Hoare triple {618#(<= 1 |ULTIMATE.start_exists_runnable_thread_#res#1|)} eval_#t~ret4#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___0~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; {619#(<= 1 |ULTIMATE.start_eval_~tmp___0~0#1|)} is VALID [2022-02-21 04:21:19,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {619#(<= 1 |ULTIMATE.start_eval_~tmp___0~0#1|)} assume !(0 != eval_~tmp___0~0#1); {616#false} is VALID [2022-02-21 04:21:19,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {616#false} assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; {616#false} is VALID [2022-02-21 04:21:19,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {616#false} assume !(1 == ~b0_req_up~0); {616#false} is VALID [2022-02-21 04:21:19,467 INFO L290 TraceCheckUtils]: 10: Hoare triple {616#false} assume !(1 == ~b1_req_up~0); {616#false} is VALID [2022-02-21 04:21:19,470 INFO L290 TraceCheckUtils]: 11: Hoare triple {616#false} assume !(1 == ~d0_req_up~0); {616#false} is VALID [2022-02-21 04:21:19,471 INFO L290 TraceCheckUtils]: 12: Hoare triple {616#false} assume !(1 == ~d1_req_up~0); {616#false} is VALID [2022-02-21 04:21:19,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {616#false} assume !(1 == ~z_req_up~0); {616#false} is VALID [2022-02-21 04:21:19,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {616#false} assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; {616#false} is VALID [2022-02-21 04:21:19,473 INFO L290 TraceCheckUtils]: 15: Hoare triple {616#false} assume 0 == ~b0_ev~0;~b0_ev~0 := 1; {616#false} is VALID [2022-02-21 04:21:19,473 INFO L290 TraceCheckUtils]: 16: Hoare triple {616#false} assume 0 == ~b1_ev~0;~b1_ev~0 := 1; {616#false} is VALID [2022-02-21 04:21:19,473 INFO L290 TraceCheckUtils]: 17: Hoare triple {616#false} assume 0 == ~d0_ev~0;~d0_ev~0 := 1; {616#false} is VALID [2022-02-21 04:21:19,473 INFO L290 TraceCheckUtils]: 18: Hoare triple {616#false} assume !(0 == ~d1_ev~0); {616#false} is VALID [2022-02-21 04:21:19,473 INFO L290 TraceCheckUtils]: 19: Hoare triple {616#false} assume 0 == ~z_ev~0;~z_ev~0 := 1; {616#false} is VALID [2022-02-21 04:21:19,473 INFO L290 TraceCheckUtils]: 20: Hoare triple {616#false} assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; {616#false} is VALID [2022-02-21 04:21:19,473 INFO L290 TraceCheckUtils]: 21: Hoare triple {616#false} assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; {616#false} is VALID [2022-02-21 04:21:19,474 INFO L290 TraceCheckUtils]: 22: Hoare triple {616#false} is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; {616#false} is VALID [2022-02-21 04:21:19,474 INFO L290 TraceCheckUtils]: 23: Hoare triple {616#false} activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; {616#false} is VALID [2022-02-21 04:21:19,474 INFO L290 TraceCheckUtils]: 24: Hoare triple {616#false} assume 0 != activate_threads_~tmp~1#1;~comp_m1_st~0 := 0; {616#false} is VALID [2022-02-21 04:21:19,475 INFO L290 TraceCheckUtils]: 25: Hoare triple {616#false} assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; {616#false} is VALID [2022-02-21 04:21:19,475 INFO L290 TraceCheckUtils]: 26: Hoare triple {616#false} assume 1 == ~b0_ev~0;~b0_ev~0 := 2; {616#false} is VALID [2022-02-21 04:21:19,475 INFO L290 TraceCheckUtils]: 27: Hoare triple {616#false} assume 1 == ~b1_ev~0;~b1_ev~0 := 2; {616#false} is VALID [2022-02-21 04:21:19,476 INFO L290 TraceCheckUtils]: 28: Hoare triple {616#false} assume 1 == ~d0_ev~0;~d0_ev~0 := 2; {616#false} is VALID [2022-02-21 04:21:19,476 INFO L290 TraceCheckUtils]: 29: Hoare triple {616#false} assume !(1 == ~d1_ev~0); {616#false} is VALID [2022-02-21 04:21:19,483 INFO L290 TraceCheckUtils]: 30: Hoare triple {616#false} assume 1 == ~z_ev~0;~z_ev~0 := 2; {616#false} is VALID [2022-02-21 04:21:19,483 INFO L290 TraceCheckUtils]: 31: Hoare triple {616#false} assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret7#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; {616#false} is VALID [2022-02-21 04:21:19,483 INFO L290 TraceCheckUtils]: 32: Hoare triple {616#false} assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; {616#false} is VALID [2022-02-21 04:21:19,483 INFO L290 TraceCheckUtils]: 33: Hoare triple {616#false} exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; {616#false} is VALID [2022-02-21 04:21:19,484 INFO L290 TraceCheckUtils]: 34: Hoare triple {616#false} stop_simulation_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret7#1;havoc stop_simulation_#t~ret7#1; {616#false} is VALID [2022-02-21 04:21:19,484 INFO L290 TraceCheckUtils]: 35: Hoare triple {616#false} assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; {616#false} is VALID [2022-02-21 04:21:19,484 INFO L290 TraceCheckUtils]: 36: Hoare triple {616#false} stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; {616#false} is VALID [2022-02-21 04:21:19,484 INFO L290 TraceCheckUtils]: 37: Hoare triple {616#false} start_simulation_#t~ret8#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret8#1;havoc start_simulation_#t~ret8#1; {616#false} is VALID [2022-02-21 04:21:19,484 INFO L290 TraceCheckUtils]: 38: Hoare triple {616#false} assume !(0 != start_simulation_~tmp~3#1); {616#false} is VALID [2022-02-21 04:21:19,485 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:21:19,485 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:19,485 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [18607254] [2022-02-21 04:21:19,485 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [18607254] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:19,485 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:19,485 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:21:19,486 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528595778] [2022-02-21 04:21:19,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:19,486 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:21:19,486 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:21:19,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:21:19,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:21:19,487 INFO L87 Difference]: Start difference. First operand 117 states and 183 transitions. cyclomatic complexity: 67 Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:19,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:19,606 INFO L93 Difference]: Finished difference Result 117 states and 182 transitions. [2022-02-21 04:21:19,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:21:19,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:19,632 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:21:19,633 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 182 transitions. [2022-02-21 04:21:19,637 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 71 [2022-02-21 04:21:19,640 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 117 states and 182 transitions. [2022-02-21 04:21:19,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2022-02-21 04:21:19,641 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2022-02-21 04:21:19,641 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 182 transitions. [2022-02-21 04:21:19,641 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:21:19,641 INFO L681 BuchiCegarLoop]: Abstraction has 117 states and 182 transitions. [2022-02-21 04:21:19,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 182 transitions. [2022-02-21 04:21:19,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-02-21 04:21:19,652 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:21:19,652 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states and 182 transitions. Second operand has 117 states, 117 states have (on average 1.5555555555555556) internal successors, (182), 116 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:19,653 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states and 182 transitions. Second operand has 117 states, 117 states have (on average 1.5555555555555556) internal successors, (182), 116 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:19,653 INFO L87 Difference]: Start difference. First operand 117 states and 182 transitions. Second operand has 117 states, 117 states have (on average 1.5555555555555556) internal successors, (182), 116 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:19,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:19,656 INFO L93 Difference]: Finished difference Result 117 states and 182 transitions. [2022-02-21 04:21:19,656 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 182 transitions. [2022-02-21 04:21:19,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:19,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:19,659 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 117 states have (on average 1.5555555555555556) internal successors, (182), 116 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 117 states and 182 transitions. [2022-02-21 04:21:19,660 INFO L87 Difference]: Start difference. First operand has 117 states, 117 states have (on average 1.5555555555555556) internal successors, (182), 116 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 117 states and 182 transitions. [2022-02-21 04:21:19,662 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:19,662 INFO L93 Difference]: Finished difference Result 117 states and 182 transitions. [2022-02-21 04:21:19,662 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 182 transitions. [2022-02-21 04:21:19,663 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:19,663 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:19,663 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:21:19,663 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:21:19,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 117 states have (on average 1.5555555555555556) internal successors, (182), 116 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:19,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 182 transitions. [2022-02-21 04:21:19,666 INFO L704 BuchiCegarLoop]: Abstraction has 117 states and 182 transitions. [2022-02-21 04:21:19,666 INFO L587 BuchiCegarLoop]: Abstraction has 117 states and 182 transitions. [2022-02-21 04:21:19,666 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:21:19,667 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 182 transitions. [2022-02-21 04:21:19,668 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 71 [2022-02-21 04:21:19,668 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:21:19,668 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:21:19,670 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:19,670 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:19,670 INFO L791 eck$LassoCheckResult]: Stem: 851#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(16, 2);call #Ultimate.allocInit(12, 3);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 799#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~2#1;havoc main_~__retres1~2#1;assume { :begin_inline_init_model } true;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 761#L490 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret8#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 762#L212 assume 1 == ~b0_req_up~0;assume { :begin_inline_update_b0 } true; 824#L137 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 825#L137-2 ~b0_req_up~0 := 0; 819#L145 assume { :end_inline_update_b0 } true; 820#L212-2 assume !(1 == ~b1_req_up~0); 842#L219-1 assume !(1 == ~d0_req_up~0); 743#L226-1 assume !(1 == ~d1_req_up~0); 801#L233-1 assume !(1 == ~z_req_up~0); 829#L240-1 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 757#L255 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 758#L255-2 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 830#L321 assume !(0 == ~b0_ev~0); 831#L321-2 assume !(0 == ~b1_ev~0); 774#L326-1 assume !(0 == ~d0_ev~0); 775#L331-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 746#L336-1 assume !(0 == ~z_ev~0); 747#L341-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; 853#L107 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; 767#L129 is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; 814#L130 activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; 815#L390 assume !(0 != activate_threads_~tmp~1#1); 844#L390-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 813#L354 assume !(1 == ~b0_ev~0); 794#L354-2 assume !(1 == ~b1_ev~0); 795#L359-1 assume !(1 == ~d0_ev~0); 797#L364-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 798#L369-1 assume !(1 == ~z_ev~0); 803#L374-1 assume { :end_inline_reset_delta_events } true; 786#L432-2 [2022-02-21 04:21:19,670 INFO L793 eck$LassoCheckResult]: Loop: 786#L432-2 assume !false; 787#L433 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1; 744#L295 assume !false; 745#L286 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; 771#L268 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; 772#L275 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; 737#L276 eval_#t~ret4#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___0~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; 738#L290 assume !(0 != eval_~tmp___0~0#1); 804#L311 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; 805#L212-3 assume !(1 == ~b0_req_up~0); 833#L212-5 assume !(1 == ~b1_req_up~0); 789#L219-3 assume !(1 == ~d0_req_up~0); 739#L226-3 assume !(1 == ~d1_req_up~0); 740#L233-3 assume !(1 == ~z_req_up~0); 759#L240-3 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; 760#L321-3 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 826#L321-5 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 827#L326-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 809#L331-3 assume !(0 == ~d1_ev~0); 753#L336-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 754#L341-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; 763#L107-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; 779#L129-1 is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; 802#L130-1 activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; 748#L390-3 assume 0 != activate_threads_~tmp~1#1;~comp_m1_st~0 := 0; 749#L390-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 773#L354-3 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 783#L354-5 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 847#L359-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 841#L364-3 assume !(1 == ~d1_ev~0); 840#L369-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 806#L374-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret7#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; 807#L268-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; 834#L275-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; 796#L276-1 stop_simulation_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret7#1;havoc stop_simulation_#t~ret7#1; 755#L407 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 756#L414 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 848#L415 start_simulation_#t~ret8#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret8#1;havoc start_simulation_#t~ret8#1; 835#L449 assume !(0 != start_simulation_~tmp~3#1); 786#L432-2 [2022-02-21 04:21:19,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:19,672 INFO L85 PathProgramCache]: Analyzing trace with hash 531269841, now seen corresponding path program 1 times [2022-02-21 04:21:19,672 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:19,673 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968391160] [2022-02-21 04:21:19,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:19,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:19,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:19,723 INFO L290 TraceCheckUtils]: 0: Hoare triple {1091#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(16, 2);call #Ultimate.allocInit(12, 3);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; {1091#true} is VALID [2022-02-21 04:21:19,723 INFO L290 TraceCheckUtils]: 1: Hoare triple {1091#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~2#1;havoc main_~__retres1~2#1;assume { :begin_inline_init_model } true;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; {1093#(= 1 ~b1_req_up~0)} is VALID [2022-02-21 04:21:19,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {1093#(= 1 ~b1_req_up~0)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret8#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; {1093#(= 1 ~b1_req_up~0)} is VALID [2022-02-21 04:21:19,724 INFO L290 TraceCheckUtils]: 3: Hoare triple {1093#(= 1 ~b1_req_up~0)} assume 1 == ~b0_req_up~0;assume { :begin_inline_update_b0 } true; {1093#(= 1 ~b1_req_up~0)} is VALID [2022-02-21 04:21:19,724 INFO L290 TraceCheckUtils]: 4: Hoare triple {1093#(= 1 ~b1_req_up~0)} assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; {1093#(= 1 ~b1_req_up~0)} is VALID [2022-02-21 04:21:19,725 INFO L290 TraceCheckUtils]: 5: Hoare triple {1093#(= 1 ~b1_req_up~0)} ~b0_req_up~0 := 0; {1093#(= 1 ~b1_req_up~0)} is VALID [2022-02-21 04:21:19,725 INFO L290 TraceCheckUtils]: 6: Hoare triple {1093#(= 1 ~b1_req_up~0)} assume { :end_inline_update_b0 } true; {1093#(= 1 ~b1_req_up~0)} is VALID [2022-02-21 04:21:19,725 INFO L290 TraceCheckUtils]: 7: Hoare triple {1093#(= 1 ~b1_req_up~0)} assume !(1 == ~b1_req_up~0); {1092#false} is VALID [2022-02-21 04:21:19,725 INFO L290 TraceCheckUtils]: 8: Hoare triple {1092#false} assume !(1 == ~d0_req_up~0); {1092#false} is VALID [2022-02-21 04:21:19,725 INFO L290 TraceCheckUtils]: 9: Hoare triple {1092#false} assume !(1 == ~d1_req_up~0); {1092#false} is VALID [2022-02-21 04:21:19,726 INFO L290 TraceCheckUtils]: 10: Hoare triple {1092#false} assume !(1 == ~z_req_up~0); {1092#false} is VALID [2022-02-21 04:21:19,726 INFO L290 TraceCheckUtils]: 11: Hoare triple {1092#false} assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; {1092#false} is VALID [2022-02-21 04:21:19,726 INFO L290 TraceCheckUtils]: 12: Hoare triple {1092#false} assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; {1092#false} is VALID [2022-02-21 04:21:19,726 INFO L290 TraceCheckUtils]: 13: Hoare triple {1092#false} assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; {1092#false} is VALID [2022-02-21 04:21:19,726 INFO L290 TraceCheckUtils]: 14: Hoare triple {1092#false} assume !(0 == ~b0_ev~0); {1092#false} is VALID [2022-02-21 04:21:19,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {1092#false} assume !(0 == ~b1_ev~0); {1092#false} is VALID [2022-02-21 04:21:19,726 INFO L290 TraceCheckUtils]: 16: Hoare triple {1092#false} assume !(0 == ~d0_ev~0); {1092#false} is VALID [2022-02-21 04:21:19,726 INFO L290 TraceCheckUtils]: 17: Hoare triple {1092#false} assume 0 == ~d1_ev~0;~d1_ev~0 := 1; {1092#false} is VALID [2022-02-21 04:21:19,726 INFO L290 TraceCheckUtils]: 18: Hoare triple {1092#false} assume !(0 == ~z_ev~0); {1092#false} is VALID [2022-02-21 04:21:19,726 INFO L290 TraceCheckUtils]: 19: Hoare triple {1092#false} assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; {1092#false} is VALID [2022-02-21 04:21:19,727 INFO L290 TraceCheckUtils]: 20: Hoare triple {1092#false} assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; {1092#false} is VALID [2022-02-21 04:21:19,727 INFO L290 TraceCheckUtils]: 21: Hoare triple {1092#false} is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; {1092#false} is VALID [2022-02-21 04:21:19,727 INFO L290 TraceCheckUtils]: 22: Hoare triple {1092#false} activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; {1092#false} is VALID [2022-02-21 04:21:19,727 INFO L290 TraceCheckUtils]: 23: Hoare triple {1092#false} assume !(0 != activate_threads_~tmp~1#1); {1092#false} is VALID [2022-02-21 04:21:19,729 INFO L290 TraceCheckUtils]: 24: Hoare triple {1092#false} assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; {1092#false} is VALID [2022-02-21 04:21:19,729 INFO L290 TraceCheckUtils]: 25: Hoare triple {1092#false} assume !(1 == ~b0_ev~0); {1092#false} is VALID [2022-02-21 04:21:19,729 INFO L290 TraceCheckUtils]: 26: Hoare triple {1092#false} assume !(1 == ~b1_ev~0); {1092#false} is VALID [2022-02-21 04:21:19,729 INFO L290 TraceCheckUtils]: 27: Hoare triple {1092#false} assume !(1 == ~d0_ev~0); {1092#false} is VALID [2022-02-21 04:21:19,729 INFO L290 TraceCheckUtils]: 28: Hoare triple {1092#false} assume 1 == ~d1_ev~0;~d1_ev~0 := 2; {1092#false} is VALID [2022-02-21 04:21:19,729 INFO L290 TraceCheckUtils]: 29: Hoare triple {1092#false} assume !(1 == ~z_ev~0); {1092#false} is VALID [2022-02-21 04:21:19,729 INFO L290 TraceCheckUtils]: 30: Hoare triple {1092#false} assume { :end_inline_reset_delta_events } true; {1092#false} is VALID [2022-02-21 04:21:19,730 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:21:19,730 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:19,730 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968391160] [2022-02-21 04:21:19,731 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968391160] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:19,731 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:19,732 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:21:19,732 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1952584496] [2022-02-21 04:21:19,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:19,732 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:21:19,732 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:19,732 INFO L85 PathProgramCache]: Analyzing trace with hash 1200633539, now seen corresponding path program 2 times [2022-02-21 04:21:19,732 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:19,733 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176110845] [2022-02-21 04:21:19,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:19,733 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:19,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:19,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {1094#true} assume !false; {1094#true} is VALID [2022-02-21 04:21:19,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {1094#true} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1; {1094#true} is VALID [2022-02-21 04:21:19,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {1094#true} assume !false; {1094#true} is VALID [2022-02-21 04:21:19,787 INFO L290 TraceCheckUtils]: 3: Hoare triple {1094#true} assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; {1094#true} is VALID [2022-02-21 04:21:19,787 INFO L290 TraceCheckUtils]: 4: Hoare triple {1094#true} assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; {1096#(<= 1 |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1|)} is VALID [2022-02-21 04:21:19,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {1096#(<= 1 |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1|)} exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; {1097#(<= 1 |ULTIMATE.start_exists_runnable_thread_#res#1|)} is VALID [2022-02-21 04:21:19,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {1097#(<= 1 |ULTIMATE.start_exists_runnable_thread_#res#1|)} eval_#t~ret4#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___0~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; {1098#(<= 1 |ULTIMATE.start_eval_~tmp___0~0#1|)} is VALID [2022-02-21 04:21:19,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {1098#(<= 1 |ULTIMATE.start_eval_~tmp___0~0#1|)} assume !(0 != eval_~tmp___0~0#1); {1095#false} is VALID [2022-02-21 04:21:19,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {1095#false} assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; {1095#false} is VALID [2022-02-21 04:21:19,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {1095#false} assume !(1 == ~b0_req_up~0); {1095#false} is VALID [2022-02-21 04:21:19,788 INFO L290 TraceCheckUtils]: 10: Hoare triple {1095#false} assume !(1 == ~b1_req_up~0); {1095#false} is VALID [2022-02-21 04:21:19,789 INFO L290 TraceCheckUtils]: 11: Hoare triple {1095#false} assume !(1 == ~d0_req_up~0); {1095#false} is VALID [2022-02-21 04:21:19,789 INFO L290 TraceCheckUtils]: 12: Hoare triple {1095#false} assume !(1 == ~d1_req_up~0); {1095#false} is VALID [2022-02-21 04:21:19,789 INFO L290 TraceCheckUtils]: 13: Hoare triple {1095#false} assume !(1 == ~z_req_up~0); {1095#false} is VALID [2022-02-21 04:21:19,789 INFO L290 TraceCheckUtils]: 14: Hoare triple {1095#false} assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; {1095#false} is VALID [2022-02-21 04:21:19,789 INFO L290 TraceCheckUtils]: 15: Hoare triple {1095#false} assume 0 == ~b0_ev~0;~b0_ev~0 := 1; {1095#false} is VALID [2022-02-21 04:21:19,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {1095#false} assume 0 == ~b1_ev~0;~b1_ev~0 := 1; {1095#false} is VALID [2022-02-21 04:21:19,789 INFO L290 TraceCheckUtils]: 17: Hoare triple {1095#false} assume 0 == ~d0_ev~0;~d0_ev~0 := 1; {1095#false} is VALID [2022-02-21 04:21:19,789 INFO L290 TraceCheckUtils]: 18: Hoare triple {1095#false} assume !(0 == ~d1_ev~0); {1095#false} is VALID [2022-02-21 04:21:19,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {1095#false} assume 0 == ~z_ev~0;~z_ev~0 := 1; {1095#false} is VALID [2022-02-21 04:21:19,790 INFO L290 TraceCheckUtils]: 20: Hoare triple {1095#false} assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; {1095#false} is VALID [2022-02-21 04:21:19,790 INFO L290 TraceCheckUtils]: 21: Hoare triple {1095#false} assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; {1095#false} is VALID [2022-02-21 04:21:19,790 INFO L290 TraceCheckUtils]: 22: Hoare triple {1095#false} is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; {1095#false} is VALID [2022-02-21 04:21:19,790 INFO L290 TraceCheckUtils]: 23: Hoare triple {1095#false} activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; {1095#false} is VALID [2022-02-21 04:21:19,790 INFO L290 TraceCheckUtils]: 24: Hoare triple {1095#false} assume 0 != activate_threads_~tmp~1#1;~comp_m1_st~0 := 0; {1095#false} is VALID [2022-02-21 04:21:19,790 INFO L290 TraceCheckUtils]: 25: Hoare triple {1095#false} assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; {1095#false} is VALID [2022-02-21 04:21:19,791 INFO L290 TraceCheckUtils]: 26: Hoare triple {1095#false} assume 1 == ~b0_ev~0;~b0_ev~0 := 2; {1095#false} is VALID [2022-02-21 04:21:19,791 INFO L290 TraceCheckUtils]: 27: Hoare triple {1095#false} assume 1 == ~b1_ev~0;~b1_ev~0 := 2; {1095#false} is VALID [2022-02-21 04:21:19,791 INFO L290 TraceCheckUtils]: 28: Hoare triple {1095#false} assume 1 == ~d0_ev~0;~d0_ev~0 := 2; {1095#false} is VALID [2022-02-21 04:21:19,791 INFO L290 TraceCheckUtils]: 29: Hoare triple {1095#false} assume !(1 == ~d1_ev~0); {1095#false} is VALID [2022-02-21 04:21:19,791 INFO L290 TraceCheckUtils]: 30: Hoare triple {1095#false} assume 1 == ~z_ev~0;~z_ev~0 := 2; {1095#false} is VALID [2022-02-21 04:21:19,791 INFO L290 TraceCheckUtils]: 31: Hoare triple {1095#false} assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret7#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; {1095#false} is VALID [2022-02-21 04:21:19,791 INFO L290 TraceCheckUtils]: 32: Hoare triple {1095#false} assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; {1095#false} is VALID [2022-02-21 04:21:19,792 INFO L290 TraceCheckUtils]: 33: Hoare triple {1095#false} exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; {1095#false} is VALID [2022-02-21 04:21:19,792 INFO L290 TraceCheckUtils]: 34: Hoare triple {1095#false} stop_simulation_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret7#1;havoc stop_simulation_#t~ret7#1; {1095#false} is VALID [2022-02-21 04:21:19,792 INFO L290 TraceCheckUtils]: 35: Hoare triple {1095#false} assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; {1095#false} is VALID [2022-02-21 04:21:19,792 INFO L290 TraceCheckUtils]: 36: Hoare triple {1095#false} stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; {1095#false} is VALID [2022-02-21 04:21:19,792 INFO L290 TraceCheckUtils]: 37: Hoare triple {1095#false} start_simulation_#t~ret8#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret8#1;havoc start_simulation_#t~ret8#1; {1095#false} is VALID [2022-02-21 04:21:19,792 INFO L290 TraceCheckUtils]: 38: Hoare triple {1095#false} assume !(0 != start_simulation_~tmp~3#1); {1095#false} is VALID [2022-02-21 04:21:19,793 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:21:19,793 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:19,793 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176110845] [2022-02-21 04:21:19,793 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176110845] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:19,793 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:19,793 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:21:19,793 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1204326963] [2022-02-21 04:21:19,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:19,794 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:21:19,794 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:21:19,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:21:19,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:21:19,795 INFO L87 Difference]: Start difference. First operand 117 states and 182 transitions. cyclomatic complexity: 66 Second operand has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:19,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:19,909 INFO L93 Difference]: Finished difference Result 117 states and 181 transitions. [2022-02-21 04:21:19,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:21:19,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 10.333333333333334) internal successors, (31), 3 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:19,929 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:21:19,930 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 181 transitions. [2022-02-21 04:21:19,932 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 71 [2022-02-21 04:21:19,934 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 117 states and 181 transitions. [2022-02-21 04:21:19,934 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2022-02-21 04:21:19,935 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2022-02-21 04:21:19,935 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 181 transitions. [2022-02-21 04:21:19,935 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:21:19,935 INFO L681 BuchiCegarLoop]: Abstraction has 117 states and 181 transitions. [2022-02-21 04:21:19,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 181 transitions. [2022-02-21 04:21:19,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-02-21 04:21:19,938 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:21:19,938 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states and 181 transitions. Second operand has 117 states, 117 states have (on average 1.547008547008547) internal successors, (181), 116 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:19,938 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states and 181 transitions. Second operand has 117 states, 117 states have (on average 1.547008547008547) internal successors, (181), 116 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:19,939 INFO L87 Difference]: Start difference. First operand 117 states and 181 transitions. Second operand has 117 states, 117 states have (on average 1.547008547008547) internal successors, (181), 116 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:19,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:19,942 INFO L93 Difference]: Finished difference Result 117 states and 181 transitions. [2022-02-21 04:21:19,942 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 181 transitions. [2022-02-21 04:21:19,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:19,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:19,943 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 117 states have (on average 1.547008547008547) internal successors, (181), 116 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 117 states and 181 transitions. [2022-02-21 04:21:19,943 INFO L87 Difference]: Start difference. First operand has 117 states, 117 states have (on average 1.547008547008547) internal successors, (181), 116 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 117 states and 181 transitions. [2022-02-21 04:21:19,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:19,946 INFO L93 Difference]: Finished difference Result 117 states and 181 transitions. [2022-02-21 04:21:19,946 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 181 transitions. [2022-02-21 04:21:19,946 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:19,946 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:19,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:21:19,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:21:19,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 117 states have (on average 1.547008547008547) internal successors, (181), 116 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:19,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 181 transitions. [2022-02-21 04:21:19,950 INFO L704 BuchiCegarLoop]: Abstraction has 117 states and 181 transitions. [2022-02-21 04:21:19,950 INFO L587 BuchiCegarLoop]: Abstraction has 117 states and 181 transitions. [2022-02-21 04:21:19,950 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:21:19,950 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 181 transitions. [2022-02-21 04:21:19,951 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 71 [2022-02-21 04:21:19,951 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:21:19,951 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:21:19,951 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:19,952 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:19,952 INFO L791 eck$LassoCheckResult]: Stem: 1330#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(16, 2);call #Ultimate.allocInit(12, 3);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 1278#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~2#1;havoc main_~__retres1~2#1;assume { :begin_inline_init_model } true;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 1240#L490 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret8#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 1241#L212 assume 1 == ~b0_req_up~0;assume { :begin_inline_update_b0 } true; 1303#L137 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 1304#L137-2 ~b0_req_up~0 := 0; 1298#L145 assume { :end_inline_update_b0 } true; 1299#L212-2 assume 1 == ~b1_req_up~0;assume { :begin_inline_update_b1 } true; 1259#L152 assume !(~b1_val~0 != ~b1_val_t~0); 1260#L152-2 ~b1_req_up~0 := 0; 1322#L160 assume { :end_inline_update_b1 } true; 1321#L219-1 assume !(1 == ~d0_req_up~0); 1222#L226-1 assume !(1 == ~d1_req_up~0); 1280#L233-1 assume !(1 == ~z_req_up~0); 1308#L240-1 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 1236#L255 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 1237#L255-2 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 1309#L321 assume !(0 == ~b0_ev~0); 1310#L321-2 assume !(0 == ~b1_ev~0); 1253#L326-1 assume !(0 == ~d0_ev~0); 1254#L331-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 1225#L336-1 assume !(0 == ~z_ev~0); 1226#L341-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; 1332#L107 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; 1246#L129 is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; 1293#L130 activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; 1294#L390 assume !(0 != activate_threads_~tmp~1#1); 1323#L390-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 1292#L354 assume !(1 == ~b0_ev~0); 1273#L354-2 assume !(1 == ~b1_ev~0); 1274#L359-1 assume !(1 == ~d0_ev~0); 1276#L364-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 1277#L369-1 assume !(1 == ~z_ev~0); 1282#L374-1 assume { :end_inline_reset_delta_events } true; 1265#L432-2 [2022-02-21 04:21:19,952 INFO L793 eck$LassoCheckResult]: Loop: 1265#L432-2 assume !false; 1266#L433 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1; 1223#L295 assume !false; 1224#L286 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; 1250#L268 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; 1251#L275 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; 1216#L276 eval_#t~ret4#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___0~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; 1217#L290 assume !(0 != eval_~tmp___0~0#1); 1283#L311 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; 1284#L212-3 assume !(1 == ~b0_req_up~0); 1312#L212-5 assume !(1 == ~b1_req_up~0); 1268#L219-3 assume !(1 == ~d0_req_up~0); 1218#L226-3 assume !(1 == ~d1_req_up~0); 1219#L233-3 assume !(1 == ~z_req_up~0); 1238#L240-3 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; 1239#L321-3 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 1305#L321-5 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 1306#L326-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 1288#L331-3 assume !(0 == ~d1_ev~0); 1232#L336-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 1233#L341-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; 1242#L107-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; 1258#L129-1 is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; 1281#L130-1 activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; 1227#L390-3 assume 0 != activate_threads_~tmp~1#1;~comp_m1_st~0 := 0; 1228#L390-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 1252#L354-3 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 1262#L354-5 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 1326#L359-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 1320#L364-3 assume !(1 == ~d1_ev~0); 1319#L369-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 1285#L374-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret7#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; 1286#L268-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; 1313#L275-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; 1275#L276-1 stop_simulation_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret7#1;havoc stop_simulation_#t~ret7#1; 1234#L407 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 1235#L414 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 1327#L415 start_simulation_#t~ret8#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret8#1;havoc start_simulation_#t~ret8#1; 1314#L449 assume !(0 != start_simulation_~tmp~3#1); 1265#L432-2 [2022-02-21 04:21:19,952 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:19,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1296388927, now seen corresponding path program 1 times [2022-02-21 04:21:19,953 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:19,953 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1409129967] [2022-02-21 04:21:19,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:19,953 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:19,984 INFO L290 TraceCheckUtils]: 0: Hoare triple {1570#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(16, 2);call #Ultimate.allocInit(12, 3);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; {1570#true} is VALID [2022-02-21 04:21:19,985 INFO L290 TraceCheckUtils]: 1: Hoare triple {1570#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~2#1;havoc main_~__retres1~2#1;assume { :begin_inline_init_model } true;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; {1572#(and (= ~b1_val~0 ~b0_val~0) (= ~b1_val_t~0 ~b0_val_t~0))} is VALID [2022-02-21 04:21:19,985 INFO L290 TraceCheckUtils]: 2: Hoare triple {1572#(and (= ~b1_val~0 ~b0_val~0) (= ~b1_val_t~0 ~b0_val_t~0))} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret8#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; {1572#(and (= ~b1_val~0 ~b0_val~0) (= ~b1_val_t~0 ~b0_val_t~0))} is VALID [2022-02-21 04:21:19,985 INFO L290 TraceCheckUtils]: 3: Hoare triple {1572#(and (= ~b1_val~0 ~b0_val~0) (= ~b1_val_t~0 ~b0_val_t~0))} assume 1 == ~b0_req_up~0;assume { :begin_inline_update_b0 } true; {1572#(and (= ~b1_val~0 ~b0_val~0) (= ~b1_val_t~0 ~b0_val_t~0))} is VALID [2022-02-21 04:21:19,986 INFO L290 TraceCheckUtils]: 4: Hoare triple {1572#(and (= ~b1_val~0 ~b0_val~0) (= ~b1_val_t~0 ~b0_val_t~0))} assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; {1573#(not (= ~b1_val~0 ~b1_val_t~0))} is VALID [2022-02-21 04:21:19,986 INFO L290 TraceCheckUtils]: 5: Hoare triple {1573#(not (= ~b1_val~0 ~b1_val_t~0))} ~b0_req_up~0 := 0; {1573#(not (= ~b1_val~0 ~b1_val_t~0))} is VALID [2022-02-21 04:21:19,987 INFO L290 TraceCheckUtils]: 6: Hoare triple {1573#(not (= ~b1_val~0 ~b1_val_t~0))} assume { :end_inline_update_b0 } true; {1573#(not (= ~b1_val~0 ~b1_val_t~0))} is VALID [2022-02-21 04:21:19,987 INFO L290 TraceCheckUtils]: 7: Hoare triple {1573#(not (= ~b1_val~0 ~b1_val_t~0))} assume 1 == ~b1_req_up~0;assume { :begin_inline_update_b1 } true; {1573#(not (= ~b1_val~0 ~b1_val_t~0))} is VALID [2022-02-21 04:21:19,987 INFO L290 TraceCheckUtils]: 8: Hoare triple {1573#(not (= ~b1_val~0 ~b1_val_t~0))} assume !(~b1_val~0 != ~b1_val_t~0); {1571#false} is VALID [2022-02-21 04:21:19,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {1571#false} ~b1_req_up~0 := 0; {1571#false} is VALID [2022-02-21 04:21:19,987 INFO L290 TraceCheckUtils]: 10: Hoare triple {1571#false} assume { :end_inline_update_b1 } true; {1571#false} is VALID [2022-02-21 04:21:19,988 INFO L290 TraceCheckUtils]: 11: Hoare triple {1571#false} assume !(1 == ~d0_req_up~0); {1571#false} is VALID [2022-02-21 04:21:19,988 INFO L290 TraceCheckUtils]: 12: Hoare triple {1571#false} assume !(1 == ~d1_req_up~0); {1571#false} is VALID [2022-02-21 04:21:19,988 INFO L290 TraceCheckUtils]: 13: Hoare triple {1571#false} assume !(1 == ~z_req_up~0); {1571#false} is VALID [2022-02-21 04:21:19,988 INFO L290 TraceCheckUtils]: 14: Hoare triple {1571#false} assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; {1571#false} is VALID [2022-02-21 04:21:19,988 INFO L290 TraceCheckUtils]: 15: Hoare triple {1571#false} assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; {1571#false} is VALID [2022-02-21 04:21:19,988 INFO L290 TraceCheckUtils]: 16: Hoare triple {1571#false} assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; {1571#false} is VALID [2022-02-21 04:21:19,988 INFO L290 TraceCheckUtils]: 17: Hoare triple {1571#false} assume !(0 == ~b0_ev~0); {1571#false} is VALID [2022-02-21 04:21:19,989 INFO L290 TraceCheckUtils]: 18: Hoare triple {1571#false} assume !(0 == ~b1_ev~0); {1571#false} is VALID [2022-02-21 04:21:19,989 INFO L290 TraceCheckUtils]: 19: Hoare triple {1571#false} assume !(0 == ~d0_ev~0); {1571#false} is VALID [2022-02-21 04:21:19,989 INFO L290 TraceCheckUtils]: 20: Hoare triple {1571#false} assume 0 == ~d1_ev~0;~d1_ev~0 := 1; {1571#false} is VALID [2022-02-21 04:21:19,989 INFO L290 TraceCheckUtils]: 21: Hoare triple {1571#false} assume !(0 == ~z_ev~0); {1571#false} is VALID [2022-02-21 04:21:19,989 INFO L290 TraceCheckUtils]: 22: Hoare triple {1571#false} assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; {1571#false} is VALID [2022-02-21 04:21:19,989 INFO L290 TraceCheckUtils]: 23: Hoare triple {1571#false} assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; {1571#false} is VALID [2022-02-21 04:21:19,989 INFO L290 TraceCheckUtils]: 24: Hoare triple {1571#false} is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; {1571#false} is VALID [2022-02-21 04:21:19,990 INFO L290 TraceCheckUtils]: 25: Hoare triple {1571#false} activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; {1571#false} is VALID [2022-02-21 04:21:19,990 INFO L290 TraceCheckUtils]: 26: Hoare triple {1571#false} assume !(0 != activate_threads_~tmp~1#1); {1571#false} is VALID [2022-02-21 04:21:19,990 INFO L290 TraceCheckUtils]: 27: Hoare triple {1571#false} assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; {1571#false} is VALID [2022-02-21 04:21:19,990 INFO L290 TraceCheckUtils]: 28: Hoare triple {1571#false} assume !(1 == ~b0_ev~0); {1571#false} is VALID [2022-02-21 04:21:19,990 INFO L290 TraceCheckUtils]: 29: Hoare triple {1571#false} assume !(1 == ~b1_ev~0); {1571#false} is VALID [2022-02-21 04:21:19,990 INFO L290 TraceCheckUtils]: 30: Hoare triple {1571#false} assume !(1 == ~d0_ev~0); {1571#false} is VALID [2022-02-21 04:21:19,990 INFO L290 TraceCheckUtils]: 31: Hoare triple {1571#false} assume 1 == ~d1_ev~0;~d1_ev~0 := 2; {1571#false} is VALID [2022-02-21 04:21:19,990 INFO L290 TraceCheckUtils]: 32: Hoare triple {1571#false} assume !(1 == ~z_ev~0); {1571#false} is VALID [2022-02-21 04:21:19,991 INFO L290 TraceCheckUtils]: 33: Hoare triple {1571#false} assume { :end_inline_reset_delta_events } true; {1571#false} is VALID [2022-02-21 04:21:19,991 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:21:19,991 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:19,991 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1409129967] [2022-02-21 04:21:19,991 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1409129967] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:19,991 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:19,992 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 04:21:19,992 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072266423] [2022-02-21 04:21:19,992 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:19,992 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:21:19,992 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:19,993 INFO L85 PathProgramCache]: Analyzing trace with hash 1200633539, now seen corresponding path program 3 times [2022-02-21 04:21:19,993 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:19,993 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [946075089] [2022-02-21 04:21:19,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:19,993 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:19,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:20,030 INFO L290 TraceCheckUtils]: 0: Hoare triple {1574#true} assume !false; {1574#true} is VALID [2022-02-21 04:21:20,030 INFO L290 TraceCheckUtils]: 1: Hoare triple {1574#true} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1; {1574#true} is VALID [2022-02-21 04:21:20,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {1574#true} assume !false; {1574#true} is VALID [2022-02-21 04:21:20,031 INFO L290 TraceCheckUtils]: 3: Hoare triple {1574#true} assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; {1574#true} is VALID [2022-02-21 04:21:20,031 INFO L290 TraceCheckUtils]: 4: Hoare triple {1574#true} assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; {1576#(<= 1 |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1|)} is VALID [2022-02-21 04:21:20,031 INFO L290 TraceCheckUtils]: 5: Hoare triple {1576#(<= 1 |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1|)} exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; {1577#(<= 1 |ULTIMATE.start_exists_runnable_thread_#res#1|)} is VALID [2022-02-21 04:21:20,032 INFO L290 TraceCheckUtils]: 6: Hoare triple {1577#(<= 1 |ULTIMATE.start_exists_runnable_thread_#res#1|)} eval_#t~ret4#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___0~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; {1578#(<= 1 |ULTIMATE.start_eval_~tmp___0~0#1|)} is VALID [2022-02-21 04:21:20,032 INFO L290 TraceCheckUtils]: 7: Hoare triple {1578#(<= 1 |ULTIMATE.start_eval_~tmp___0~0#1|)} assume !(0 != eval_~tmp___0~0#1); {1575#false} is VALID [2022-02-21 04:21:20,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {1575#false} assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; {1575#false} is VALID [2022-02-21 04:21:20,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {1575#false} assume !(1 == ~b0_req_up~0); {1575#false} is VALID [2022-02-21 04:21:20,032 INFO L290 TraceCheckUtils]: 10: Hoare triple {1575#false} assume !(1 == ~b1_req_up~0); {1575#false} is VALID [2022-02-21 04:21:20,033 INFO L290 TraceCheckUtils]: 11: Hoare triple {1575#false} assume !(1 == ~d0_req_up~0); {1575#false} is VALID [2022-02-21 04:21:20,033 INFO L290 TraceCheckUtils]: 12: Hoare triple {1575#false} assume !(1 == ~d1_req_up~0); {1575#false} is VALID [2022-02-21 04:21:20,033 INFO L290 TraceCheckUtils]: 13: Hoare triple {1575#false} assume !(1 == ~z_req_up~0); {1575#false} is VALID [2022-02-21 04:21:20,033 INFO L290 TraceCheckUtils]: 14: Hoare triple {1575#false} assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; {1575#false} is VALID [2022-02-21 04:21:20,033 INFO L290 TraceCheckUtils]: 15: Hoare triple {1575#false} assume 0 == ~b0_ev~0;~b0_ev~0 := 1; {1575#false} is VALID [2022-02-21 04:21:20,033 INFO L290 TraceCheckUtils]: 16: Hoare triple {1575#false} assume 0 == ~b1_ev~0;~b1_ev~0 := 1; {1575#false} is VALID [2022-02-21 04:21:20,033 INFO L290 TraceCheckUtils]: 17: Hoare triple {1575#false} assume 0 == ~d0_ev~0;~d0_ev~0 := 1; {1575#false} is VALID [2022-02-21 04:21:20,034 INFO L290 TraceCheckUtils]: 18: Hoare triple {1575#false} assume !(0 == ~d1_ev~0); {1575#false} is VALID [2022-02-21 04:21:20,034 INFO L290 TraceCheckUtils]: 19: Hoare triple {1575#false} assume 0 == ~z_ev~0;~z_ev~0 := 1; {1575#false} is VALID [2022-02-21 04:21:20,034 INFO L290 TraceCheckUtils]: 20: Hoare triple {1575#false} assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; {1575#false} is VALID [2022-02-21 04:21:20,034 INFO L290 TraceCheckUtils]: 21: Hoare triple {1575#false} assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; {1575#false} is VALID [2022-02-21 04:21:20,034 INFO L290 TraceCheckUtils]: 22: Hoare triple {1575#false} is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; {1575#false} is VALID [2022-02-21 04:21:20,034 INFO L290 TraceCheckUtils]: 23: Hoare triple {1575#false} activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; {1575#false} is VALID [2022-02-21 04:21:20,034 INFO L290 TraceCheckUtils]: 24: Hoare triple {1575#false} assume 0 != activate_threads_~tmp~1#1;~comp_m1_st~0 := 0; {1575#false} is VALID [2022-02-21 04:21:20,035 INFO L290 TraceCheckUtils]: 25: Hoare triple {1575#false} assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; {1575#false} is VALID [2022-02-21 04:21:20,035 INFO L290 TraceCheckUtils]: 26: Hoare triple {1575#false} assume 1 == ~b0_ev~0;~b0_ev~0 := 2; {1575#false} is VALID [2022-02-21 04:21:20,035 INFO L290 TraceCheckUtils]: 27: Hoare triple {1575#false} assume 1 == ~b1_ev~0;~b1_ev~0 := 2; {1575#false} is VALID [2022-02-21 04:21:20,035 INFO L290 TraceCheckUtils]: 28: Hoare triple {1575#false} assume 1 == ~d0_ev~0;~d0_ev~0 := 2; {1575#false} is VALID [2022-02-21 04:21:20,035 INFO L290 TraceCheckUtils]: 29: Hoare triple {1575#false} assume !(1 == ~d1_ev~0); {1575#false} is VALID [2022-02-21 04:21:20,035 INFO L290 TraceCheckUtils]: 30: Hoare triple {1575#false} assume 1 == ~z_ev~0;~z_ev~0 := 2; {1575#false} is VALID [2022-02-21 04:21:20,035 INFO L290 TraceCheckUtils]: 31: Hoare triple {1575#false} assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret7#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; {1575#false} is VALID [2022-02-21 04:21:20,035 INFO L290 TraceCheckUtils]: 32: Hoare triple {1575#false} assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; {1575#false} is VALID [2022-02-21 04:21:20,036 INFO L290 TraceCheckUtils]: 33: Hoare triple {1575#false} exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; {1575#false} is VALID [2022-02-21 04:21:20,036 INFO L290 TraceCheckUtils]: 34: Hoare triple {1575#false} stop_simulation_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret7#1;havoc stop_simulation_#t~ret7#1; {1575#false} is VALID [2022-02-21 04:21:20,036 INFO L290 TraceCheckUtils]: 35: Hoare triple {1575#false} assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; {1575#false} is VALID [2022-02-21 04:21:20,036 INFO L290 TraceCheckUtils]: 36: Hoare triple {1575#false} stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; {1575#false} is VALID [2022-02-21 04:21:20,036 INFO L290 TraceCheckUtils]: 37: Hoare triple {1575#false} start_simulation_#t~ret8#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret8#1;havoc start_simulation_#t~ret8#1; {1575#false} is VALID [2022-02-21 04:21:20,036 INFO L290 TraceCheckUtils]: 38: Hoare triple {1575#false} assume !(0 != start_simulation_~tmp~3#1); {1575#false} is VALID [2022-02-21 04:21:20,037 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:21:20,037 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:20,037 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [946075089] [2022-02-21 04:21:20,037 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [946075089] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:20,037 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:20,037 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:21:20,037 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254260141] [2022-02-21 04:21:20,038 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:20,038 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:21:20,038 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:21:20,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 04:21:20,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 04:21:20,039 INFO L87 Difference]: Start difference. First operand 117 states and 181 transitions. cyclomatic complexity: 65 Second operand has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:20,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:20,223 INFO L93 Difference]: Finished difference Result 117 states and 180 transitions. [2022-02-21 04:21:20,223 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:21:20,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 8.5) internal successors, (34), 4 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:20,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:21:20,247 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 180 transitions. [2022-02-21 04:21:20,249 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 71 [2022-02-21 04:21:20,251 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 117 states and 180 transitions. [2022-02-21 04:21:20,251 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2022-02-21 04:21:20,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2022-02-21 04:21:20,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 180 transitions. [2022-02-21 04:21:20,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:21:20,253 INFO L681 BuchiCegarLoop]: Abstraction has 117 states and 180 transitions. [2022-02-21 04:21:20,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 180 transitions. [2022-02-21 04:21:20,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-02-21 04:21:20,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:21:20,263 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states and 180 transitions. Second operand has 117 states, 117 states have (on average 1.5384615384615385) internal successors, (180), 116 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:20,263 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states and 180 transitions. Second operand has 117 states, 117 states have (on average 1.5384615384615385) internal successors, (180), 116 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:20,264 INFO L87 Difference]: Start difference. First operand 117 states and 180 transitions. Second operand has 117 states, 117 states have (on average 1.5384615384615385) internal successors, (180), 116 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:20,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:20,266 INFO L93 Difference]: Finished difference Result 117 states and 180 transitions. [2022-02-21 04:21:20,266 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 180 transitions. [2022-02-21 04:21:20,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:20,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:20,267 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 117 states have (on average 1.5384615384615385) internal successors, (180), 116 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 117 states and 180 transitions. [2022-02-21 04:21:20,267 INFO L87 Difference]: Start difference. First operand has 117 states, 117 states have (on average 1.5384615384615385) internal successors, (180), 116 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 117 states and 180 transitions. [2022-02-21 04:21:20,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:20,269 INFO L93 Difference]: Finished difference Result 117 states and 180 transitions. [2022-02-21 04:21:20,270 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 180 transitions. [2022-02-21 04:21:20,270 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:20,270 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:20,270 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:21:20,270 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:21:20,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 117 states have (on average 1.5384615384615385) internal successors, (180), 116 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:20,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 180 transitions. [2022-02-21 04:21:20,272 INFO L704 BuchiCegarLoop]: Abstraction has 117 states and 180 transitions. [2022-02-21 04:21:20,272 INFO L587 BuchiCegarLoop]: Abstraction has 117 states and 180 transitions. [2022-02-21 04:21:20,272 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:21:20,272 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 180 transitions. [2022-02-21 04:21:20,273 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 71 [2022-02-21 04:21:20,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:21:20,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:21:20,274 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:20,274 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:20,274 INFO L791 eck$LassoCheckResult]: Stem: 1812#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(16, 2);call #Ultimate.allocInit(12, 3);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 1760#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~2#1;havoc main_~__retres1~2#1;assume { :begin_inline_init_model } true;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 1722#L490 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret8#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 1723#L212 assume 1 == ~b0_req_up~0;assume { :begin_inline_update_b0 } true; 1785#L137 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 1786#L137-2 ~b0_req_up~0 := 0; 1780#L145 assume { :end_inline_update_b0 } true; 1781#L212-2 assume 1 == ~b1_req_up~0;assume { :begin_inline_update_b1 } true; 1741#L152 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 1742#L152-2 ~b1_req_up~0 := 0; 1804#L160 assume { :end_inline_update_b1 } true; 1803#L219-1 assume !(1 == ~d0_req_up~0); 1704#L226-1 assume !(1 == ~d1_req_up~0); 1762#L233-1 assume !(1 == ~z_req_up~0); 1790#L240-1 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 1718#L255 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 1719#L255-2 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 1791#L321 assume !(0 == ~b0_ev~0); 1792#L321-2 assume !(0 == ~b1_ev~0); 1735#L326-1 assume !(0 == ~d0_ev~0); 1736#L331-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 1707#L336-1 assume !(0 == ~z_ev~0); 1708#L341-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; 1814#L107 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; 1728#L129 is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; 1775#L130 activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; 1776#L390 assume !(0 != activate_threads_~tmp~1#1); 1805#L390-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 1774#L354 assume !(1 == ~b0_ev~0); 1755#L354-2 assume !(1 == ~b1_ev~0); 1756#L359-1 assume !(1 == ~d0_ev~0); 1758#L364-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 1759#L369-1 assume !(1 == ~z_ev~0); 1764#L374-1 assume { :end_inline_reset_delta_events } true; 1747#L432-2 [2022-02-21 04:21:20,275 INFO L793 eck$LassoCheckResult]: Loop: 1747#L432-2 assume !false; 1748#L433 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1; 1705#L295 assume !false; 1706#L286 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; 1732#L268 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; 1733#L275 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; 1698#L276 eval_#t~ret4#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___0~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; 1699#L290 assume !(0 != eval_~tmp___0~0#1); 1765#L311 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; 1766#L212-3 assume !(1 == ~b0_req_up~0); 1794#L212-5 assume !(1 == ~b1_req_up~0); 1750#L219-3 assume !(1 == ~d0_req_up~0); 1700#L226-3 assume !(1 == ~d1_req_up~0); 1701#L233-3 assume !(1 == ~z_req_up~0); 1720#L240-3 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; 1721#L321-3 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 1787#L321-5 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 1788#L326-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 1770#L331-3 assume !(0 == ~d1_ev~0); 1714#L336-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 1715#L341-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; 1724#L107-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; 1740#L129-1 is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; 1763#L130-1 activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; 1709#L390-3 assume 0 != activate_threads_~tmp~1#1;~comp_m1_st~0 := 0; 1710#L390-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 1734#L354-3 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 1744#L354-5 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 1808#L359-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 1802#L364-3 assume !(1 == ~d1_ev~0); 1801#L369-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 1767#L374-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret7#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; 1768#L268-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; 1795#L275-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; 1757#L276-1 stop_simulation_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret7#1;havoc stop_simulation_#t~ret7#1; 1716#L407 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 1717#L414 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 1809#L415 start_simulation_#t~ret8#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret8#1;havoc start_simulation_#t~ret8#1; 1796#L449 assume !(0 != start_simulation_~tmp~3#1); 1747#L432-2 [2022-02-21 04:21:20,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:20,276 INFO L85 PathProgramCache]: Analyzing trace with hash 1234349313, now seen corresponding path program 1 times [2022-02-21 04:21:20,276 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:20,276 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002294257] [2022-02-21 04:21:20,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:20,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:20,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:20,320 INFO L290 TraceCheckUtils]: 0: Hoare triple {2052#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(16, 2);call #Ultimate.allocInit(12, 3);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; {2052#true} is VALID [2022-02-21 04:21:20,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {2052#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~2#1;havoc main_~__retres1~2#1;assume { :begin_inline_init_model } true;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; {2054#(= ~d0_req_up~0 1)} is VALID [2022-02-21 04:21:20,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {2054#(= ~d0_req_up~0 1)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret8#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; {2054#(= ~d0_req_up~0 1)} is VALID [2022-02-21 04:21:20,321 INFO L290 TraceCheckUtils]: 3: Hoare triple {2054#(= ~d0_req_up~0 1)} assume 1 == ~b0_req_up~0;assume { :begin_inline_update_b0 } true; {2054#(= ~d0_req_up~0 1)} is VALID [2022-02-21 04:21:20,321 INFO L290 TraceCheckUtils]: 4: Hoare triple {2054#(= ~d0_req_up~0 1)} assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; {2054#(= ~d0_req_up~0 1)} is VALID [2022-02-21 04:21:20,322 INFO L290 TraceCheckUtils]: 5: Hoare triple {2054#(= ~d0_req_up~0 1)} ~b0_req_up~0 := 0; {2054#(= ~d0_req_up~0 1)} is VALID [2022-02-21 04:21:20,322 INFO L290 TraceCheckUtils]: 6: Hoare triple {2054#(= ~d0_req_up~0 1)} assume { :end_inline_update_b0 } true; {2054#(= ~d0_req_up~0 1)} is VALID [2022-02-21 04:21:20,322 INFO L290 TraceCheckUtils]: 7: Hoare triple {2054#(= ~d0_req_up~0 1)} assume 1 == ~b1_req_up~0;assume { :begin_inline_update_b1 } true; {2054#(= ~d0_req_up~0 1)} is VALID [2022-02-21 04:21:20,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {2054#(= ~d0_req_up~0 1)} assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; {2054#(= ~d0_req_up~0 1)} is VALID [2022-02-21 04:21:20,324 INFO L290 TraceCheckUtils]: 9: Hoare triple {2054#(= ~d0_req_up~0 1)} ~b1_req_up~0 := 0; {2054#(= ~d0_req_up~0 1)} is VALID [2022-02-21 04:21:20,324 INFO L290 TraceCheckUtils]: 10: Hoare triple {2054#(= ~d0_req_up~0 1)} assume { :end_inline_update_b1 } true; {2054#(= ~d0_req_up~0 1)} is VALID [2022-02-21 04:21:20,324 INFO L290 TraceCheckUtils]: 11: Hoare triple {2054#(= ~d0_req_up~0 1)} assume !(1 == ~d0_req_up~0); {2053#false} is VALID [2022-02-21 04:21:20,324 INFO L290 TraceCheckUtils]: 12: Hoare triple {2053#false} assume !(1 == ~d1_req_up~0); {2053#false} is VALID [2022-02-21 04:21:20,324 INFO L290 TraceCheckUtils]: 13: Hoare triple {2053#false} assume !(1 == ~z_req_up~0); {2053#false} is VALID [2022-02-21 04:21:20,324 INFO L290 TraceCheckUtils]: 14: Hoare triple {2053#false} assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; {2053#false} is VALID [2022-02-21 04:21:20,324 INFO L290 TraceCheckUtils]: 15: Hoare triple {2053#false} assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; {2053#false} is VALID [2022-02-21 04:21:20,325 INFO L290 TraceCheckUtils]: 16: Hoare triple {2053#false} assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; {2053#false} is VALID [2022-02-21 04:21:20,325 INFO L290 TraceCheckUtils]: 17: Hoare triple {2053#false} assume !(0 == ~b0_ev~0); {2053#false} is VALID [2022-02-21 04:21:20,325 INFO L290 TraceCheckUtils]: 18: Hoare triple {2053#false} assume !(0 == ~b1_ev~0); {2053#false} is VALID [2022-02-21 04:21:20,325 INFO L290 TraceCheckUtils]: 19: Hoare triple {2053#false} assume !(0 == ~d0_ev~0); {2053#false} is VALID [2022-02-21 04:21:20,325 INFO L290 TraceCheckUtils]: 20: Hoare triple {2053#false} assume 0 == ~d1_ev~0;~d1_ev~0 := 1; {2053#false} is VALID [2022-02-21 04:21:20,325 INFO L290 TraceCheckUtils]: 21: Hoare triple {2053#false} assume !(0 == ~z_ev~0); {2053#false} is VALID [2022-02-21 04:21:20,325 INFO L290 TraceCheckUtils]: 22: Hoare triple {2053#false} assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; {2053#false} is VALID [2022-02-21 04:21:20,325 INFO L290 TraceCheckUtils]: 23: Hoare triple {2053#false} assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; {2053#false} is VALID [2022-02-21 04:21:20,325 INFO L290 TraceCheckUtils]: 24: Hoare triple {2053#false} is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; {2053#false} is VALID [2022-02-21 04:21:20,325 INFO L290 TraceCheckUtils]: 25: Hoare triple {2053#false} activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; {2053#false} is VALID [2022-02-21 04:21:20,325 INFO L290 TraceCheckUtils]: 26: Hoare triple {2053#false} assume !(0 != activate_threads_~tmp~1#1); {2053#false} is VALID [2022-02-21 04:21:20,325 INFO L290 TraceCheckUtils]: 27: Hoare triple {2053#false} assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; {2053#false} is VALID [2022-02-21 04:21:20,325 INFO L290 TraceCheckUtils]: 28: Hoare triple {2053#false} assume !(1 == ~b0_ev~0); {2053#false} is VALID [2022-02-21 04:21:20,325 INFO L290 TraceCheckUtils]: 29: Hoare triple {2053#false} assume !(1 == ~b1_ev~0); {2053#false} is VALID [2022-02-21 04:21:20,325 INFO L290 TraceCheckUtils]: 30: Hoare triple {2053#false} assume !(1 == ~d0_ev~0); {2053#false} is VALID [2022-02-21 04:21:20,326 INFO L290 TraceCheckUtils]: 31: Hoare triple {2053#false} assume 1 == ~d1_ev~0;~d1_ev~0 := 2; {2053#false} is VALID [2022-02-21 04:21:20,326 INFO L290 TraceCheckUtils]: 32: Hoare triple {2053#false} assume !(1 == ~z_ev~0); {2053#false} is VALID [2022-02-21 04:21:20,326 INFO L290 TraceCheckUtils]: 33: Hoare triple {2053#false} assume { :end_inline_reset_delta_events } true; {2053#false} is VALID [2022-02-21 04:21:20,326 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:21:20,326 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:20,326 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002294257] [2022-02-21 04:21:20,326 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002294257] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:20,326 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:20,326 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:21:20,326 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392329928] [2022-02-21 04:21:20,326 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:20,327 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:21:20,327 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:20,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1200633539, now seen corresponding path program 4 times [2022-02-21 04:21:20,327 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:20,327 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [331718744] [2022-02-21 04:21:20,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:20,327 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:20,367 INFO L290 TraceCheckUtils]: 0: Hoare triple {2055#true} assume !false; {2055#true} is VALID [2022-02-21 04:21:20,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {2055#true} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1; {2055#true} is VALID [2022-02-21 04:21:20,367 INFO L290 TraceCheckUtils]: 2: Hoare triple {2055#true} assume !false; {2055#true} is VALID [2022-02-21 04:21:20,367 INFO L290 TraceCheckUtils]: 3: Hoare triple {2055#true} assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; {2055#true} is VALID [2022-02-21 04:21:20,368 INFO L290 TraceCheckUtils]: 4: Hoare triple {2055#true} assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; {2057#(<= 1 |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1|)} is VALID [2022-02-21 04:21:20,368 INFO L290 TraceCheckUtils]: 5: Hoare triple {2057#(<= 1 |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1|)} exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; {2058#(<= 1 |ULTIMATE.start_exists_runnable_thread_#res#1|)} is VALID [2022-02-21 04:21:20,368 INFO L290 TraceCheckUtils]: 6: Hoare triple {2058#(<= 1 |ULTIMATE.start_exists_runnable_thread_#res#1|)} eval_#t~ret4#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___0~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; {2059#(<= 1 |ULTIMATE.start_eval_~tmp___0~0#1|)} is VALID [2022-02-21 04:21:20,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {2059#(<= 1 |ULTIMATE.start_eval_~tmp___0~0#1|)} assume !(0 != eval_~tmp___0~0#1); {2056#false} is VALID [2022-02-21 04:21:20,369 INFO L290 TraceCheckUtils]: 8: Hoare triple {2056#false} assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; {2056#false} is VALID [2022-02-21 04:21:20,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {2056#false} assume !(1 == ~b0_req_up~0); {2056#false} is VALID [2022-02-21 04:21:20,369 INFO L290 TraceCheckUtils]: 10: Hoare triple {2056#false} assume !(1 == ~b1_req_up~0); {2056#false} is VALID [2022-02-21 04:21:20,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {2056#false} assume !(1 == ~d0_req_up~0); {2056#false} is VALID [2022-02-21 04:21:20,369 INFO L290 TraceCheckUtils]: 12: Hoare triple {2056#false} assume !(1 == ~d1_req_up~0); {2056#false} is VALID [2022-02-21 04:21:20,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {2056#false} assume !(1 == ~z_req_up~0); {2056#false} is VALID [2022-02-21 04:21:20,369 INFO L290 TraceCheckUtils]: 14: Hoare triple {2056#false} assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; {2056#false} is VALID [2022-02-21 04:21:20,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {2056#false} assume 0 == ~b0_ev~0;~b0_ev~0 := 1; {2056#false} is VALID [2022-02-21 04:21:20,369 INFO L290 TraceCheckUtils]: 16: Hoare triple {2056#false} assume 0 == ~b1_ev~0;~b1_ev~0 := 1; {2056#false} is VALID [2022-02-21 04:21:20,369 INFO L290 TraceCheckUtils]: 17: Hoare triple {2056#false} assume 0 == ~d0_ev~0;~d0_ev~0 := 1; {2056#false} is VALID [2022-02-21 04:21:20,369 INFO L290 TraceCheckUtils]: 18: Hoare triple {2056#false} assume !(0 == ~d1_ev~0); {2056#false} is VALID [2022-02-21 04:21:20,369 INFO L290 TraceCheckUtils]: 19: Hoare triple {2056#false} assume 0 == ~z_ev~0;~z_ev~0 := 1; {2056#false} is VALID [2022-02-21 04:21:20,370 INFO L290 TraceCheckUtils]: 20: Hoare triple {2056#false} assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; {2056#false} is VALID [2022-02-21 04:21:20,370 INFO L290 TraceCheckUtils]: 21: Hoare triple {2056#false} assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; {2056#false} is VALID [2022-02-21 04:21:20,370 INFO L290 TraceCheckUtils]: 22: Hoare triple {2056#false} is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; {2056#false} is VALID [2022-02-21 04:21:20,370 INFO L290 TraceCheckUtils]: 23: Hoare triple {2056#false} activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; {2056#false} is VALID [2022-02-21 04:21:20,370 INFO L290 TraceCheckUtils]: 24: Hoare triple {2056#false} assume 0 != activate_threads_~tmp~1#1;~comp_m1_st~0 := 0; {2056#false} is VALID [2022-02-21 04:21:20,370 INFO L290 TraceCheckUtils]: 25: Hoare triple {2056#false} assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; {2056#false} is VALID [2022-02-21 04:21:20,370 INFO L290 TraceCheckUtils]: 26: Hoare triple {2056#false} assume 1 == ~b0_ev~0;~b0_ev~0 := 2; {2056#false} is VALID [2022-02-21 04:21:20,370 INFO L290 TraceCheckUtils]: 27: Hoare triple {2056#false} assume 1 == ~b1_ev~0;~b1_ev~0 := 2; {2056#false} is VALID [2022-02-21 04:21:20,371 INFO L290 TraceCheckUtils]: 28: Hoare triple {2056#false} assume 1 == ~d0_ev~0;~d0_ev~0 := 2; {2056#false} is VALID [2022-02-21 04:21:20,371 INFO L290 TraceCheckUtils]: 29: Hoare triple {2056#false} assume !(1 == ~d1_ev~0); {2056#false} is VALID [2022-02-21 04:21:20,371 INFO L290 TraceCheckUtils]: 30: Hoare triple {2056#false} assume 1 == ~z_ev~0;~z_ev~0 := 2; {2056#false} is VALID [2022-02-21 04:21:20,374 INFO L290 TraceCheckUtils]: 31: Hoare triple {2056#false} assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret7#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; {2056#false} is VALID [2022-02-21 04:21:20,374 INFO L290 TraceCheckUtils]: 32: Hoare triple {2056#false} assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; {2056#false} is VALID [2022-02-21 04:21:20,374 INFO L290 TraceCheckUtils]: 33: Hoare triple {2056#false} exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; {2056#false} is VALID [2022-02-21 04:21:20,374 INFO L290 TraceCheckUtils]: 34: Hoare triple {2056#false} stop_simulation_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret7#1;havoc stop_simulation_#t~ret7#1; {2056#false} is VALID [2022-02-21 04:21:20,374 INFO L290 TraceCheckUtils]: 35: Hoare triple {2056#false} assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; {2056#false} is VALID [2022-02-21 04:21:20,374 INFO L290 TraceCheckUtils]: 36: Hoare triple {2056#false} stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; {2056#false} is VALID [2022-02-21 04:21:20,374 INFO L290 TraceCheckUtils]: 37: Hoare triple {2056#false} start_simulation_#t~ret8#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret8#1;havoc start_simulation_#t~ret8#1; {2056#false} is VALID [2022-02-21 04:21:20,374 INFO L290 TraceCheckUtils]: 38: Hoare triple {2056#false} assume !(0 != start_simulation_~tmp~3#1); {2056#false} is VALID [2022-02-21 04:21:20,374 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:21:20,374 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:20,374 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [331718744] [2022-02-21 04:21:20,375 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [331718744] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:20,375 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:20,375 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:21:20,375 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063730974] [2022-02-21 04:21:20,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:20,375 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:21:20,375 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:21:20,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:21:20,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:21:20,376 INFO L87 Difference]: Start difference. First operand 117 states and 180 transitions. cyclomatic complexity: 64 Second operand has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:20,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:20,493 INFO L93 Difference]: Finished difference Result 117 states and 179 transitions. [2022-02-21 04:21:20,493 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:21:20,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 11.333333333333334) internal successors, (34), 3 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:20,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:21:20,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 179 transitions. [2022-02-21 04:21:20,518 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 71 [2022-02-21 04:21:20,522 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 117 states and 179 transitions. [2022-02-21 04:21:20,522 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2022-02-21 04:21:20,522 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2022-02-21 04:21:20,522 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 179 transitions. [2022-02-21 04:21:20,522 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:21:20,522 INFO L681 BuchiCegarLoop]: Abstraction has 117 states and 179 transitions. [2022-02-21 04:21:20,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 179 transitions. [2022-02-21 04:21:20,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-02-21 04:21:20,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:21:20,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states and 179 transitions. Second operand has 117 states, 117 states have (on average 1.5299145299145298) internal successors, (179), 116 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:20,524 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states and 179 transitions. Second operand has 117 states, 117 states have (on average 1.5299145299145298) internal successors, (179), 116 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:20,525 INFO L87 Difference]: Start difference. First operand 117 states and 179 transitions. Second operand has 117 states, 117 states have (on average 1.5299145299145298) internal successors, (179), 116 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:20,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:20,527 INFO L93 Difference]: Finished difference Result 117 states and 179 transitions. [2022-02-21 04:21:20,527 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 179 transitions. [2022-02-21 04:21:20,527 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:20,527 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:20,527 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 117 states have (on average 1.5299145299145298) internal successors, (179), 116 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 117 states and 179 transitions. [2022-02-21 04:21:20,528 INFO L87 Difference]: Start difference. First operand has 117 states, 117 states have (on average 1.5299145299145298) internal successors, (179), 116 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 117 states and 179 transitions. [2022-02-21 04:21:20,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:20,530 INFO L93 Difference]: Finished difference Result 117 states and 179 transitions. [2022-02-21 04:21:20,530 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 179 transitions. [2022-02-21 04:21:20,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:20,530 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:20,530 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:21:20,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:21:20,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 117 states have (on average 1.5299145299145298) internal successors, (179), 116 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:20,532 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 179 transitions. [2022-02-21 04:21:20,532 INFO L704 BuchiCegarLoop]: Abstraction has 117 states and 179 transitions. [2022-02-21 04:21:20,532 INFO L587 BuchiCegarLoop]: Abstraction has 117 states and 179 transitions. [2022-02-21 04:21:20,532 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 04:21:20,532 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 179 transitions. [2022-02-21 04:21:20,533 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 71 [2022-02-21 04:21:20,533 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:21:20,533 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:21:20,534 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:20,534 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:20,534 INFO L791 eck$LassoCheckResult]: Stem: 2291#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(16, 2);call #Ultimate.allocInit(12, 3);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 2239#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~2#1;havoc main_~__retres1~2#1;assume { :begin_inline_init_model } true;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 2201#L490 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret8#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 2202#L212 assume 1 == ~b0_req_up~0;assume { :begin_inline_update_b0 } true; 2264#L137 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 2265#L137-2 ~b0_req_up~0 := 0; 2259#L145 assume { :end_inline_update_b0 } true; 2260#L212-2 assume 1 == ~b1_req_up~0;assume { :begin_inline_update_b1 } true; 2220#L152 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 2221#L152-2 ~b1_req_up~0 := 0; 2283#L160 assume { :end_inline_update_b1 } true; 2282#L219-1 assume 1 == ~d0_req_up~0;assume { :begin_inline_update_d0 } true; 2204#L167 assume !(~d0_val~0 != ~d0_val_t~0); 2205#L167-2 ~d0_req_up~0 := 0; 2182#L175 assume { :end_inline_update_d0 } true; 2183#L226-1 assume !(1 == ~d1_req_up~0); 2241#L233-1 assume !(1 == ~z_req_up~0); 2269#L240-1 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 2197#L255 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 2198#L255-2 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 2270#L321 assume !(0 == ~b0_ev~0); 2271#L321-2 assume !(0 == ~b1_ev~0); 2214#L326-1 assume !(0 == ~d0_ev~0); 2215#L331-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 2186#L336-1 assume !(0 == ~z_ev~0); 2187#L341-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; 2293#L107 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; 2207#L129 is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; 2254#L130 activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; 2255#L390 assume !(0 != activate_threads_~tmp~1#1); 2284#L390-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 2253#L354 assume !(1 == ~b0_ev~0); 2234#L354-2 assume !(1 == ~b1_ev~0); 2235#L359-1 assume !(1 == ~d0_ev~0); 2237#L364-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 2238#L369-1 assume !(1 == ~z_ev~0); 2243#L374-1 assume { :end_inline_reset_delta_events } true; 2226#L432-2 [2022-02-21 04:21:20,534 INFO L793 eck$LassoCheckResult]: Loop: 2226#L432-2 assume !false; 2227#L433 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1; 2184#L295 assume !false; 2185#L286 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; 2211#L268 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; 2212#L275 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; 2177#L276 eval_#t~ret4#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___0~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; 2178#L290 assume !(0 != eval_~tmp___0~0#1); 2244#L311 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; 2245#L212-3 assume !(1 == ~b0_req_up~0); 2273#L212-5 assume !(1 == ~b1_req_up~0); 2229#L219-3 assume !(1 == ~d0_req_up~0); 2179#L226-3 assume !(1 == ~d1_req_up~0); 2180#L233-3 assume !(1 == ~z_req_up~0); 2199#L240-3 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; 2200#L321-3 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 2266#L321-5 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 2267#L326-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 2249#L331-3 assume !(0 == ~d1_ev~0); 2193#L336-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 2194#L341-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; 2203#L107-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; 2219#L129-1 is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; 2242#L130-1 activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; 2188#L390-3 assume 0 != activate_threads_~tmp~1#1;~comp_m1_st~0 := 0; 2189#L390-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 2213#L354-3 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 2223#L354-5 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 2287#L359-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 2281#L364-3 assume !(1 == ~d1_ev~0); 2280#L369-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 2246#L374-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret7#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; 2247#L268-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; 2274#L275-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; 2236#L276-1 stop_simulation_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret7#1;havoc stop_simulation_#t~ret7#1; 2195#L407 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 2196#L414 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 2288#L415 start_simulation_#t~ret8#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret8#1;havoc start_simulation_#t~ret8#1; 2275#L449 assume !(0 != start_simulation_~tmp~3#1); 2226#L432-2 [2022-02-21 04:21:20,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:20,535 INFO L85 PathProgramCache]: Analyzing trace with hash -2115080082, now seen corresponding path program 1 times [2022-02-21 04:21:20,535 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:20,535 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1498619481] [2022-02-21 04:21:20,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:20,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:20,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:20,559 INFO L290 TraceCheckUtils]: 0: Hoare triple {2531#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(16, 2);call #Ultimate.allocInit(12, 3);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; {2531#true} is VALID [2022-02-21 04:21:20,559 INFO L290 TraceCheckUtils]: 1: Hoare triple {2531#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~2#1;havoc main_~__retres1~2#1;assume { :begin_inline_init_model } true;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; {2533#(and (= ~d0_val_t~0 ~b0_val_t~0) (= ~d0_val~0 ~b0_val~0))} is VALID [2022-02-21 04:21:20,560 INFO L290 TraceCheckUtils]: 2: Hoare triple {2533#(and (= ~d0_val_t~0 ~b0_val_t~0) (= ~d0_val~0 ~b0_val~0))} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret8#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; {2533#(and (= ~d0_val_t~0 ~b0_val_t~0) (= ~d0_val~0 ~b0_val~0))} is VALID [2022-02-21 04:21:20,560 INFO L290 TraceCheckUtils]: 3: Hoare triple {2533#(and (= ~d0_val_t~0 ~b0_val_t~0) (= ~d0_val~0 ~b0_val~0))} assume 1 == ~b0_req_up~0;assume { :begin_inline_update_b0 } true; {2533#(and (= ~d0_val_t~0 ~b0_val_t~0) (= ~d0_val~0 ~b0_val~0))} is VALID [2022-02-21 04:21:20,560 INFO L290 TraceCheckUtils]: 4: Hoare triple {2533#(and (= ~d0_val_t~0 ~b0_val_t~0) (= ~d0_val~0 ~b0_val~0))} assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; {2534#(not (= ~d0_val_t~0 ~d0_val~0))} is VALID [2022-02-21 04:21:20,561 INFO L290 TraceCheckUtils]: 5: Hoare triple {2534#(not (= ~d0_val_t~0 ~d0_val~0))} ~b0_req_up~0 := 0; {2534#(not (= ~d0_val_t~0 ~d0_val~0))} is VALID [2022-02-21 04:21:20,561 INFO L290 TraceCheckUtils]: 6: Hoare triple {2534#(not (= ~d0_val_t~0 ~d0_val~0))} assume { :end_inline_update_b0 } true; {2534#(not (= ~d0_val_t~0 ~d0_val~0))} is VALID [2022-02-21 04:21:20,561 INFO L290 TraceCheckUtils]: 7: Hoare triple {2534#(not (= ~d0_val_t~0 ~d0_val~0))} assume 1 == ~b1_req_up~0;assume { :begin_inline_update_b1 } true; {2534#(not (= ~d0_val_t~0 ~d0_val~0))} is VALID [2022-02-21 04:21:20,561 INFO L290 TraceCheckUtils]: 8: Hoare triple {2534#(not (= ~d0_val_t~0 ~d0_val~0))} assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; {2534#(not (= ~d0_val_t~0 ~d0_val~0))} is VALID [2022-02-21 04:21:20,562 INFO L290 TraceCheckUtils]: 9: Hoare triple {2534#(not (= ~d0_val_t~0 ~d0_val~0))} ~b1_req_up~0 := 0; {2534#(not (= ~d0_val_t~0 ~d0_val~0))} is VALID [2022-02-21 04:21:20,562 INFO L290 TraceCheckUtils]: 10: Hoare triple {2534#(not (= ~d0_val_t~0 ~d0_val~0))} assume { :end_inline_update_b1 } true; {2534#(not (= ~d0_val_t~0 ~d0_val~0))} is VALID [2022-02-21 04:21:20,562 INFO L290 TraceCheckUtils]: 11: Hoare triple {2534#(not (= ~d0_val_t~0 ~d0_val~0))} assume 1 == ~d0_req_up~0;assume { :begin_inline_update_d0 } true; {2534#(not (= ~d0_val_t~0 ~d0_val~0))} is VALID [2022-02-21 04:21:20,563 INFO L290 TraceCheckUtils]: 12: Hoare triple {2534#(not (= ~d0_val_t~0 ~d0_val~0))} assume !(~d0_val~0 != ~d0_val_t~0); {2532#false} is VALID [2022-02-21 04:21:20,563 INFO L290 TraceCheckUtils]: 13: Hoare triple {2532#false} ~d0_req_up~0 := 0; {2532#false} is VALID [2022-02-21 04:21:20,563 INFO L290 TraceCheckUtils]: 14: Hoare triple {2532#false} assume { :end_inline_update_d0 } true; {2532#false} is VALID [2022-02-21 04:21:20,563 INFO L290 TraceCheckUtils]: 15: Hoare triple {2532#false} assume !(1 == ~d1_req_up~0); {2532#false} is VALID [2022-02-21 04:21:20,563 INFO L290 TraceCheckUtils]: 16: Hoare triple {2532#false} assume !(1 == ~z_req_up~0); {2532#false} is VALID [2022-02-21 04:21:20,563 INFO L290 TraceCheckUtils]: 17: Hoare triple {2532#false} assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; {2532#false} is VALID [2022-02-21 04:21:20,563 INFO L290 TraceCheckUtils]: 18: Hoare triple {2532#false} assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; {2532#false} is VALID [2022-02-21 04:21:20,563 INFO L290 TraceCheckUtils]: 19: Hoare triple {2532#false} assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; {2532#false} is VALID [2022-02-21 04:21:20,564 INFO L290 TraceCheckUtils]: 20: Hoare triple {2532#false} assume !(0 == ~b0_ev~0); {2532#false} is VALID [2022-02-21 04:21:20,564 INFO L290 TraceCheckUtils]: 21: Hoare triple {2532#false} assume !(0 == ~b1_ev~0); {2532#false} is VALID [2022-02-21 04:21:20,564 INFO L290 TraceCheckUtils]: 22: Hoare triple {2532#false} assume !(0 == ~d0_ev~0); {2532#false} is VALID [2022-02-21 04:21:20,564 INFO L290 TraceCheckUtils]: 23: Hoare triple {2532#false} assume 0 == ~d1_ev~0;~d1_ev~0 := 1; {2532#false} is VALID [2022-02-21 04:21:20,564 INFO L290 TraceCheckUtils]: 24: Hoare triple {2532#false} assume !(0 == ~z_ev~0); {2532#false} is VALID [2022-02-21 04:21:20,564 INFO L290 TraceCheckUtils]: 25: Hoare triple {2532#false} assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; {2532#false} is VALID [2022-02-21 04:21:20,564 INFO L290 TraceCheckUtils]: 26: Hoare triple {2532#false} assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; {2532#false} is VALID [2022-02-21 04:21:20,565 INFO L290 TraceCheckUtils]: 27: Hoare triple {2532#false} is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; {2532#false} is VALID [2022-02-21 04:21:20,565 INFO L290 TraceCheckUtils]: 28: Hoare triple {2532#false} activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; {2532#false} is VALID [2022-02-21 04:21:20,565 INFO L290 TraceCheckUtils]: 29: Hoare triple {2532#false} assume !(0 != activate_threads_~tmp~1#1); {2532#false} is VALID [2022-02-21 04:21:20,565 INFO L290 TraceCheckUtils]: 30: Hoare triple {2532#false} assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; {2532#false} is VALID [2022-02-21 04:21:20,565 INFO L290 TraceCheckUtils]: 31: Hoare triple {2532#false} assume !(1 == ~b0_ev~0); {2532#false} is VALID [2022-02-21 04:21:20,565 INFO L290 TraceCheckUtils]: 32: Hoare triple {2532#false} assume !(1 == ~b1_ev~0); {2532#false} is VALID [2022-02-21 04:21:20,565 INFO L290 TraceCheckUtils]: 33: Hoare triple {2532#false} assume !(1 == ~d0_ev~0); {2532#false} is VALID [2022-02-21 04:21:20,565 INFO L290 TraceCheckUtils]: 34: Hoare triple {2532#false} assume 1 == ~d1_ev~0;~d1_ev~0 := 2; {2532#false} is VALID [2022-02-21 04:21:20,566 INFO L290 TraceCheckUtils]: 35: Hoare triple {2532#false} assume !(1 == ~z_ev~0); {2532#false} is VALID [2022-02-21 04:21:20,566 INFO L290 TraceCheckUtils]: 36: Hoare triple {2532#false} assume { :end_inline_reset_delta_events } true; {2532#false} is VALID [2022-02-21 04:21:20,566 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:21:20,566 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:20,566 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1498619481] [2022-02-21 04:21:20,566 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1498619481] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:20,566 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:20,567 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 04:21:20,567 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1383033107] [2022-02-21 04:21:20,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:20,567 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:21:20,567 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:20,568 INFO L85 PathProgramCache]: Analyzing trace with hash 1200633539, now seen corresponding path program 5 times [2022-02-21 04:21:20,568 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:20,568 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378913803] [2022-02-21 04:21:20,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:20,568 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:20,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:20,589 INFO L290 TraceCheckUtils]: 0: Hoare triple {2535#true} assume !false; {2535#true} is VALID [2022-02-21 04:21:20,589 INFO L290 TraceCheckUtils]: 1: Hoare triple {2535#true} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1; {2535#true} is VALID [2022-02-21 04:21:20,589 INFO L290 TraceCheckUtils]: 2: Hoare triple {2535#true} assume !false; {2535#true} is VALID [2022-02-21 04:21:20,590 INFO L290 TraceCheckUtils]: 3: Hoare triple {2535#true} assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; {2535#true} is VALID [2022-02-21 04:21:20,590 INFO L290 TraceCheckUtils]: 4: Hoare triple {2535#true} assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; {2537#(<= 1 |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1|)} is VALID [2022-02-21 04:21:20,590 INFO L290 TraceCheckUtils]: 5: Hoare triple {2537#(<= 1 |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1|)} exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; {2538#(<= 1 |ULTIMATE.start_exists_runnable_thread_#res#1|)} is VALID [2022-02-21 04:21:20,591 INFO L290 TraceCheckUtils]: 6: Hoare triple {2538#(<= 1 |ULTIMATE.start_exists_runnable_thread_#res#1|)} eval_#t~ret4#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___0~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; {2539#(<= 1 |ULTIMATE.start_eval_~tmp___0~0#1|)} is VALID [2022-02-21 04:21:20,591 INFO L290 TraceCheckUtils]: 7: Hoare triple {2539#(<= 1 |ULTIMATE.start_eval_~tmp___0~0#1|)} assume !(0 != eval_~tmp___0~0#1); {2536#false} is VALID [2022-02-21 04:21:20,591 INFO L290 TraceCheckUtils]: 8: Hoare triple {2536#false} assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; {2536#false} is VALID [2022-02-21 04:21:20,591 INFO L290 TraceCheckUtils]: 9: Hoare triple {2536#false} assume !(1 == ~b0_req_up~0); {2536#false} is VALID [2022-02-21 04:21:20,591 INFO L290 TraceCheckUtils]: 10: Hoare triple {2536#false} assume !(1 == ~b1_req_up~0); {2536#false} is VALID [2022-02-21 04:21:20,591 INFO L290 TraceCheckUtils]: 11: Hoare triple {2536#false} assume !(1 == ~d0_req_up~0); {2536#false} is VALID [2022-02-21 04:21:20,592 INFO L290 TraceCheckUtils]: 12: Hoare triple {2536#false} assume !(1 == ~d1_req_up~0); {2536#false} is VALID [2022-02-21 04:21:20,592 INFO L290 TraceCheckUtils]: 13: Hoare triple {2536#false} assume !(1 == ~z_req_up~0); {2536#false} is VALID [2022-02-21 04:21:20,592 INFO L290 TraceCheckUtils]: 14: Hoare triple {2536#false} assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; {2536#false} is VALID [2022-02-21 04:21:20,592 INFO L290 TraceCheckUtils]: 15: Hoare triple {2536#false} assume 0 == ~b0_ev~0;~b0_ev~0 := 1; {2536#false} is VALID [2022-02-21 04:21:20,592 INFO L290 TraceCheckUtils]: 16: Hoare triple {2536#false} assume 0 == ~b1_ev~0;~b1_ev~0 := 1; {2536#false} is VALID [2022-02-21 04:21:20,592 INFO L290 TraceCheckUtils]: 17: Hoare triple {2536#false} assume 0 == ~d0_ev~0;~d0_ev~0 := 1; {2536#false} is VALID [2022-02-21 04:21:20,592 INFO L290 TraceCheckUtils]: 18: Hoare triple {2536#false} assume !(0 == ~d1_ev~0); {2536#false} is VALID [2022-02-21 04:21:20,592 INFO L290 TraceCheckUtils]: 19: Hoare triple {2536#false} assume 0 == ~z_ev~0;~z_ev~0 := 1; {2536#false} is VALID [2022-02-21 04:21:20,593 INFO L290 TraceCheckUtils]: 20: Hoare triple {2536#false} assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; {2536#false} is VALID [2022-02-21 04:21:20,593 INFO L290 TraceCheckUtils]: 21: Hoare triple {2536#false} assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; {2536#false} is VALID [2022-02-21 04:21:20,593 INFO L290 TraceCheckUtils]: 22: Hoare triple {2536#false} is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; {2536#false} is VALID [2022-02-21 04:21:20,593 INFO L290 TraceCheckUtils]: 23: Hoare triple {2536#false} activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; {2536#false} is VALID [2022-02-21 04:21:20,593 INFO L290 TraceCheckUtils]: 24: Hoare triple {2536#false} assume 0 != activate_threads_~tmp~1#1;~comp_m1_st~0 := 0; {2536#false} is VALID [2022-02-21 04:21:20,593 INFO L290 TraceCheckUtils]: 25: Hoare triple {2536#false} assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; {2536#false} is VALID [2022-02-21 04:21:20,593 INFO L290 TraceCheckUtils]: 26: Hoare triple {2536#false} assume 1 == ~b0_ev~0;~b0_ev~0 := 2; {2536#false} is VALID [2022-02-21 04:21:20,593 INFO L290 TraceCheckUtils]: 27: Hoare triple {2536#false} assume 1 == ~b1_ev~0;~b1_ev~0 := 2; {2536#false} is VALID [2022-02-21 04:21:20,594 INFO L290 TraceCheckUtils]: 28: Hoare triple {2536#false} assume 1 == ~d0_ev~0;~d0_ev~0 := 2; {2536#false} is VALID [2022-02-21 04:21:20,594 INFO L290 TraceCheckUtils]: 29: Hoare triple {2536#false} assume !(1 == ~d1_ev~0); {2536#false} is VALID [2022-02-21 04:21:20,594 INFO L290 TraceCheckUtils]: 30: Hoare triple {2536#false} assume 1 == ~z_ev~0;~z_ev~0 := 2; {2536#false} is VALID [2022-02-21 04:21:20,594 INFO L290 TraceCheckUtils]: 31: Hoare triple {2536#false} assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret7#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; {2536#false} is VALID [2022-02-21 04:21:20,594 INFO L290 TraceCheckUtils]: 32: Hoare triple {2536#false} assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; {2536#false} is VALID [2022-02-21 04:21:20,594 INFO L290 TraceCheckUtils]: 33: Hoare triple {2536#false} exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; {2536#false} is VALID [2022-02-21 04:21:20,594 INFO L290 TraceCheckUtils]: 34: Hoare triple {2536#false} stop_simulation_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret7#1;havoc stop_simulation_#t~ret7#1; {2536#false} is VALID [2022-02-21 04:21:20,594 INFO L290 TraceCheckUtils]: 35: Hoare triple {2536#false} assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; {2536#false} is VALID [2022-02-21 04:21:20,595 INFO L290 TraceCheckUtils]: 36: Hoare triple {2536#false} stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; {2536#false} is VALID [2022-02-21 04:21:20,595 INFO L290 TraceCheckUtils]: 37: Hoare triple {2536#false} start_simulation_#t~ret8#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret8#1;havoc start_simulation_#t~ret8#1; {2536#false} is VALID [2022-02-21 04:21:20,595 INFO L290 TraceCheckUtils]: 38: Hoare triple {2536#false} assume !(0 != start_simulation_~tmp~3#1); {2536#false} is VALID [2022-02-21 04:21:20,595 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:21:20,595 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:20,595 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378913803] [2022-02-21 04:21:20,596 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378913803] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:20,596 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:20,596 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:21:20,596 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [54251555] [2022-02-21 04:21:20,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:20,596 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:21:20,596 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:21:20,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 04:21:20,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 04:21:20,597 INFO L87 Difference]: Start difference. First operand 117 states and 179 transitions. cyclomatic complexity: 63 Second operand has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:20,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:20,761 INFO L93 Difference]: Finished difference Result 117 states and 178 transitions. [2022-02-21 04:21:20,761 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:21:20,762 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 9.25) internal successors, (37), 4 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:20,790 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:21:20,791 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 178 transitions. [2022-02-21 04:21:20,793 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 71 [2022-02-21 04:21:20,795 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 117 states and 178 transitions. [2022-02-21 04:21:20,795 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2022-02-21 04:21:20,795 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2022-02-21 04:21:20,795 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 178 transitions. [2022-02-21 04:21:20,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:21:20,796 INFO L681 BuchiCegarLoop]: Abstraction has 117 states and 178 transitions. [2022-02-21 04:21:20,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 178 transitions. [2022-02-21 04:21:20,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-02-21 04:21:20,797 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:21:20,797 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states and 178 transitions. Second operand has 117 states, 117 states have (on average 1.5213675213675213) internal successors, (178), 116 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:20,798 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states and 178 transitions. Second operand has 117 states, 117 states have (on average 1.5213675213675213) internal successors, (178), 116 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:20,798 INFO L87 Difference]: Start difference. First operand 117 states and 178 transitions. Second operand has 117 states, 117 states have (on average 1.5213675213675213) internal successors, (178), 116 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:20,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:20,800 INFO L93 Difference]: Finished difference Result 117 states and 178 transitions. [2022-02-21 04:21:20,800 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 178 transitions. [2022-02-21 04:21:20,800 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:20,800 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:20,800 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 117 states have (on average 1.5213675213675213) internal successors, (178), 116 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 117 states and 178 transitions. [2022-02-21 04:21:20,801 INFO L87 Difference]: Start difference. First operand has 117 states, 117 states have (on average 1.5213675213675213) internal successors, (178), 116 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 117 states and 178 transitions. [2022-02-21 04:21:20,802 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:20,802 INFO L93 Difference]: Finished difference Result 117 states and 178 transitions. [2022-02-21 04:21:20,802 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 178 transitions. [2022-02-21 04:21:20,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:20,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:20,803 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:21:20,803 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:21:20,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 117 states have (on average 1.5213675213675213) internal successors, (178), 116 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:20,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 178 transitions. [2022-02-21 04:21:20,805 INFO L704 BuchiCegarLoop]: Abstraction has 117 states and 178 transitions. [2022-02-21 04:21:20,805 INFO L587 BuchiCegarLoop]: Abstraction has 117 states and 178 transitions. [2022-02-21 04:21:20,805 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 04:21:20,806 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 178 transitions. [2022-02-21 04:21:20,806 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 71 [2022-02-21 04:21:20,806 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:21:20,806 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:21:20,807 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:20,807 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:20,807 INFO L791 eck$LassoCheckResult]: Stem: 2773#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(16, 2);call #Ultimate.allocInit(12, 3);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 2721#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~2#1;havoc main_~__retres1~2#1;assume { :begin_inline_init_model } true;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 2683#L490 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret8#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 2684#L212 assume 1 == ~b0_req_up~0;assume { :begin_inline_update_b0 } true; 2746#L137 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 2747#L137-2 ~b0_req_up~0 := 0; 2741#L145 assume { :end_inline_update_b0 } true; 2742#L212-2 assume 1 == ~b1_req_up~0;assume { :begin_inline_update_b1 } true; 2702#L152 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 2703#L152-2 ~b1_req_up~0 := 0; 2765#L160 assume { :end_inline_update_b1 } true; 2764#L219-1 assume 1 == ~d0_req_up~0;assume { :begin_inline_update_d0 } true; 2686#L167 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 2687#L167-2 ~d0_req_up~0 := 0; 2664#L175 assume { :end_inline_update_d0 } true; 2665#L226-1 assume !(1 == ~d1_req_up~0); 2724#L233-1 assume !(1 == ~z_req_up~0); 2753#L240-1 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 2679#L255 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 2680#L255-2 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 2750#L321 assume !(0 == ~b0_ev~0); 2751#L321-2 assume !(0 == ~b1_ev~0); 2696#L326-1 assume !(0 == ~d0_ev~0); 2697#L331-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 2668#L336-1 assume !(0 == ~z_ev~0); 2669#L341-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; 2775#L107 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; 2689#L129 is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; 2736#L130 activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; 2737#L390 assume !(0 != activate_threads_~tmp~1#1); 2766#L390-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 2735#L354 assume !(1 == ~b0_ev~0); 2716#L354-2 assume !(1 == ~b1_ev~0); 2717#L359-1 assume !(1 == ~d0_ev~0); 2719#L364-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 2720#L369-1 assume !(1 == ~z_ev~0); 2725#L374-1 assume { :end_inline_reset_delta_events } true; 2708#L432-2 [2022-02-21 04:21:20,807 INFO L793 eck$LassoCheckResult]: Loop: 2708#L432-2 assume !false; 2709#L433 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1; 2666#L295 assume !false; 2667#L286 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; 2693#L268 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; 2694#L275 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; 2659#L276 eval_#t~ret4#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___0~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; 2660#L290 assume !(0 != eval_~tmp___0~0#1); 2726#L311 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; 2727#L212-3 assume !(1 == ~b0_req_up~0); 2755#L212-5 assume !(1 == ~b1_req_up~0); 2711#L219-3 assume !(1 == ~d0_req_up~0); 2661#L226-3 assume !(1 == ~d1_req_up~0); 2662#L233-3 assume !(1 == ~z_req_up~0); 2681#L240-3 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; 2682#L321-3 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 2748#L321-5 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 2749#L326-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 2731#L331-3 assume !(0 == ~d1_ev~0); 2675#L336-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 2676#L341-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; 2685#L107-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; 2701#L129-1 is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; 2722#L130-1 activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; 2670#L390-3 assume 0 != activate_threads_~tmp~1#1;~comp_m1_st~0 := 0; 2671#L390-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 2695#L354-3 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 2705#L354-5 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 2769#L359-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 2763#L364-3 assume !(1 == ~d1_ev~0); 2762#L369-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 2728#L374-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret7#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; 2729#L268-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; 2756#L275-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; 2718#L276-1 stop_simulation_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret7#1;havoc stop_simulation_#t~ret7#1; 2677#L407 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 2678#L414 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 2770#L415 start_simulation_#t~ret8#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret8#1;havoc start_simulation_#t~ret8#1; 2757#L449 assume !(0 != start_simulation_~tmp~3#1); 2708#L432-2 [2022-02-21 04:21:20,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:20,808 INFO L85 PathProgramCache]: Analyzing trace with hash 2039338604, now seen corresponding path program 1 times [2022-02-21 04:21:20,808 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:20,808 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1087725782] [2022-02-21 04:21:20,808 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:20,808 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:20,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:20,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {3013#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(16, 2);call #Ultimate.allocInit(12, 3);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; {3013#true} is VALID [2022-02-21 04:21:20,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {3013#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~2#1;havoc main_~__retres1~2#1;assume { :begin_inline_init_model } true;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; {3015#(= ~d1_req_up~0 1)} is VALID [2022-02-21 04:21:20,824 INFO L290 TraceCheckUtils]: 2: Hoare triple {3015#(= ~d1_req_up~0 1)} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret8#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; {3015#(= ~d1_req_up~0 1)} is VALID [2022-02-21 04:21:20,825 INFO L290 TraceCheckUtils]: 3: Hoare triple {3015#(= ~d1_req_up~0 1)} assume 1 == ~b0_req_up~0;assume { :begin_inline_update_b0 } true; {3015#(= ~d1_req_up~0 1)} is VALID [2022-02-21 04:21:20,825 INFO L290 TraceCheckUtils]: 4: Hoare triple {3015#(= ~d1_req_up~0 1)} assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; {3015#(= ~d1_req_up~0 1)} is VALID [2022-02-21 04:21:20,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {3015#(= ~d1_req_up~0 1)} ~b0_req_up~0 := 0; {3015#(= ~d1_req_up~0 1)} is VALID [2022-02-21 04:21:20,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {3015#(= ~d1_req_up~0 1)} assume { :end_inline_update_b0 } true; {3015#(= ~d1_req_up~0 1)} is VALID [2022-02-21 04:21:20,826 INFO L290 TraceCheckUtils]: 7: Hoare triple {3015#(= ~d1_req_up~0 1)} assume 1 == ~b1_req_up~0;assume { :begin_inline_update_b1 } true; {3015#(= ~d1_req_up~0 1)} is VALID [2022-02-21 04:21:20,826 INFO L290 TraceCheckUtils]: 8: Hoare triple {3015#(= ~d1_req_up~0 1)} assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; {3015#(= ~d1_req_up~0 1)} is VALID [2022-02-21 04:21:20,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {3015#(= ~d1_req_up~0 1)} ~b1_req_up~0 := 0; {3015#(= ~d1_req_up~0 1)} is VALID [2022-02-21 04:21:20,827 INFO L290 TraceCheckUtils]: 10: Hoare triple {3015#(= ~d1_req_up~0 1)} assume { :end_inline_update_b1 } true; {3015#(= ~d1_req_up~0 1)} is VALID [2022-02-21 04:21:20,827 INFO L290 TraceCheckUtils]: 11: Hoare triple {3015#(= ~d1_req_up~0 1)} assume 1 == ~d0_req_up~0;assume { :begin_inline_update_d0 } true; {3015#(= ~d1_req_up~0 1)} is VALID [2022-02-21 04:21:20,831 INFO L290 TraceCheckUtils]: 12: Hoare triple {3015#(= ~d1_req_up~0 1)} assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; {3015#(= ~d1_req_up~0 1)} is VALID [2022-02-21 04:21:20,831 INFO L290 TraceCheckUtils]: 13: Hoare triple {3015#(= ~d1_req_up~0 1)} ~d0_req_up~0 := 0; {3015#(= ~d1_req_up~0 1)} is VALID [2022-02-21 04:21:20,832 INFO L290 TraceCheckUtils]: 14: Hoare triple {3015#(= ~d1_req_up~0 1)} assume { :end_inline_update_d0 } true; {3015#(= ~d1_req_up~0 1)} is VALID [2022-02-21 04:21:20,832 INFO L290 TraceCheckUtils]: 15: Hoare triple {3015#(= ~d1_req_up~0 1)} assume !(1 == ~d1_req_up~0); {3014#false} is VALID [2022-02-21 04:21:20,832 INFO L290 TraceCheckUtils]: 16: Hoare triple {3014#false} assume !(1 == ~z_req_up~0); {3014#false} is VALID [2022-02-21 04:21:20,832 INFO L290 TraceCheckUtils]: 17: Hoare triple {3014#false} assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; {3014#false} is VALID [2022-02-21 04:21:20,832 INFO L290 TraceCheckUtils]: 18: Hoare triple {3014#false} assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; {3014#false} is VALID [2022-02-21 04:21:20,832 INFO L290 TraceCheckUtils]: 19: Hoare triple {3014#false} assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; {3014#false} is VALID [2022-02-21 04:21:20,833 INFO L290 TraceCheckUtils]: 20: Hoare triple {3014#false} assume !(0 == ~b0_ev~0); {3014#false} is VALID [2022-02-21 04:21:20,833 INFO L290 TraceCheckUtils]: 21: Hoare triple {3014#false} assume !(0 == ~b1_ev~0); {3014#false} is VALID [2022-02-21 04:21:20,833 INFO L290 TraceCheckUtils]: 22: Hoare triple {3014#false} assume !(0 == ~d0_ev~0); {3014#false} is VALID [2022-02-21 04:21:20,833 INFO L290 TraceCheckUtils]: 23: Hoare triple {3014#false} assume 0 == ~d1_ev~0;~d1_ev~0 := 1; {3014#false} is VALID [2022-02-21 04:21:20,833 INFO L290 TraceCheckUtils]: 24: Hoare triple {3014#false} assume !(0 == ~z_ev~0); {3014#false} is VALID [2022-02-21 04:21:20,833 INFO L290 TraceCheckUtils]: 25: Hoare triple {3014#false} assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; {3014#false} is VALID [2022-02-21 04:21:20,833 INFO L290 TraceCheckUtils]: 26: Hoare triple {3014#false} assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; {3014#false} is VALID [2022-02-21 04:21:20,834 INFO L290 TraceCheckUtils]: 27: Hoare triple {3014#false} is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; {3014#false} is VALID [2022-02-21 04:21:20,834 INFO L290 TraceCheckUtils]: 28: Hoare triple {3014#false} activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; {3014#false} is VALID [2022-02-21 04:21:20,834 INFO L290 TraceCheckUtils]: 29: Hoare triple {3014#false} assume !(0 != activate_threads_~tmp~1#1); {3014#false} is VALID [2022-02-21 04:21:20,834 INFO L290 TraceCheckUtils]: 30: Hoare triple {3014#false} assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; {3014#false} is VALID [2022-02-21 04:21:20,834 INFO L290 TraceCheckUtils]: 31: Hoare triple {3014#false} assume !(1 == ~b0_ev~0); {3014#false} is VALID [2022-02-21 04:21:20,834 INFO L290 TraceCheckUtils]: 32: Hoare triple {3014#false} assume !(1 == ~b1_ev~0); {3014#false} is VALID [2022-02-21 04:21:20,834 INFO L290 TraceCheckUtils]: 33: Hoare triple {3014#false} assume !(1 == ~d0_ev~0); {3014#false} is VALID [2022-02-21 04:21:20,834 INFO L290 TraceCheckUtils]: 34: Hoare triple {3014#false} assume 1 == ~d1_ev~0;~d1_ev~0 := 2; {3014#false} is VALID [2022-02-21 04:21:20,835 INFO L290 TraceCheckUtils]: 35: Hoare triple {3014#false} assume !(1 == ~z_ev~0); {3014#false} is VALID [2022-02-21 04:21:20,835 INFO L290 TraceCheckUtils]: 36: Hoare triple {3014#false} assume { :end_inline_reset_delta_events } true; {3014#false} is VALID [2022-02-21 04:21:20,835 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:21:20,835 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:20,836 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1087725782] [2022-02-21 04:21:20,836 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1087725782] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:20,836 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:20,836 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:21:20,836 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083478983] [2022-02-21 04:21:20,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:20,837 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:21:20,837 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:20,837 INFO L85 PathProgramCache]: Analyzing trace with hash 1200633539, now seen corresponding path program 6 times [2022-02-21 04:21:20,837 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:20,837 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1473828108] [2022-02-21 04:21:20,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:20,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:20,842 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:20,866 INFO L290 TraceCheckUtils]: 0: Hoare triple {3016#true} assume !false; {3016#true} is VALID [2022-02-21 04:21:20,866 INFO L290 TraceCheckUtils]: 1: Hoare triple {3016#true} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1; {3016#true} is VALID [2022-02-21 04:21:20,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {3016#true} assume !false; {3016#true} is VALID [2022-02-21 04:21:20,867 INFO L290 TraceCheckUtils]: 3: Hoare triple {3016#true} assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; {3016#true} is VALID [2022-02-21 04:21:20,867 INFO L290 TraceCheckUtils]: 4: Hoare triple {3016#true} assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; {3018#(<= 1 |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1|)} is VALID [2022-02-21 04:21:20,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {3018#(<= 1 |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1|)} exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; {3019#(<= 1 |ULTIMATE.start_exists_runnable_thread_#res#1|)} is VALID [2022-02-21 04:21:20,868 INFO L290 TraceCheckUtils]: 6: Hoare triple {3019#(<= 1 |ULTIMATE.start_exists_runnable_thread_#res#1|)} eval_#t~ret4#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___0~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; {3020#(<= 1 |ULTIMATE.start_eval_~tmp___0~0#1|)} is VALID [2022-02-21 04:21:20,868 INFO L290 TraceCheckUtils]: 7: Hoare triple {3020#(<= 1 |ULTIMATE.start_eval_~tmp___0~0#1|)} assume !(0 != eval_~tmp___0~0#1); {3017#false} is VALID [2022-02-21 04:21:20,868 INFO L290 TraceCheckUtils]: 8: Hoare triple {3017#false} assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; {3017#false} is VALID [2022-02-21 04:21:20,868 INFO L290 TraceCheckUtils]: 9: Hoare triple {3017#false} assume !(1 == ~b0_req_up~0); {3017#false} is VALID [2022-02-21 04:21:20,868 INFO L290 TraceCheckUtils]: 10: Hoare triple {3017#false} assume !(1 == ~b1_req_up~0); {3017#false} is VALID [2022-02-21 04:21:20,869 INFO L290 TraceCheckUtils]: 11: Hoare triple {3017#false} assume !(1 == ~d0_req_up~0); {3017#false} is VALID [2022-02-21 04:21:20,869 INFO L290 TraceCheckUtils]: 12: Hoare triple {3017#false} assume !(1 == ~d1_req_up~0); {3017#false} is VALID [2022-02-21 04:21:20,869 INFO L290 TraceCheckUtils]: 13: Hoare triple {3017#false} assume !(1 == ~z_req_up~0); {3017#false} is VALID [2022-02-21 04:21:20,869 INFO L290 TraceCheckUtils]: 14: Hoare triple {3017#false} assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; {3017#false} is VALID [2022-02-21 04:21:20,869 INFO L290 TraceCheckUtils]: 15: Hoare triple {3017#false} assume 0 == ~b0_ev~0;~b0_ev~0 := 1; {3017#false} is VALID [2022-02-21 04:21:20,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {3017#false} assume 0 == ~b1_ev~0;~b1_ev~0 := 1; {3017#false} is VALID [2022-02-21 04:21:20,869 INFO L290 TraceCheckUtils]: 17: Hoare triple {3017#false} assume 0 == ~d0_ev~0;~d0_ev~0 := 1; {3017#false} is VALID [2022-02-21 04:21:20,870 INFO L290 TraceCheckUtils]: 18: Hoare triple {3017#false} assume !(0 == ~d1_ev~0); {3017#false} is VALID [2022-02-21 04:21:20,870 INFO L290 TraceCheckUtils]: 19: Hoare triple {3017#false} assume 0 == ~z_ev~0;~z_ev~0 := 1; {3017#false} is VALID [2022-02-21 04:21:20,870 INFO L290 TraceCheckUtils]: 20: Hoare triple {3017#false} assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; {3017#false} is VALID [2022-02-21 04:21:20,870 INFO L290 TraceCheckUtils]: 21: Hoare triple {3017#false} assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; {3017#false} is VALID [2022-02-21 04:21:20,870 INFO L290 TraceCheckUtils]: 22: Hoare triple {3017#false} is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; {3017#false} is VALID [2022-02-21 04:21:20,870 INFO L290 TraceCheckUtils]: 23: Hoare triple {3017#false} activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; {3017#false} is VALID [2022-02-21 04:21:20,871 INFO L290 TraceCheckUtils]: 24: Hoare triple {3017#false} assume 0 != activate_threads_~tmp~1#1;~comp_m1_st~0 := 0; {3017#false} is VALID [2022-02-21 04:21:20,871 INFO L290 TraceCheckUtils]: 25: Hoare triple {3017#false} assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; {3017#false} is VALID [2022-02-21 04:21:20,871 INFO L290 TraceCheckUtils]: 26: Hoare triple {3017#false} assume 1 == ~b0_ev~0;~b0_ev~0 := 2; {3017#false} is VALID [2022-02-21 04:21:20,871 INFO L290 TraceCheckUtils]: 27: Hoare triple {3017#false} assume 1 == ~b1_ev~0;~b1_ev~0 := 2; {3017#false} is VALID [2022-02-21 04:21:20,871 INFO L290 TraceCheckUtils]: 28: Hoare triple {3017#false} assume 1 == ~d0_ev~0;~d0_ev~0 := 2; {3017#false} is VALID [2022-02-21 04:21:20,871 INFO L290 TraceCheckUtils]: 29: Hoare triple {3017#false} assume !(1 == ~d1_ev~0); {3017#false} is VALID [2022-02-21 04:21:20,871 INFO L290 TraceCheckUtils]: 30: Hoare triple {3017#false} assume 1 == ~z_ev~0;~z_ev~0 := 2; {3017#false} is VALID [2022-02-21 04:21:20,871 INFO L290 TraceCheckUtils]: 31: Hoare triple {3017#false} assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret7#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; {3017#false} is VALID [2022-02-21 04:21:20,872 INFO L290 TraceCheckUtils]: 32: Hoare triple {3017#false} assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; {3017#false} is VALID [2022-02-21 04:21:20,872 INFO L290 TraceCheckUtils]: 33: Hoare triple {3017#false} exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; {3017#false} is VALID [2022-02-21 04:21:20,872 INFO L290 TraceCheckUtils]: 34: Hoare triple {3017#false} stop_simulation_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret7#1;havoc stop_simulation_#t~ret7#1; {3017#false} is VALID [2022-02-21 04:21:20,872 INFO L290 TraceCheckUtils]: 35: Hoare triple {3017#false} assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; {3017#false} is VALID [2022-02-21 04:21:20,872 INFO L290 TraceCheckUtils]: 36: Hoare triple {3017#false} stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; {3017#false} is VALID [2022-02-21 04:21:20,872 INFO L290 TraceCheckUtils]: 37: Hoare triple {3017#false} start_simulation_#t~ret8#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret8#1;havoc start_simulation_#t~ret8#1; {3017#false} is VALID [2022-02-21 04:21:20,872 INFO L290 TraceCheckUtils]: 38: Hoare triple {3017#false} assume !(0 != start_simulation_~tmp~3#1); {3017#false} is VALID [2022-02-21 04:21:20,873 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:21:20,873 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:20,873 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1473828108] [2022-02-21 04:21:20,873 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1473828108] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:20,873 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:20,873 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:21:20,873 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1733073361] [2022-02-21 04:21:20,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:20,874 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:21:20,874 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:21:20,874 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:21:20,874 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:21:20,875 INFO L87 Difference]: Start difference. First operand 117 states and 178 transitions. cyclomatic complexity: 62 Second operand has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:20,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:20,969 INFO L93 Difference]: Finished difference Result 117 states and 177 transitions. [2022-02-21 04:21:20,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:21:20,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 12.333333333333334) internal successors, (37), 3 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:20,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:21:20,994 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 117 states and 177 transitions. [2022-02-21 04:21:20,996 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 71 [2022-02-21 04:21:20,998 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 117 states to 117 states and 177 transitions. [2022-02-21 04:21:20,998 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 117 [2022-02-21 04:21:20,998 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 117 [2022-02-21 04:21:20,998 INFO L73 IsDeterministic]: Start isDeterministic. Operand 117 states and 177 transitions. [2022-02-21 04:21:20,999 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:21:20,999 INFO L681 BuchiCegarLoop]: Abstraction has 117 states and 177 transitions. [2022-02-21 04:21:20,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states and 177 transitions. [2022-02-21 04:21:21,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 117. [2022-02-21 04:21:21,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:21:21,000 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states and 177 transitions. Second operand has 117 states, 117 states have (on average 1.5128205128205128) internal successors, (177), 116 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:21,000 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states and 177 transitions. Second operand has 117 states, 117 states have (on average 1.5128205128205128) internal successors, (177), 116 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:21,001 INFO L87 Difference]: Start difference. First operand 117 states and 177 transitions. Second operand has 117 states, 117 states have (on average 1.5128205128205128) internal successors, (177), 116 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:21,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:21,002 INFO L93 Difference]: Finished difference Result 117 states and 177 transitions. [2022-02-21 04:21:21,002 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 177 transitions. [2022-02-21 04:21:21,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:21,003 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:21,003 INFO L74 IsIncluded]: Start isIncluded. First operand has 117 states, 117 states have (on average 1.5128205128205128) internal successors, (177), 116 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 117 states and 177 transitions. [2022-02-21 04:21:21,004 INFO L87 Difference]: Start difference. First operand has 117 states, 117 states have (on average 1.5128205128205128) internal successors, (177), 116 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 117 states and 177 transitions. [2022-02-21 04:21:21,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:21,010 INFO L93 Difference]: Finished difference Result 117 states and 177 transitions. [2022-02-21 04:21:21,010 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 177 transitions. [2022-02-21 04:21:21,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:21,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:21,011 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:21:21,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:21:21,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 117 states have (on average 1.5128205128205128) internal successors, (177), 116 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:21,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 177 transitions. [2022-02-21 04:21:21,012 INFO L704 BuchiCegarLoop]: Abstraction has 117 states and 177 transitions. [2022-02-21 04:21:21,013 INFO L587 BuchiCegarLoop]: Abstraction has 117 states and 177 transitions. [2022-02-21 04:21:21,013 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 04:21:21,013 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 117 states and 177 transitions. [2022-02-21 04:21:21,013 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 71 [2022-02-21 04:21:21,013 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:21:21,013 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:21:21,017 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:21,017 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:21,017 INFO L791 eck$LassoCheckResult]: Stem: 3252#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(16, 2);call #Ultimate.allocInit(12, 3);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 3200#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~2#1;havoc main_~__retres1~2#1;assume { :begin_inline_init_model } true;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 3162#L490 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret8#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 3163#L212 assume 1 == ~b0_req_up~0;assume { :begin_inline_update_b0 } true; 3225#L137 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 3226#L137-2 ~b0_req_up~0 := 0; 3219#L145 assume { :end_inline_update_b0 } true; 3220#L212-2 assume 1 == ~b1_req_up~0;assume { :begin_inline_update_b1 } true; 3181#L152 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 3182#L152-2 ~b1_req_up~0 := 0; 3244#L160 assume { :end_inline_update_b1 } true; 3243#L219-1 assume 1 == ~d0_req_up~0;assume { :begin_inline_update_d0 } true; 3165#L167 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 3166#L167-2 ~d0_req_up~0 := 0; 3143#L175 assume { :end_inline_update_d0 } true; 3144#L226-1 assume 1 == ~d1_req_up~0;assume { :begin_inline_update_d1 } true; 3202#L182 assume !(~d1_val~0 != ~d1_val_t~0); 3170#L182-2 ~d1_req_up~0 := 0; 3171#L190 assume { :end_inline_update_d1 } true; 3224#L233-1 assume !(1 == ~z_req_up~0); 3230#L240-1 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 3160#L255 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 3161#L255-2 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 3231#L321 assume !(0 == ~b0_ev~0); 3232#L321-2 assume !(0 == ~b1_ev~0); 3177#L326-1 assume !(0 == ~d0_ev~0); 3178#L331-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 3149#L336-1 assume !(0 == ~z_ev~0); 3150#L341-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; 3254#L107 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; 3168#L129 is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; 3216#L130 activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; 3217#L390 assume !(0 != activate_threads_~tmp~1#1); 3245#L390-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 3213#L354 assume !(1 == ~b0_ev~0); 3196#L354-2 assume !(1 == ~b1_ev~0); 3197#L359-1 assume !(1 == ~d0_ev~0); 3198#L364-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 3199#L369-1 assume !(1 == ~z_ev~0); 3205#L374-1 assume { :end_inline_reset_delta_events } true; 3187#L432-2 [2022-02-21 04:21:21,017 INFO L793 eck$LassoCheckResult]: Loop: 3187#L432-2 assume !false; 3188#L433 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1; 3145#L295 assume !false; 3146#L286 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; 3172#L268 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; 3173#L275 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; 3138#L276 eval_#t~ret4#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___0~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; 3139#L290 assume !(0 != eval_~tmp___0~0#1); 3203#L311 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; 3204#L212-3 assume !(1 == ~b0_req_up~0); 3234#L212-5 assume !(1 == ~b1_req_up~0); 3190#L219-3 assume !(1 == ~d0_req_up~0); 3140#L226-3 assume !(1 == ~d1_req_up~0); 3141#L233-3 assume !(1 == ~z_req_up~0); 3158#L240-3 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; 3159#L321-3 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 3227#L321-5 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 3228#L326-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 3209#L331-3 assume !(0 == ~d1_ev~0); 3154#L336-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 3155#L341-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; 3164#L107-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; 3180#L129-1 is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; 3201#L130-1 activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; 3147#L390-3 assume 0 != activate_threads_~tmp~1#1;~comp_m1_st~0 := 0; 3148#L390-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 3174#L354-3 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 3184#L354-5 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 3248#L359-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 3242#L364-3 assume !(1 == ~d1_ev~0); 3241#L369-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 3206#L374-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret7#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; 3207#L268-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; 3235#L275-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; 3195#L276-1 stop_simulation_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret7#1;havoc stop_simulation_#t~ret7#1; 3156#L407 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 3157#L414 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 3249#L415 start_simulation_#t~ret8#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret8#1;havoc start_simulation_#t~ret8#1; 3236#L449 assume !(0 != start_simulation_~tmp~3#1); 3187#L432-2 [2022-02-21 04:21:21,018 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:21,018 INFO L85 PathProgramCache]: Analyzing trace with hash -525437980, now seen corresponding path program 1 times [2022-02-21 04:21:21,018 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:21,019 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [157208351] [2022-02-21 04:21:21,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:21,019 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:21,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:21,045 INFO L290 TraceCheckUtils]: 0: Hoare triple {3492#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(16, 2);call #Ultimate.allocInit(12, 3);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; {3492#true} is VALID [2022-02-21 04:21:21,046 INFO L290 TraceCheckUtils]: 1: Hoare triple {3492#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~2#1;havoc main_~__retres1~2#1;assume { :begin_inline_init_model } true;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; {3494#(and (= ~b0_val~0 ~d1_val~0) (= ~d1_val_t~0 ~b0_val_t~0))} is VALID [2022-02-21 04:21:21,046 INFO L290 TraceCheckUtils]: 2: Hoare triple {3494#(and (= ~b0_val~0 ~d1_val~0) (= ~d1_val_t~0 ~b0_val_t~0))} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret8#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; {3494#(and (= ~b0_val~0 ~d1_val~0) (= ~d1_val_t~0 ~b0_val_t~0))} is VALID [2022-02-21 04:21:21,046 INFO L290 TraceCheckUtils]: 3: Hoare triple {3494#(and (= ~b0_val~0 ~d1_val~0) (= ~d1_val_t~0 ~b0_val_t~0))} assume 1 == ~b0_req_up~0;assume { :begin_inline_update_b0 } true; {3494#(and (= ~b0_val~0 ~d1_val~0) (= ~d1_val_t~0 ~b0_val_t~0))} is VALID [2022-02-21 04:21:21,047 INFO L290 TraceCheckUtils]: 4: Hoare triple {3494#(and (= ~b0_val~0 ~d1_val~0) (= ~d1_val_t~0 ~b0_val_t~0))} assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; {3495#(not (= ~d1_val_t~0 ~d1_val~0))} is VALID [2022-02-21 04:21:21,047 INFO L290 TraceCheckUtils]: 5: Hoare triple {3495#(not (= ~d1_val_t~0 ~d1_val~0))} ~b0_req_up~0 := 0; {3495#(not (= ~d1_val_t~0 ~d1_val~0))} is VALID [2022-02-21 04:21:21,047 INFO L290 TraceCheckUtils]: 6: Hoare triple {3495#(not (= ~d1_val_t~0 ~d1_val~0))} assume { :end_inline_update_b0 } true; {3495#(not (= ~d1_val_t~0 ~d1_val~0))} is VALID [2022-02-21 04:21:21,048 INFO L290 TraceCheckUtils]: 7: Hoare triple {3495#(not (= ~d1_val_t~0 ~d1_val~0))} assume 1 == ~b1_req_up~0;assume { :begin_inline_update_b1 } true; {3495#(not (= ~d1_val_t~0 ~d1_val~0))} is VALID [2022-02-21 04:21:21,048 INFO L290 TraceCheckUtils]: 8: Hoare triple {3495#(not (= ~d1_val_t~0 ~d1_val~0))} assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; {3495#(not (= ~d1_val_t~0 ~d1_val~0))} is VALID [2022-02-21 04:21:21,048 INFO L290 TraceCheckUtils]: 9: Hoare triple {3495#(not (= ~d1_val_t~0 ~d1_val~0))} ~b1_req_up~0 := 0; {3495#(not (= ~d1_val_t~0 ~d1_val~0))} is VALID [2022-02-21 04:21:21,048 INFO L290 TraceCheckUtils]: 10: Hoare triple {3495#(not (= ~d1_val_t~0 ~d1_val~0))} assume { :end_inline_update_b1 } true; {3495#(not (= ~d1_val_t~0 ~d1_val~0))} is VALID [2022-02-21 04:21:21,049 INFO L290 TraceCheckUtils]: 11: Hoare triple {3495#(not (= ~d1_val_t~0 ~d1_val~0))} assume 1 == ~d0_req_up~0;assume { :begin_inline_update_d0 } true; {3495#(not (= ~d1_val_t~0 ~d1_val~0))} is VALID [2022-02-21 04:21:21,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {3495#(not (= ~d1_val_t~0 ~d1_val~0))} assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; {3495#(not (= ~d1_val_t~0 ~d1_val~0))} is VALID [2022-02-21 04:21:21,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {3495#(not (= ~d1_val_t~0 ~d1_val~0))} ~d0_req_up~0 := 0; {3495#(not (= ~d1_val_t~0 ~d1_val~0))} is VALID [2022-02-21 04:21:21,049 INFO L290 TraceCheckUtils]: 14: Hoare triple {3495#(not (= ~d1_val_t~0 ~d1_val~0))} assume { :end_inline_update_d0 } true; {3495#(not (= ~d1_val_t~0 ~d1_val~0))} is VALID [2022-02-21 04:21:21,050 INFO L290 TraceCheckUtils]: 15: Hoare triple {3495#(not (= ~d1_val_t~0 ~d1_val~0))} assume 1 == ~d1_req_up~0;assume { :begin_inline_update_d1 } true; {3495#(not (= ~d1_val_t~0 ~d1_val~0))} is VALID [2022-02-21 04:21:21,050 INFO L290 TraceCheckUtils]: 16: Hoare triple {3495#(not (= ~d1_val_t~0 ~d1_val~0))} assume !(~d1_val~0 != ~d1_val_t~0); {3493#false} is VALID [2022-02-21 04:21:21,050 INFO L290 TraceCheckUtils]: 17: Hoare triple {3493#false} ~d1_req_up~0 := 0; {3493#false} is VALID [2022-02-21 04:21:21,050 INFO L290 TraceCheckUtils]: 18: Hoare triple {3493#false} assume { :end_inline_update_d1 } true; {3493#false} is VALID [2022-02-21 04:21:21,050 INFO L290 TraceCheckUtils]: 19: Hoare triple {3493#false} assume !(1 == ~z_req_up~0); {3493#false} is VALID [2022-02-21 04:21:21,051 INFO L290 TraceCheckUtils]: 20: Hoare triple {3493#false} assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; {3493#false} is VALID [2022-02-21 04:21:21,051 INFO L290 TraceCheckUtils]: 21: Hoare triple {3493#false} assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; {3493#false} is VALID [2022-02-21 04:21:21,051 INFO L290 TraceCheckUtils]: 22: Hoare triple {3493#false} assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; {3493#false} is VALID [2022-02-21 04:21:21,051 INFO L290 TraceCheckUtils]: 23: Hoare triple {3493#false} assume !(0 == ~b0_ev~0); {3493#false} is VALID [2022-02-21 04:21:21,051 INFO L290 TraceCheckUtils]: 24: Hoare triple {3493#false} assume !(0 == ~b1_ev~0); {3493#false} is VALID [2022-02-21 04:21:21,051 INFO L290 TraceCheckUtils]: 25: Hoare triple {3493#false} assume !(0 == ~d0_ev~0); {3493#false} is VALID [2022-02-21 04:21:21,051 INFO L290 TraceCheckUtils]: 26: Hoare triple {3493#false} assume 0 == ~d1_ev~0;~d1_ev~0 := 1; {3493#false} is VALID [2022-02-21 04:21:21,051 INFO L290 TraceCheckUtils]: 27: Hoare triple {3493#false} assume !(0 == ~z_ev~0); {3493#false} is VALID [2022-02-21 04:21:21,052 INFO L290 TraceCheckUtils]: 28: Hoare triple {3493#false} assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; {3493#false} is VALID [2022-02-21 04:21:21,052 INFO L290 TraceCheckUtils]: 29: Hoare triple {3493#false} assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; {3493#false} is VALID [2022-02-21 04:21:21,052 INFO L290 TraceCheckUtils]: 30: Hoare triple {3493#false} is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; {3493#false} is VALID [2022-02-21 04:21:21,052 INFO L290 TraceCheckUtils]: 31: Hoare triple {3493#false} activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; {3493#false} is VALID [2022-02-21 04:21:21,052 INFO L290 TraceCheckUtils]: 32: Hoare triple {3493#false} assume !(0 != activate_threads_~tmp~1#1); {3493#false} is VALID [2022-02-21 04:21:21,052 INFO L290 TraceCheckUtils]: 33: Hoare triple {3493#false} assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; {3493#false} is VALID [2022-02-21 04:21:21,052 INFO L290 TraceCheckUtils]: 34: Hoare triple {3493#false} assume !(1 == ~b0_ev~0); {3493#false} is VALID [2022-02-21 04:21:21,052 INFO L290 TraceCheckUtils]: 35: Hoare triple {3493#false} assume !(1 == ~b1_ev~0); {3493#false} is VALID [2022-02-21 04:21:21,053 INFO L290 TraceCheckUtils]: 36: Hoare triple {3493#false} assume !(1 == ~d0_ev~0); {3493#false} is VALID [2022-02-21 04:21:21,053 INFO L290 TraceCheckUtils]: 37: Hoare triple {3493#false} assume 1 == ~d1_ev~0;~d1_ev~0 := 2; {3493#false} is VALID [2022-02-21 04:21:21,053 INFO L290 TraceCheckUtils]: 38: Hoare triple {3493#false} assume !(1 == ~z_ev~0); {3493#false} is VALID [2022-02-21 04:21:21,053 INFO L290 TraceCheckUtils]: 39: Hoare triple {3493#false} assume { :end_inline_reset_delta_events } true; {3493#false} is VALID [2022-02-21 04:21:21,053 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:21:21,053 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:21,053 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [157208351] [2022-02-21 04:21:21,054 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [157208351] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:21,054 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:21,054 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 04:21:21,054 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [335227411] [2022-02-21 04:21:21,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:21,054 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:21:21,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:21,055 INFO L85 PathProgramCache]: Analyzing trace with hash 1200633539, now seen corresponding path program 7 times [2022-02-21 04:21:21,055 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:21,055 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902914247] [2022-02-21 04:21:21,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:21,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:21,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:21,077 INFO L290 TraceCheckUtils]: 0: Hoare triple {3496#true} assume !false; {3496#true} is VALID [2022-02-21 04:21:21,077 INFO L290 TraceCheckUtils]: 1: Hoare triple {3496#true} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1; {3496#true} is VALID [2022-02-21 04:21:21,077 INFO L290 TraceCheckUtils]: 2: Hoare triple {3496#true} assume !false; {3496#true} is VALID [2022-02-21 04:21:21,077 INFO L290 TraceCheckUtils]: 3: Hoare triple {3496#true} assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; {3496#true} is VALID [2022-02-21 04:21:21,077 INFO L290 TraceCheckUtils]: 4: Hoare triple {3496#true} assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; {3498#(<= 1 |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1|)} is VALID [2022-02-21 04:21:21,078 INFO L290 TraceCheckUtils]: 5: Hoare triple {3498#(<= 1 |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1|)} exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; {3499#(<= 1 |ULTIMATE.start_exists_runnable_thread_#res#1|)} is VALID [2022-02-21 04:21:21,078 INFO L290 TraceCheckUtils]: 6: Hoare triple {3499#(<= 1 |ULTIMATE.start_exists_runnable_thread_#res#1|)} eval_#t~ret4#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___0~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; {3500#(<= 1 |ULTIMATE.start_eval_~tmp___0~0#1|)} is VALID [2022-02-21 04:21:21,078 INFO L290 TraceCheckUtils]: 7: Hoare triple {3500#(<= 1 |ULTIMATE.start_eval_~tmp___0~0#1|)} assume !(0 != eval_~tmp___0~0#1); {3497#false} is VALID [2022-02-21 04:21:21,079 INFO L290 TraceCheckUtils]: 8: Hoare triple {3497#false} assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; {3497#false} is VALID [2022-02-21 04:21:21,079 INFO L290 TraceCheckUtils]: 9: Hoare triple {3497#false} assume !(1 == ~b0_req_up~0); {3497#false} is VALID [2022-02-21 04:21:21,079 INFO L290 TraceCheckUtils]: 10: Hoare triple {3497#false} assume !(1 == ~b1_req_up~0); {3497#false} is VALID [2022-02-21 04:21:21,079 INFO L290 TraceCheckUtils]: 11: Hoare triple {3497#false} assume !(1 == ~d0_req_up~0); {3497#false} is VALID [2022-02-21 04:21:21,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {3497#false} assume !(1 == ~d1_req_up~0); {3497#false} is VALID [2022-02-21 04:21:21,079 INFO L290 TraceCheckUtils]: 13: Hoare triple {3497#false} assume !(1 == ~z_req_up~0); {3497#false} is VALID [2022-02-21 04:21:21,079 INFO L290 TraceCheckUtils]: 14: Hoare triple {3497#false} assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; {3497#false} is VALID [2022-02-21 04:21:21,079 INFO L290 TraceCheckUtils]: 15: Hoare triple {3497#false} assume 0 == ~b0_ev~0;~b0_ev~0 := 1; {3497#false} is VALID [2022-02-21 04:21:21,080 INFO L290 TraceCheckUtils]: 16: Hoare triple {3497#false} assume 0 == ~b1_ev~0;~b1_ev~0 := 1; {3497#false} is VALID [2022-02-21 04:21:21,090 INFO L290 TraceCheckUtils]: 17: Hoare triple {3497#false} assume 0 == ~d0_ev~0;~d0_ev~0 := 1; {3497#false} is VALID [2022-02-21 04:21:21,090 INFO L290 TraceCheckUtils]: 18: Hoare triple {3497#false} assume !(0 == ~d1_ev~0); {3497#false} is VALID [2022-02-21 04:21:21,090 INFO L290 TraceCheckUtils]: 19: Hoare triple {3497#false} assume 0 == ~z_ev~0;~z_ev~0 := 1; {3497#false} is VALID [2022-02-21 04:21:21,091 INFO L290 TraceCheckUtils]: 20: Hoare triple {3497#false} assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; {3497#false} is VALID [2022-02-21 04:21:21,091 INFO L290 TraceCheckUtils]: 21: Hoare triple {3497#false} assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; {3497#false} is VALID [2022-02-21 04:21:21,091 INFO L290 TraceCheckUtils]: 22: Hoare triple {3497#false} is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; {3497#false} is VALID [2022-02-21 04:21:21,091 INFO L290 TraceCheckUtils]: 23: Hoare triple {3497#false} activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; {3497#false} is VALID [2022-02-21 04:21:21,091 INFO L290 TraceCheckUtils]: 24: Hoare triple {3497#false} assume 0 != activate_threads_~tmp~1#1;~comp_m1_st~0 := 0; {3497#false} is VALID [2022-02-21 04:21:21,091 INFO L290 TraceCheckUtils]: 25: Hoare triple {3497#false} assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; {3497#false} is VALID [2022-02-21 04:21:21,091 INFO L290 TraceCheckUtils]: 26: Hoare triple {3497#false} assume 1 == ~b0_ev~0;~b0_ev~0 := 2; {3497#false} is VALID [2022-02-21 04:21:21,091 INFO L290 TraceCheckUtils]: 27: Hoare triple {3497#false} assume 1 == ~b1_ev~0;~b1_ev~0 := 2; {3497#false} is VALID [2022-02-21 04:21:21,092 INFO L290 TraceCheckUtils]: 28: Hoare triple {3497#false} assume 1 == ~d0_ev~0;~d0_ev~0 := 2; {3497#false} is VALID [2022-02-21 04:21:21,092 INFO L290 TraceCheckUtils]: 29: Hoare triple {3497#false} assume !(1 == ~d1_ev~0); {3497#false} is VALID [2022-02-21 04:21:21,092 INFO L290 TraceCheckUtils]: 30: Hoare triple {3497#false} assume 1 == ~z_ev~0;~z_ev~0 := 2; {3497#false} is VALID [2022-02-21 04:21:21,092 INFO L290 TraceCheckUtils]: 31: Hoare triple {3497#false} assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret7#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; {3497#false} is VALID [2022-02-21 04:21:21,092 INFO L290 TraceCheckUtils]: 32: Hoare triple {3497#false} assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; {3497#false} is VALID [2022-02-21 04:21:21,092 INFO L290 TraceCheckUtils]: 33: Hoare triple {3497#false} exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; {3497#false} is VALID [2022-02-21 04:21:21,092 INFO L290 TraceCheckUtils]: 34: Hoare triple {3497#false} stop_simulation_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret7#1;havoc stop_simulation_#t~ret7#1; {3497#false} is VALID [2022-02-21 04:21:21,093 INFO L290 TraceCheckUtils]: 35: Hoare triple {3497#false} assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; {3497#false} is VALID [2022-02-21 04:21:21,093 INFO L290 TraceCheckUtils]: 36: Hoare triple {3497#false} stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; {3497#false} is VALID [2022-02-21 04:21:21,093 INFO L290 TraceCheckUtils]: 37: Hoare triple {3497#false} start_simulation_#t~ret8#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret8#1;havoc start_simulation_#t~ret8#1; {3497#false} is VALID [2022-02-21 04:21:21,093 INFO L290 TraceCheckUtils]: 38: Hoare triple {3497#false} assume !(0 != start_simulation_~tmp~3#1); {3497#false} is VALID [2022-02-21 04:21:21,093 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:21:21,093 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:21,093 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902914247] [2022-02-21 04:21:21,094 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902914247] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:21,094 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:21,094 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:21:21,094 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048708141] [2022-02-21 04:21:21,094 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:21,094 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:21:21,095 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:21:21,095 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:21:21,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:21:21,095 INFO L87 Difference]: Start difference. First operand 117 states and 177 transitions. cyclomatic complexity: 61 Second operand has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:21,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:21,368 INFO L93 Difference]: Finished difference Result 151 states and 225 transitions. [2022-02-21 04:21:21,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 04:21:21,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 7.8) internal successors, (39), 5 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:21,394 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:21:21,395 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 151 states and 225 transitions. [2022-02-21 04:21:21,397 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 105 [2022-02-21 04:21:21,399 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 151 states to 151 states and 225 transitions. [2022-02-21 04:21:21,399 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 151 [2022-02-21 04:21:21,399 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 151 [2022-02-21 04:21:21,399 INFO L73 IsDeterministic]: Start isDeterministic. Operand 151 states and 225 transitions. [2022-02-21 04:21:21,400 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:21:21,400 INFO L681 BuchiCegarLoop]: Abstraction has 151 states and 225 transitions. [2022-02-21 04:21:21,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151 states and 225 transitions. [2022-02-21 04:21:21,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151 to 120. [2022-02-21 04:21:21,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:21:21,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 151 states and 225 transitions. Second operand has 120 states, 120 states have (on average 1.5) internal successors, (180), 119 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:21,402 INFO L74 IsIncluded]: Start isIncluded. First operand 151 states and 225 transitions. Second operand has 120 states, 120 states have (on average 1.5) internal successors, (180), 119 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:21,402 INFO L87 Difference]: Start difference. First operand 151 states and 225 transitions. Second operand has 120 states, 120 states have (on average 1.5) internal successors, (180), 119 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:21,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:21,404 INFO L93 Difference]: Finished difference Result 151 states and 225 transitions. [2022-02-21 04:21:21,404 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 225 transitions. [2022-02-21 04:21:21,404 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:21,404 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:21,404 INFO L74 IsIncluded]: Start isIncluded. First operand has 120 states, 120 states have (on average 1.5) internal successors, (180), 119 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 151 states and 225 transitions. [2022-02-21 04:21:21,405 INFO L87 Difference]: Start difference. First operand has 120 states, 120 states have (on average 1.5) internal successors, (180), 119 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 151 states and 225 transitions. [2022-02-21 04:21:21,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:21,406 INFO L93 Difference]: Finished difference Result 151 states and 225 transitions. [2022-02-21 04:21:21,406 INFO L276 IsEmpty]: Start isEmpty. Operand 151 states and 225 transitions. [2022-02-21 04:21:21,407 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:21,407 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:21,407 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:21:21,407 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:21:21,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 120 states have (on average 1.5) internal successors, (180), 119 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:21,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 180 transitions. [2022-02-21 04:21:21,409 INFO L704 BuchiCegarLoop]: Abstraction has 120 states and 180 transitions. [2022-02-21 04:21:21,409 INFO L587 BuchiCegarLoop]: Abstraction has 120 states and 180 transitions. [2022-02-21 04:21:21,409 INFO L425 BuchiCegarLoop]: ======== Iteration 9============ [2022-02-21 04:21:21,409 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 180 transitions. [2022-02-21 04:21:21,409 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 74 [2022-02-21 04:21:21,410 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:21:21,410 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:21:21,410 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:21,410 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:21,410 INFO L791 eck$LassoCheckResult]: Stem: 3775#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(16, 2);call #Ultimate.allocInit(12, 3);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 3723#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~2#1;havoc main_~__retres1~2#1;assume { :begin_inline_init_model } true;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 3684#L490 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret8#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 3685#L212 assume 1 == ~b0_req_up~0;assume { :begin_inline_update_b0 } true; 3748#L137 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 3749#L137-2 ~b0_req_up~0 := 0; 3742#L145 assume { :end_inline_update_b0 } true; 3743#L212-2 assume 1 == ~b1_req_up~0;assume { :begin_inline_update_b1 } true; 3704#L152 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 3705#L152-2 ~b1_req_up~0 := 0; 3767#L160 assume { :end_inline_update_b1 } true; 3766#L219-1 assume 1 == ~d0_req_up~0;assume { :begin_inline_update_d0 } true; 3687#L167 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 3688#L167-2 ~d0_req_up~0 := 0; 3665#L175 assume { :end_inline_update_d0 } true; 3666#L226-1 assume 1 == ~d1_req_up~0;assume { :begin_inline_update_d1 } true; 3725#L182 assume !(~d1_val~0 != ~d1_val_t~0); 3692#L182-2 ~d1_req_up~0 := 0; 3693#L190 assume { :end_inline_update_d1 } true; 3747#L233-1 assume !(1 == ~z_req_up~0); 3753#L240-1 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 3682#L255 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 3683#L255-2 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 3754#L321 assume !(0 == ~b0_ev~0); 3755#L321-2 assume !(0 == ~b1_ev~0); 3700#L326-1 assume !(0 == ~d0_ev~0); 3701#L331-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 3671#L336-1 assume !(0 == ~z_ev~0); 3672#L341-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; 3777#L107 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; 3690#L129 is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; 3739#L130 activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; 3740#L390 assume !(0 != activate_threads_~tmp~1#1); 3768#L390-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 3736#L354 assume !(1 == ~b0_ev~0); 3719#L354-2 assume !(1 == ~b1_ev~0); 3720#L359-1 assume !(1 == ~d0_ev~0); 3721#L364-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 3722#L369-1 assume !(1 == ~z_ev~0); 3726#L374-1 assume { :end_inline_reset_delta_events } true; 3710#L432-2 [2022-02-21 04:21:21,411 INFO L793 eck$LassoCheckResult]: Loop: 3710#L432-2 assume !false; 3711#L433 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1; 3667#L295 assume !false; 3668#L286 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; 3694#L268 assume !(0 == ~comp_m1_st~0);exists_runnable_thread_~__retres1~1#1 := 0; 3696#L275 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; 3779#L276 eval_#t~ret4#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___0~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; 3778#L290 assume !(0 != eval_~tmp___0~0#1); 3727#L311 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; 3728#L212-3 assume !(1 == ~b0_req_up~0); 3757#L212-5 assume !(1 == ~b1_req_up~0); 3713#L219-3 assume !(1 == ~d0_req_up~0); 3660#L226-3 assume !(1 == ~d1_req_up~0); 3661#L233-3 assume !(1 == ~z_req_up~0); 3680#L240-3 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; 3681#L321-3 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 3750#L321-5 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 3751#L326-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 3732#L331-3 assume !(0 == ~d1_ev~0); 3676#L336-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 3677#L341-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; 3686#L107-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; 3703#L129-1 is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; 3724#L130-1 activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; 3669#L390-3 assume 0 != activate_threads_~tmp~1#1;~comp_m1_st~0 := 0; 3670#L390-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 3697#L354-3 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 3707#L354-5 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 3770#L359-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 3765#L364-3 assume !(1 == ~d1_ev~0); 3764#L369-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 3729#L374-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret7#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; 3730#L268-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; 3758#L275-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; 3718#L276-1 stop_simulation_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret7#1;havoc stop_simulation_#t~ret7#1; 3678#L407 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 3679#L414 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 3772#L415 start_simulation_#t~ret8#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret8#1;havoc start_simulation_#t~ret8#1; 3759#L449 assume !(0 != start_simulation_~tmp~3#1); 3710#L432-2 [2022-02-21 04:21:21,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:21,411 INFO L85 PathProgramCache]: Analyzing trace with hash -525437980, now seen corresponding path program 2 times [2022-02-21 04:21:21,411 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:21,411 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1557208992] [2022-02-21 04:21:21,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:21,412 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:21,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:21,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {4085#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(16, 2);call #Ultimate.allocInit(12, 3);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; {4085#true} is VALID [2022-02-21 04:21:21,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {4085#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~2#1;havoc main_~__retres1~2#1;assume { :begin_inline_init_model } true;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; {4087#(and (= ~b0_val~0 ~d1_val~0) (= ~d1_val_t~0 ~b0_val_t~0))} is VALID [2022-02-21 04:21:21,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {4087#(and (= ~b0_val~0 ~d1_val~0) (= ~d1_val_t~0 ~b0_val_t~0))} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret8#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; {4087#(and (= ~b0_val~0 ~d1_val~0) (= ~d1_val_t~0 ~b0_val_t~0))} is VALID [2022-02-21 04:21:21,435 INFO L290 TraceCheckUtils]: 3: Hoare triple {4087#(and (= ~b0_val~0 ~d1_val~0) (= ~d1_val_t~0 ~b0_val_t~0))} assume 1 == ~b0_req_up~0;assume { :begin_inline_update_b0 } true; {4087#(and (= ~b0_val~0 ~d1_val~0) (= ~d1_val_t~0 ~b0_val_t~0))} is VALID [2022-02-21 04:21:21,435 INFO L290 TraceCheckUtils]: 4: Hoare triple {4087#(and (= ~b0_val~0 ~d1_val~0) (= ~d1_val_t~0 ~b0_val_t~0))} assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; {4088#(not (= ~d1_val_t~0 ~d1_val~0))} is VALID [2022-02-21 04:21:21,435 INFO L290 TraceCheckUtils]: 5: Hoare triple {4088#(not (= ~d1_val_t~0 ~d1_val~0))} ~b0_req_up~0 := 0; {4088#(not (= ~d1_val_t~0 ~d1_val~0))} is VALID [2022-02-21 04:21:21,436 INFO L290 TraceCheckUtils]: 6: Hoare triple {4088#(not (= ~d1_val_t~0 ~d1_val~0))} assume { :end_inline_update_b0 } true; {4088#(not (= ~d1_val_t~0 ~d1_val~0))} is VALID [2022-02-21 04:21:21,436 INFO L290 TraceCheckUtils]: 7: Hoare triple {4088#(not (= ~d1_val_t~0 ~d1_val~0))} assume 1 == ~b1_req_up~0;assume { :begin_inline_update_b1 } true; {4088#(not (= ~d1_val_t~0 ~d1_val~0))} is VALID [2022-02-21 04:21:21,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {4088#(not (= ~d1_val_t~0 ~d1_val~0))} assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; {4088#(not (= ~d1_val_t~0 ~d1_val~0))} is VALID [2022-02-21 04:21:21,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {4088#(not (= ~d1_val_t~0 ~d1_val~0))} ~b1_req_up~0 := 0; {4088#(not (= ~d1_val_t~0 ~d1_val~0))} is VALID [2022-02-21 04:21:21,437 INFO L290 TraceCheckUtils]: 10: Hoare triple {4088#(not (= ~d1_val_t~0 ~d1_val~0))} assume { :end_inline_update_b1 } true; {4088#(not (= ~d1_val_t~0 ~d1_val~0))} is VALID [2022-02-21 04:21:21,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {4088#(not (= ~d1_val_t~0 ~d1_val~0))} assume 1 == ~d0_req_up~0;assume { :begin_inline_update_d0 } true; {4088#(not (= ~d1_val_t~0 ~d1_val~0))} is VALID [2022-02-21 04:21:21,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {4088#(not (= ~d1_val_t~0 ~d1_val~0))} assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; {4088#(not (= ~d1_val_t~0 ~d1_val~0))} is VALID [2022-02-21 04:21:21,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {4088#(not (= ~d1_val_t~0 ~d1_val~0))} ~d0_req_up~0 := 0; {4088#(not (= ~d1_val_t~0 ~d1_val~0))} is VALID [2022-02-21 04:21:21,438 INFO L290 TraceCheckUtils]: 14: Hoare triple {4088#(not (= ~d1_val_t~0 ~d1_val~0))} assume { :end_inline_update_d0 } true; {4088#(not (= ~d1_val_t~0 ~d1_val~0))} is VALID [2022-02-21 04:21:21,443 INFO L290 TraceCheckUtils]: 15: Hoare triple {4088#(not (= ~d1_val_t~0 ~d1_val~0))} assume 1 == ~d1_req_up~0;assume { :begin_inline_update_d1 } true; {4088#(not (= ~d1_val_t~0 ~d1_val~0))} is VALID [2022-02-21 04:21:21,443 INFO L290 TraceCheckUtils]: 16: Hoare triple {4088#(not (= ~d1_val_t~0 ~d1_val~0))} assume !(~d1_val~0 != ~d1_val_t~0); {4086#false} is VALID [2022-02-21 04:21:21,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {4086#false} ~d1_req_up~0 := 0; {4086#false} is VALID [2022-02-21 04:21:21,444 INFO L290 TraceCheckUtils]: 18: Hoare triple {4086#false} assume { :end_inline_update_d1 } true; {4086#false} is VALID [2022-02-21 04:21:21,444 INFO L290 TraceCheckUtils]: 19: Hoare triple {4086#false} assume !(1 == ~z_req_up~0); {4086#false} is VALID [2022-02-21 04:21:21,444 INFO L290 TraceCheckUtils]: 20: Hoare triple {4086#false} assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; {4086#false} is VALID [2022-02-21 04:21:21,444 INFO L290 TraceCheckUtils]: 21: Hoare triple {4086#false} assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; {4086#false} is VALID [2022-02-21 04:21:21,444 INFO L290 TraceCheckUtils]: 22: Hoare triple {4086#false} assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; {4086#false} is VALID [2022-02-21 04:21:21,444 INFO L290 TraceCheckUtils]: 23: Hoare triple {4086#false} assume !(0 == ~b0_ev~0); {4086#false} is VALID [2022-02-21 04:21:21,444 INFO L290 TraceCheckUtils]: 24: Hoare triple {4086#false} assume !(0 == ~b1_ev~0); {4086#false} is VALID [2022-02-21 04:21:21,444 INFO L290 TraceCheckUtils]: 25: Hoare triple {4086#false} assume !(0 == ~d0_ev~0); {4086#false} is VALID [2022-02-21 04:21:21,445 INFO L290 TraceCheckUtils]: 26: Hoare triple {4086#false} assume 0 == ~d1_ev~0;~d1_ev~0 := 1; {4086#false} is VALID [2022-02-21 04:21:21,445 INFO L290 TraceCheckUtils]: 27: Hoare triple {4086#false} assume !(0 == ~z_ev~0); {4086#false} is VALID [2022-02-21 04:21:21,445 INFO L290 TraceCheckUtils]: 28: Hoare triple {4086#false} assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; {4086#false} is VALID [2022-02-21 04:21:21,445 INFO L290 TraceCheckUtils]: 29: Hoare triple {4086#false} assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; {4086#false} is VALID [2022-02-21 04:21:21,445 INFO L290 TraceCheckUtils]: 30: Hoare triple {4086#false} is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; {4086#false} is VALID [2022-02-21 04:21:21,445 INFO L290 TraceCheckUtils]: 31: Hoare triple {4086#false} activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; {4086#false} is VALID [2022-02-21 04:21:21,445 INFO L290 TraceCheckUtils]: 32: Hoare triple {4086#false} assume !(0 != activate_threads_~tmp~1#1); {4086#false} is VALID [2022-02-21 04:21:21,445 INFO L290 TraceCheckUtils]: 33: Hoare triple {4086#false} assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; {4086#false} is VALID [2022-02-21 04:21:21,446 INFO L290 TraceCheckUtils]: 34: Hoare triple {4086#false} assume !(1 == ~b0_ev~0); {4086#false} is VALID [2022-02-21 04:21:21,446 INFO L290 TraceCheckUtils]: 35: Hoare triple {4086#false} assume !(1 == ~b1_ev~0); {4086#false} is VALID [2022-02-21 04:21:21,446 INFO L290 TraceCheckUtils]: 36: Hoare triple {4086#false} assume !(1 == ~d0_ev~0); {4086#false} is VALID [2022-02-21 04:21:21,446 INFO L290 TraceCheckUtils]: 37: Hoare triple {4086#false} assume 1 == ~d1_ev~0;~d1_ev~0 := 2; {4086#false} is VALID [2022-02-21 04:21:21,446 INFO L290 TraceCheckUtils]: 38: Hoare triple {4086#false} assume !(1 == ~z_ev~0); {4086#false} is VALID [2022-02-21 04:21:21,446 INFO L290 TraceCheckUtils]: 39: Hoare triple {4086#false} assume { :end_inline_reset_delta_events } true; {4086#false} is VALID [2022-02-21 04:21:21,446 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:21:21,447 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:21,447 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1557208992] [2022-02-21 04:21:21,447 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1557208992] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:21,447 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:21,447 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 04:21:21,447 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620738513] [2022-02-21 04:21:21,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:21,448 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:21:21,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:21,448 INFO L85 PathProgramCache]: Analyzing trace with hash 356628037, now seen corresponding path program 1 times [2022-02-21 04:21:21,448 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:21,448 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [597558668] [2022-02-21 04:21:21,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:21,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:21,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:21:21,455 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:21:21,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:21:21,482 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:21:21,801 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:21:21,801 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:21:21,801 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:21:21,802 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:21:21,802 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:21:21,802 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:21:21,802 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:21:21,802 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:21:21,802 INFO L133 ssoRankerPreferences]: Filename of dumped script: bist_cell.cil.c_Iteration9_Loop [2022-02-21 04:21:21,802 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:21:21,802 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:21:21,814 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:21:21,820 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:21:21,823 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:21:21,826 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:21:21,829 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:21:21,833 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:21:21,834 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:21:21,836 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:21:21,837 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:21:21,839 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:21:21,840 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:21:21,842 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:21:21,844 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:21:21,846 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:21:21,848 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:21:21,851 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:21:21,853 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:21:21,854 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:21:21,855 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:21:21,858 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:21:21,859 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:21:21,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:21:21,865 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:21:22,127 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:21:22,128 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:21:22,129 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:21:22,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:21:22,131 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:21:22,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 04:21:22,134 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:21:22,135 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:21:22,157 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:21:22,157 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_start_simulation_~kernel_st~0#1=3} Honda state: {ULTIMATE.start_start_simulation_~kernel_st~0#1=3} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:21:22,177 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 04:21:22,178 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:21:22,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:21:22,179 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:21:22,180 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:21:22,181 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:21:22,181 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:21:22,212 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:21:22,212 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~d1_ev~0=-7} Honda state: {~d1_ev~0=-7} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:21:22,256 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:21:22,256 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:21:22,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:21:22,260 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:21:22,271 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:21:22,272 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:21:22,275 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:21:22,308 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:21:22,309 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:21:22,309 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:21:22,310 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:21:22,310 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:21:22,312 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:21:22,312 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:21:22,323 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:21:22,339 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:21:22,339 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:21:22,339 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:21:22,339 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:21:22,339 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:21:22,340 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:21:22,340 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:21:22,340 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:21:22,340 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:21:22,340 INFO L133 ssoRankerPreferences]: Filename of dumped script: bist_cell.cil.c_Iteration9_Loop [2022-02-21 04:21:22,340 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:21:22,340 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:21:22,341 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:21:22,348 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:21:22,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:21:22,354 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:21:22,356 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:21:22,358 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:21:22,359 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:21:22,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:21:22,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:21:22,366 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:21:22,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:21:22,371 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:21:22,374 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:21:22,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:21:22,378 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:21:22,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:21:22,381 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:21:22,384 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:21:22,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:21:22,387 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:21:22,392 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:21:22,410 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:21:22,414 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:21:22,688 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:21:22,691 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:21:22,692 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:21:22,692 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:21:22,696 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:21:22,751 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:21:22,752 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:21:22,776 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:21:22,776 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:21:22,777 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:21:22,777 INFO L204 nArgumentSynthesizer]: 2 loop disjuncts [2022-02-21 04:21:22,777 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:21:22,779 INFO L401 nArgumentSynthesizer]: We have 4 Motzkin's Theorem applications. [2022-02-21 04:21:22,779 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:21:22,800 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:21:22,821 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:21:22,822 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:21:22,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:21:22,823 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:21:22,825 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:21:22,827 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:21:22,833 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:21:22,833 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:21:22,833 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:21:22,833 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:21:22,833 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:21:22,834 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:21:22,834 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:21:22,849 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:21:22,852 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:21:22,852 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:21:22,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:21:22,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:21:22,855 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:21:22,858 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:21:22,859 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:21:22,859 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:21:22,859 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:21:22,860 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~b0_ev~0) = -1*~b0_ev~0 + 1 Supporting invariants [] [2022-02-21 04:21:22,878 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:21:22,884 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:21:22,889 INFO L390 LassoCheck]: Loop: "assume !false;" "start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;" "assume !false;" "assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1;" "assume !(0 == ~comp_m1_st~0);exists_runnable_thread_~__retres1~1#1 := 0;" "exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1;" "eval_#t~ret4#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___0~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1;" "assume !(0 != eval_~tmp___0~0#1);" "assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true;" "assume !(1 == ~b0_req_up~0);" "assume !(1 == ~b1_req_up~0);" "assume !(1 == ~d0_req_up~0);" "assume !(1 == ~d1_req_up~0);" "assume !(1 == ~z_req_up~0);" "assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true;" "assume 0 == ~b0_ev~0;~b0_ev~0 := 1;" "assume 0 == ~b1_ev~0;~b1_ev~0 := 1;" "assume 0 == ~d0_ev~0;~d0_ev~0 := 1;" "assume !(0 == ~d1_ev~0);" "assume 0 == ~z_ev~0;~z_ev~0 := 1;" "assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1;" "assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1;" "is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1;" "activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1;" "assume 0 != activate_threads_~tmp~1#1;~comp_m1_st~0 := 0;" "assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true;" "assume 1 == ~b0_ev~0;~b0_ev~0 := 2;" "assume 1 == ~b1_ev~0;~b1_ev~0 := 2;" "assume 1 == ~d0_ev~0;~d0_ev~0 := 2;" "assume !(1 == ~d1_ev~0);" "assume 1 == ~z_ev~0;~z_ev~0 := 2;" "assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret7#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1;" "assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1;" "exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1;" "stop_simulation_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret7#1;havoc stop_simulation_#t~ret7#1;" "assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0;" "stop_simulation_#res#1 := stop_simulation_~__retres2~0#1;" "start_simulation_#t~ret8#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret8#1;havoc start_simulation_#t~ret8#1;" "assume !(0 != start_simulation_~tmp~3#1);" [2022-02-21 04:21:22,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:22,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:22,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:22,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:21:22,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:22,952 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:21:23,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {4091#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(16, 2);call #Ultimate.allocInit(12, 3);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; {4091#unseeded} is VALID [2022-02-21 04:21:23,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {4091#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~2#1;havoc main_~__retres1~2#1;assume { :begin_inline_init_model } true;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; {4091#unseeded} is VALID [2022-02-21 04:21:23,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {4091#unseeded} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret8#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; {4091#unseeded} is VALID [2022-02-21 04:21:23,011 INFO L290 TraceCheckUtils]: 3: Hoare triple {4091#unseeded} assume 1 == ~b0_req_up~0;assume { :begin_inline_update_b0 } true; {4091#unseeded} is VALID [2022-02-21 04:21:23,012 INFO L290 TraceCheckUtils]: 4: Hoare triple {4091#unseeded} assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; {4091#unseeded} is VALID [2022-02-21 04:21:23,012 INFO L290 TraceCheckUtils]: 5: Hoare triple {4091#unseeded} ~b0_req_up~0 := 0; {4091#unseeded} is VALID [2022-02-21 04:21:23,012 INFO L290 TraceCheckUtils]: 6: Hoare triple {4091#unseeded} assume { :end_inline_update_b0 } true; {4091#unseeded} is VALID [2022-02-21 04:21:23,013 INFO L290 TraceCheckUtils]: 7: Hoare triple {4091#unseeded} assume 1 == ~b1_req_up~0;assume { :begin_inline_update_b1 } true; {4091#unseeded} is VALID [2022-02-21 04:21:23,013 INFO L290 TraceCheckUtils]: 8: Hoare triple {4091#unseeded} assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; {4091#unseeded} is VALID [2022-02-21 04:21:23,013 INFO L290 TraceCheckUtils]: 9: Hoare triple {4091#unseeded} ~b1_req_up~0 := 0; {4091#unseeded} is VALID [2022-02-21 04:21:23,014 INFO L290 TraceCheckUtils]: 10: Hoare triple {4091#unseeded} assume { :end_inline_update_b1 } true; {4091#unseeded} is VALID [2022-02-21 04:21:23,014 INFO L290 TraceCheckUtils]: 11: Hoare triple {4091#unseeded} assume 1 == ~d0_req_up~0;assume { :begin_inline_update_d0 } true; {4091#unseeded} is VALID [2022-02-21 04:21:23,014 INFO L290 TraceCheckUtils]: 12: Hoare triple {4091#unseeded} assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; {4091#unseeded} is VALID [2022-02-21 04:21:23,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {4091#unseeded} ~d0_req_up~0 := 0; {4091#unseeded} is VALID [2022-02-21 04:21:23,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {4091#unseeded} assume { :end_inline_update_d0 } true; {4091#unseeded} is VALID [2022-02-21 04:21:23,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {4091#unseeded} assume 1 == ~d1_req_up~0;assume { :begin_inline_update_d1 } true; {4091#unseeded} is VALID [2022-02-21 04:21:23,029 INFO L290 TraceCheckUtils]: 16: Hoare triple {4091#unseeded} assume !(~d1_val~0 != ~d1_val_t~0); {4091#unseeded} is VALID [2022-02-21 04:21:23,029 INFO L290 TraceCheckUtils]: 17: Hoare triple {4091#unseeded} ~d1_req_up~0 := 0; {4091#unseeded} is VALID [2022-02-21 04:21:23,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {4091#unseeded} assume { :end_inline_update_d1 } true; {4091#unseeded} is VALID [2022-02-21 04:21:23,033 INFO L290 TraceCheckUtils]: 19: Hoare triple {4091#unseeded} assume !(1 == ~z_req_up~0); {4091#unseeded} is VALID [2022-02-21 04:21:23,033 INFO L290 TraceCheckUtils]: 20: Hoare triple {4091#unseeded} assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; {4091#unseeded} is VALID [2022-02-21 04:21:23,034 INFO L290 TraceCheckUtils]: 21: Hoare triple {4091#unseeded} assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; {4091#unseeded} is VALID [2022-02-21 04:21:23,034 INFO L290 TraceCheckUtils]: 22: Hoare triple {4091#unseeded} assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; {4091#unseeded} is VALID [2022-02-21 04:21:23,039 INFO L290 TraceCheckUtils]: 23: Hoare triple {4091#unseeded} assume !(0 == ~b0_ev~0); {4091#unseeded} is VALID [2022-02-21 04:21:23,039 INFO L290 TraceCheckUtils]: 24: Hoare triple {4091#unseeded} assume !(0 == ~b1_ev~0); {4091#unseeded} is VALID [2022-02-21 04:21:23,040 INFO L290 TraceCheckUtils]: 25: Hoare triple {4091#unseeded} assume !(0 == ~d0_ev~0); {4091#unseeded} is VALID [2022-02-21 04:21:23,040 INFO L290 TraceCheckUtils]: 26: Hoare triple {4091#unseeded} assume 0 == ~d1_ev~0;~d1_ev~0 := 1; {4091#unseeded} is VALID [2022-02-21 04:21:23,040 INFO L290 TraceCheckUtils]: 27: Hoare triple {4091#unseeded} assume !(0 == ~z_ev~0); {4091#unseeded} is VALID [2022-02-21 04:21:23,041 INFO L290 TraceCheckUtils]: 28: Hoare triple {4091#unseeded} assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; {4091#unseeded} is VALID [2022-02-21 04:21:23,041 INFO L290 TraceCheckUtils]: 29: Hoare triple {4091#unseeded} assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; {4091#unseeded} is VALID [2022-02-21 04:21:23,041 INFO L290 TraceCheckUtils]: 30: Hoare triple {4091#unseeded} is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; {4091#unseeded} is VALID [2022-02-21 04:21:23,042 INFO L290 TraceCheckUtils]: 31: Hoare triple {4091#unseeded} activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; {4091#unseeded} is VALID [2022-02-21 04:21:23,042 INFO L290 TraceCheckUtils]: 32: Hoare triple {4091#unseeded} assume !(0 != activate_threads_~tmp~1#1); {4091#unseeded} is VALID [2022-02-21 04:21:23,042 INFO L290 TraceCheckUtils]: 33: Hoare triple {4091#unseeded} assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; {4091#unseeded} is VALID [2022-02-21 04:21:23,042 INFO L290 TraceCheckUtils]: 34: Hoare triple {4091#unseeded} assume !(1 == ~b0_ev~0); {4091#unseeded} is VALID [2022-02-21 04:21:23,043 INFO L290 TraceCheckUtils]: 35: Hoare triple {4091#unseeded} assume !(1 == ~b1_ev~0); {4091#unseeded} is VALID [2022-02-21 04:21:23,043 INFO L290 TraceCheckUtils]: 36: Hoare triple {4091#unseeded} assume !(1 == ~d0_ev~0); {4091#unseeded} is VALID [2022-02-21 04:21:23,043 INFO L290 TraceCheckUtils]: 37: Hoare triple {4091#unseeded} assume 1 == ~d1_ev~0;~d1_ev~0 := 2; {4091#unseeded} is VALID [2022-02-21 04:21:23,043 INFO L290 TraceCheckUtils]: 38: Hoare triple {4091#unseeded} assume !(1 == ~z_ev~0); {4091#unseeded} is VALID [2022-02-21 04:21:23,044 INFO L290 TraceCheckUtils]: 39: Hoare triple {4091#unseeded} assume { :end_inline_reset_delta_events } true; {4091#unseeded} is VALID [2022-02-21 04:21:23,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:23,059 INFO L263 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:21:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:23,085 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:21:23,237 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:21:23,341 INFO L290 TraceCheckUtils]: 0: Hoare triple {4094#(>= oldRank0 (+ (* (- 1) ~b0_ev~0) 1))} assume !false; {4094#(>= oldRank0 (+ (* (- 1) ~b0_ev~0) 1))} is VALID [2022-02-21 04:21:23,342 INFO L290 TraceCheckUtils]: 1: Hoare triple {4094#(>= oldRank0 (+ (* (- 1) ~b0_ev~0) 1))} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1; {4094#(>= oldRank0 (+ (* (- 1) ~b0_ev~0) 1))} is VALID [2022-02-21 04:21:23,342 INFO L290 TraceCheckUtils]: 2: Hoare triple {4094#(>= oldRank0 (+ (* (- 1) ~b0_ev~0) 1))} assume !false; {4094#(>= oldRank0 (+ (* (- 1) ~b0_ev~0) 1))} is VALID [2022-02-21 04:21:23,342 INFO L290 TraceCheckUtils]: 3: Hoare triple {4094#(>= oldRank0 (+ (* (- 1) ~b0_ev~0) 1))} assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; {4094#(>= oldRank0 (+ (* (- 1) ~b0_ev~0) 1))} is VALID [2022-02-21 04:21:23,343 INFO L290 TraceCheckUtils]: 4: Hoare triple {4094#(>= oldRank0 (+ (* (- 1) ~b0_ev~0) 1))} assume !(0 == ~comp_m1_st~0);exists_runnable_thread_~__retres1~1#1 := 0; {4094#(>= oldRank0 (+ (* (- 1) ~b0_ev~0) 1))} is VALID [2022-02-21 04:21:23,343 INFO L290 TraceCheckUtils]: 5: Hoare triple {4094#(>= oldRank0 (+ (* (- 1) ~b0_ev~0) 1))} exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; {4094#(>= oldRank0 (+ (* (- 1) ~b0_ev~0) 1))} is VALID [2022-02-21 04:21:23,343 INFO L290 TraceCheckUtils]: 6: Hoare triple {4094#(>= oldRank0 (+ (* (- 1) ~b0_ev~0) 1))} eval_#t~ret4#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___0~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; {4094#(>= oldRank0 (+ (* (- 1) ~b0_ev~0) 1))} is VALID [2022-02-21 04:21:23,344 INFO L290 TraceCheckUtils]: 7: Hoare triple {4094#(>= oldRank0 (+ (* (- 1) ~b0_ev~0) 1))} assume !(0 != eval_~tmp___0~0#1); {4094#(>= oldRank0 (+ (* (- 1) ~b0_ev~0) 1))} is VALID [2022-02-21 04:21:23,344 INFO L290 TraceCheckUtils]: 8: Hoare triple {4094#(>= oldRank0 (+ (* (- 1) ~b0_ev~0) 1))} assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; {4094#(>= oldRank0 (+ (* (- 1) ~b0_ev~0) 1))} is VALID [2022-02-21 04:21:23,345 INFO L290 TraceCheckUtils]: 9: Hoare triple {4094#(>= oldRank0 (+ (* (- 1) ~b0_ev~0) 1))} assume !(1 == ~b0_req_up~0); {4094#(>= oldRank0 (+ (* (- 1) ~b0_ev~0) 1))} is VALID [2022-02-21 04:21:23,345 INFO L290 TraceCheckUtils]: 10: Hoare triple {4094#(>= oldRank0 (+ (* (- 1) ~b0_ev~0) 1))} assume !(1 == ~b1_req_up~0); {4094#(>= oldRank0 (+ (* (- 1) ~b0_ev~0) 1))} is VALID [2022-02-21 04:21:23,345 INFO L290 TraceCheckUtils]: 11: Hoare triple {4094#(>= oldRank0 (+ (* (- 1) ~b0_ev~0) 1))} assume !(1 == ~d0_req_up~0); {4094#(>= oldRank0 (+ (* (- 1) ~b0_ev~0) 1))} is VALID [2022-02-21 04:21:23,346 INFO L290 TraceCheckUtils]: 12: Hoare triple {4094#(>= oldRank0 (+ (* (- 1) ~b0_ev~0) 1))} assume !(1 == ~d1_req_up~0); {4094#(>= oldRank0 (+ (* (- 1) ~b0_ev~0) 1))} is VALID [2022-02-21 04:21:23,346 INFO L290 TraceCheckUtils]: 13: Hoare triple {4094#(>= oldRank0 (+ (* (- 1) ~b0_ev~0) 1))} assume !(1 == ~z_req_up~0); {4094#(>= oldRank0 (+ (* (- 1) ~b0_ev~0) 1))} is VALID [2022-02-21 04:21:23,346 INFO L290 TraceCheckUtils]: 14: Hoare triple {4094#(>= oldRank0 (+ (* (- 1) ~b0_ev~0) 1))} assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; {4094#(>= oldRank0 (+ (* (- 1) ~b0_ev~0) 1))} is VALID [2022-02-21 04:21:23,347 INFO L290 TraceCheckUtils]: 15: Hoare triple {4094#(>= oldRank0 (+ (* (- 1) ~b0_ev~0) 1))} assume 0 == ~b0_ev~0;~b0_ev~0 := 1; {4271#(<= 1 oldRank0)} is VALID [2022-02-21 04:21:23,347 INFO L290 TraceCheckUtils]: 16: Hoare triple {4271#(<= 1 oldRank0)} assume 0 == ~b1_ev~0;~b1_ev~0 := 1; {4271#(<= 1 oldRank0)} is VALID [2022-02-21 04:21:23,347 INFO L290 TraceCheckUtils]: 17: Hoare triple {4271#(<= 1 oldRank0)} assume 0 == ~d0_ev~0;~d0_ev~0 := 1; {4271#(<= 1 oldRank0)} is VALID [2022-02-21 04:21:23,348 INFO L290 TraceCheckUtils]: 18: Hoare triple {4271#(<= 1 oldRank0)} assume !(0 == ~d1_ev~0); {4271#(<= 1 oldRank0)} is VALID [2022-02-21 04:21:23,348 INFO L290 TraceCheckUtils]: 19: Hoare triple {4271#(<= 1 oldRank0)} assume 0 == ~z_ev~0;~z_ev~0 := 1; {4271#(<= 1 oldRank0)} is VALID [2022-02-21 04:21:23,348 INFO L290 TraceCheckUtils]: 20: Hoare triple {4271#(<= 1 oldRank0)} assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; {4271#(<= 1 oldRank0)} is VALID [2022-02-21 04:21:23,348 INFO L290 TraceCheckUtils]: 21: Hoare triple {4271#(<= 1 oldRank0)} assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; {4271#(<= 1 oldRank0)} is VALID [2022-02-21 04:21:23,349 INFO L290 TraceCheckUtils]: 22: Hoare triple {4271#(<= 1 oldRank0)} is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; {4271#(<= 1 oldRank0)} is VALID [2022-02-21 04:21:23,349 INFO L290 TraceCheckUtils]: 23: Hoare triple {4271#(<= 1 oldRank0)} activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; {4271#(<= 1 oldRank0)} is VALID [2022-02-21 04:21:23,349 INFO L290 TraceCheckUtils]: 24: Hoare triple {4271#(<= 1 oldRank0)} assume 0 != activate_threads_~tmp~1#1;~comp_m1_st~0 := 0; {4271#(<= 1 oldRank0)} is VALID [2022-02-21 04:21:23,350 INFO L290 TraceCheckUtils]: 25: Hoare triple {4271#(<= 1 oldRank0)} assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; {4271#(<= 1 oldRank0)} is VALID [2022-02-21 04:21:23,350 INFO L290 TraceCheckUtils]: 26: Hoare triple {4271#(<= 1 oldRank0)} assume 1 == ~b0_ev~0;~b0_ev~0 := 2; {4305#(and (<= 1 oldRank0) (<= 2 ~b0_ev~0))} is VALID [2022-02-21 04:21:23,350 INFO L290 TraceCheckUtils]: 27: Hoare triple {4305#(and (<= 1 oldRank0) (<= 2 ~b0_ev~0))} assume 1 == ~b1_ev~0;~b1_ev~0 := 2; {4305#(and (<= 1 oldRank0) (<= 2 ~b0_ev~0))} is VALID [2022-02-21 04:21:23,351 INFO L290 TraceCheckUtils]: 28: Hoare triple {4305#(and (<= 1 oldRank0) (<= 2 ~b0_ev~0))} assume 1 == ~d0_ev~0;~d0_ev~0 := 2; {4305#(and (<= 1 oldRank0) (<= 2 ~b0_ev~0))} is VALID [2022-02-21 04:21:23,351 INFO L290 TraceCheckUtils]: 29: Hoare triple {4305#(and (<= 1 oldRank0) (<= 2 ~b0_ev~0))} assume !(1 == ~d1_ev~0); {4305#(and (<= 1 oldRank0) (<= 2 ~b0_ev~0))} is VALID [2022-02-21 04:21:23,351 INFO L290 TraceCheckUtils]: 30: Hoare triple {4305#(and (<= 1 oldRank0) (<= 2 ~b0_ev~0))} assume 1 == ~z_ev~0;~z_ev~0 := 2; {4305#(and (<= 1 oldRank0) (<= 2 ~b0_ev~0))} is VALID [2022-02-21 04:21:23,352 INFO L290 TraceCheckUtils]: 31: Hoare triple {4305#(and (<= 1 oldRank0) (<= 2 ~b0_ev~0))} assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret7#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; {4305#(and (<= 1 oldRank0) (<= 2 ~b0_ev~0))} is VALID [2022-02-21 04:21:23,352 INFO L290 TraceCheckUtils]: 32: Hoare triple {4305#(and (<= 1 oldRank0) (<= 2 ~b0_ev~0))} assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; {4305#(and (<= 1 oldRank0) (<= 2 ~b0_ev~0))} is VALID [2022-02-21 04:21:23,353 INFO L290 TraceCheckUtils]: 33: Hoare triple {4305#(and (<= 1 oldRank0) (<= 2 ~b0_ev~0))} exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; {4305#(and (<= 1 oldRank0) (<= 2 ~b0_ev~0))} is VALID [2022-02-21 04:21:23,353 INFO L290 TraceCheckUtils]: 34: Hoare triple {4305#(and (<= 1 oldRank0) (<= 2 ~b0_ev~0))} stop_simulation_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret7#1;havoc stop_simulation_#t~ret7#1; {4305#(and (<= 1 oldRank0) (<= 2 ~b0_ev~0))} is VALID [2022-02-21 04:21:23,353 INFO L290 TraceCheckUtils]: 35: Hoare triple {4305#(and (<= 1 oldRank0) (<= 2 ~b0_ev~0))} assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; {4305#(and (<= 1 oldRank0) (<= 2 ~b0_ev~0))} is VALID [2022-02-21 04:21:23,354 INFO L290 TraceCheckUtils]: 36: Hoare triple {4305#(and (<= 1 oldRank0) (<= 2 ~b0_ev~0))} stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; {4305#(and (<= 1 oldRank0) (<= 2 ~b0_ev~0))} is VALID [2022-02-21 04:21:23,354 INFO L290 TraceCheckUtils]: 37: Hoare triple {4305#(and (<= 1 oldRank0) (<= 2 ~b0_ev~0))} start_simulation_#t~ret8#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret8#1;havoc start_simulation_#t~ret8#1; {4305#(and (<= 1 oldRank0) (<= 2 ~b0_ev~0))} is VALID [2022-02-21 04:21:23,355 INFO L290 TraceCheckUtils]: 38: Hoare triple {4305#(and (<= 1 oldRank0) (<= 2 ~b0_ev~0))} assume !(0 != start_simulation_~tmp~3#1); {4104#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ~b0_ev~0) 1))))} is VALID [2022-02-21 04:21:23,355 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:21:23,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:23,374 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:21:23,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 40 letters. Loop has 39 letters. [2022-02-21 04:21:23,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,378 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:21:23,379 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 120 states and 180 transitions. cyclomatic complexity: 61 Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:23,598 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 120 states and 180 transitions. cyclomatic complexity: 61. Second operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 274 states and 422 transitions. Complement of second has 5 states. [2022-02-21 04:21:23,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 04:21:23,599 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:21:23,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 120 states and 180 transitions. cyclomatic complexity: 61 [2022-02-21 04:21:23,599 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:21:23,599 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:21:23,599 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:23,602 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:21:23,602 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:21:23,602 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:21:23,602 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 274 states and 422 transitions. [2022-02-21 04:21:23,603 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 148 [2022-02-21 04:21:23,603 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:21:23,603 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:21:23,605 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 120 states and 180 transitions. cyclomatic complexity: 61 [2022-02-21 04:21:23,625 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 74 examples of accepted words. [2022-02-21 04:21:23,625 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:23,627 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:21:23,627 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:21:23,627 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 274 states and 422 transitions. cyclomatic complexity: 151 [2022-02-21 04:21:23,661 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 148 examples of accepted words. [2022-02-21 04:21:23,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 40 letters. Loop has 39 letters. [2022-02-21 04:21:23,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 40 letters. Loop has 39 letters. [2022-02-21 04:21:23,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 40 letters. Loop has 39 letters. [2022-02-21 04:21:23,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:21:23,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:21:23,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:21:23,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 42 letters. Loop has 7 letters. [2022-02-21 04:21:23,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 7 letters. [2022-02-21 04:21:23,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 42 letters. Loop has 7 letters. [2022-02-21 04:21:23,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 274 letters. Loop has 274 letters. [2022-02-21 04:21:23,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 274 letters. Loop has 274 letters. [2022-02-21 04:21:23,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 274 letters. Loop has 274 letters. [2022-02-21 04:21:23,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 120 letters. Loop has 120 letters. [2022-02-21 04:21:23,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 120 letters. Loop has 120 letters. [2022-02-21 04:21:23,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 120 letters. Loop has 120 letters. [2022-02-21 04:21:23,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:21:23,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:21:23,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:21:23,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 53 letters. Loop has 42 letters. [2022-02-21 04:21:23,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 42 letters. [2022-02-21 04:21:23,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 53 letters. Loop has 42 letters. [2022-02-21 04:21:23,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 51 letters. Loop has 39 letters. [2022-02-21 04:21:23,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 39 letters. [2022-02-21 04:21:23,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 51 letters. Loop has 39 letters. [2022-02-21 04:21:23,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 55 letters. Loop has 42 letters. [2022-02-21 04:21:23,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 42 letters. [2022-02-21 04:21:23,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 55 letters. Loop has 42 letters. [2022-02-21 04:21:23,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 42 letters. [2022-02-21 04:21:23,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 42 letters. [2022-02-21 04:21:23,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 54 letters. Loop has 42 letters. [2022-02-21 04:21:23,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:21:23,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:21:23,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:21:23,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 50 letters. Loop has 15 letters. [2022-02-21 04:21:23,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 15 letters. [2022-02-21 04:21:23,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 50 letters. Loop has 15 letters. [2022-02-21 04:21:23,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 74 letters. Loop has 39 letters. [2022-02-21 04:21:23,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 39 letters. [2022-02-21 04:21:23,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 74 letters. Loop has 39 letters. [2022-02-21 04:21:23,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 63 letters. Loop has 39 letters. [2022-02-21 04:21:23,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 39 letters. [2022-02-21 04:21:23,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 63 letters. Loop has 39 letters. [2022-02-21 04:21:23,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 39 letters. [2022-02-21 04:21:23,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 39 letters. [2022-02-21 04:21:23,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 48 letters. Loop has 39 letters. [2022-02-21 04:21:23,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 49 letters. Loop has 39 letters. [2022-02-21 04:21:23,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 49 letters. Loop has 39 letters. [2022-02-21 04:21:23,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 49 letters. Loop has 39 letters. [2022-02-21 04:21:23,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 71 letters. Loop has 39 letters. [2022-02-21 04:21:23,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 39 letters. [2022-02-21 04:21:23,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 71 letters. Loop has 39 letters. [2022-02-21 04:21:23,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 72 letters. Loop has 39 letters. [2022-02-21 04:21:23,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 39 letters. [2022-02-21 04:21:23,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 72 letters. Loop has 39 letters. [2022-02-21 04:21:23,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 56 letters. Loop has 42 letters. [2022-02-21 04:21:23,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 42 letters. [2022-02-21 04:21:23,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 56 letters. Loop has 42 letters. [2022-02-21 04:21:23,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 58 letters. Loop has 39 letters. [2022-02-21 04:21:23,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 39 letters. [2022-02-21 04:21:23,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 58 letters. Loop has 39 letters. [2022-02-21 04:21:23,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 55 letters. Loop has 42 letters. [2022-02-21 04:21:23,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 42 letters. [2022-02-21 04:21:23,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 55 letters. Loop has 42 letters. [2022-02-21 04:21:23,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 52 letters. Loop has 42 letters. [2022-02-21 04:21:23,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 42 letters. [2022-02-21 04:21:23,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 52 letters. Loop has 42 letters. [2022-02-21 04:21:23,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 56 letters. Loop has 15 letters. [2022-02-21 04:21:23,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 15 letters. [2022-02-21 04:21:23,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 56 letters. Loop has 15 letters. [2022-02-21 04:21:23,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 52 letters. Loop has 42 letters. [2022-02-21 04:21:23,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 42 letters. [2022-02-21 04:21:23,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 52 letters. Loop has 42 letters. [2022-02-21 04:21:23,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 53 letters. Loop has 42 letters. [2022-02-21 04:21:23,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 42 letters. [2022-02-21 04:21:23,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 53 letters. Loop has 42 letters. [2022-02-21 04:21:23,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 50 letters. Loop has 42 letters. [2022-02-21 04:21:23,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 42 letters. [2022-02-21 04:21:23,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 50 letters. Loop has 42 letters. [2022-02-21 04:21:23,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 51 letters. Loop has 42 letters. [2022-02-21 04:21:23,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 42 letters. [2022-02-21 04:21:23,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 51 letters. Loop has 42 letters. [2022-02-21 04:21:23,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 63 letters. Loop has 41 letters. [2022-02-21 04:21:23,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 41 letters. [2022-02-21 04:21:23,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 63 letters. Loop has 41 letters. [2022-02-21 04:21:23,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 56 letters. Loop has 39 letters. [2022-02-21 04:21:23,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 39 letters. [2022-02-21 04:21:23,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 56 letters. Loop has 39 letters. [2022-02-21 04:21:23,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 57 letters. Loop has 39 letters. [2022-02-21 04:21:23,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 39 letters. [2022-02-21 04:21:23,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 57 letters. Loop has 39 letters. [2022-02-21 04:21:23,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 52 letters. Loop has 42 letters. [2022-02-21 04:21:23,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 42 letters. [2022-02-21 04:21:23,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 52 letters. Loop has 42 letters. [2022-02-21 04:21:23,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 50 letters. Loop has 39 letters. [2022-02-21 04:21:23,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 39 letters. [2022-02-21 04:21:23,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 50 letters. Loop has 39 letters. [2022-02-21 04:21:23,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 73 letters. Loop has 39 letters. [2022-02-21 04:21:23,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 39 letters. [2022-02-21 04:21:23,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 73 letters. Loop has 39 letters. [2022-02-21 04:21:23,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 78 letters. Loop has 39 letters. [2022-02-21 04:21:23,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 78 letters. Loop has 39 letters. [2022-02-21 04:21:23,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 78 letters. Loop has 39 letters. [2022-02-21 04:21:23,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 52 letters. Loop has 15 letters. [2022-02-21 04:21:23,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 15 letters. [2022-02-21 04:21:23,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 52 letters. Loop has 15 letters. [2022-02-21 04:21:23,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 53 letters. Loop has 16 letters. [2022-02-21 04:21:23,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 16 letters. [2022-02-21 04:21:23,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 53 letters. Loop has 16 letters. [2022-02-21 04:21:23,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 39 letters. [2022-02-21 04:21:23,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 39 letters. [2022-02-21 04:21:23,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 70 letters. Loop has 39 letters. [2022-02-21 04:21:23,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 69 letters. Loop has 39 letters. [2022-02-21 04:21:23,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 39 letters. [2022-02-21 04:21:23,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 69 letters. Loop has 39 letters. [2022-02-21 04:21:23,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 52 letters. Loop has 16 letters. [2022-02-21 04:21:23,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 16 letters. [2022-02-21 04:21:23,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 52 letters. Loop has 16 letters. [2022-02-21 04:21:23,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 39 letters. [2022-02-21 04:21:23,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 39 letters. [2022-02-21 04:21:23,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 68 letters. Loop has 39 letters. [2022-02-21 04:21:23,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 51 letters. Loop has 42 letters. [2022-02-21 04:21:23,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 42 letters. [2022-02-21 04:21:23,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 51 letters. Loop has 42 letters. [2022-02-21 04:21:23,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 77 letters. Loop has 39 letters. [2022-02-21 04:21:23,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 77 letters. Loop has 39 letters. [2022-02-21 04:21:23,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 77 letters. Loop has 39 letters. [2022-02-21 04:21:23,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 40 letters. [2022-02-21 04:21:23,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 40 letters. [2022-02-21 04:21:23,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 62 letters. Loop has 40 letters. [2022-02-21 04:21:23,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 7 letters. [2022-02-21 04:21:23,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 7 letters. [2022-02-21 04:21:23,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 48 letters. Loop has 7 letters. [2022-02-21 04:21:23,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 42 letters. [2022-02-21 04:21:23,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 42 letters. [2022-02-21 04:21:23,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 54 letters. Loop has 42 letters. [2022-02-21 04:21:23,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 47 letters. Loop has 7 letters. [2022-02-21 04:21:23,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 47 letters. Loop has 7 letters. [2022-02-21 04:21:23,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 47 letters. Loop has 7 letters. [2022-02-21 04:21:23,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 7 letters. [2022-02-21 04:21:23,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 46 letters. Loop has 7 letters. [2022-02-21 04:21:23,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 46 letters. Loop has 7 letters. [2022-02-21 04:21:23,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 52 letters. Loop has 39 letters. [2022-02-21 04:21:23,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 39 letters. [2022-02-21 04:21:23,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 52 letters. Loop has 39 letters. [2022-02-21 04:21:23,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 53 letters. Loop has 39 letters. [2022-02-21 04:21:23,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 39 letters. [2022-02-21 04:21:23,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 53 letters. Loop has 39 letters. [2022-02-21 04:21:23,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 53 letters. Loop has 42 letters. [2022-02-21 04:21:23,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 42 letters. [2022-02-21 04:21:23,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 53 letters. Loop has 42 letters. [2022-02-21 04:21:23,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 7 letters. [2022-02-21 04:21:23,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 46 letters. Loop has 7 letters. [2022-02-21 04:21:23,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 46 letters. Loop has 7 letters. [2022-02-21 04:21:23,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 47 letters. Loop has 7 letters. [2022-02-21 04:21:23,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 47 letters. Loop has 7 letters. [2022-02-21 04:21:23,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 47 letters. Loop has 7 letters. [2022-02-21 04:21:23,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 42 letters. Loop has 7 letters. [2022-02-21 04:21:23,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 7 letters. [2022-02-21 04:21:23,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 42 letters. Loop has 7 letters. [2022-02-21 04:21:23,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 43 letters. Loop has 7 letters. [2022-02-21 04:21:23,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 43 letters. Loop has 7 letters. [2022-02-21 04:21:23,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 43 letters. Loop has 7 letters. [2022-02-21 04:21:23,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 64 letters. Loop has 39 letters. [2022-02-21 04:21:23,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 39 letters. [2022-02-21 04:21:23,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 64 letters. Loop has 39 letters. [2022-02-21 04:21:23,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 65 letters. Loop has 39 letters. [2022-02-21 04:21:23,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 39 letters. [2022-02-21 04:21:23,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 65 letters. Loop has 39 letters. [2022-02-21 04:21:23,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 42 letters. [2022-02-21 04:21:23,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 42 letters. [2022-02-21 04:21:23,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 54 letters. Loop has 42 letters. [2022-02-21 04:21:23,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 16 letters. [2022-02-21 04:21:23,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 16 letters. [2022-02-21 04:21:23,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 54 letters. Loop has 16 letters. [2022-02-21 04:21:23,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 15 letters. [2022-02-21 04:21:23,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 15 letters. [2022-02-21 04:21:23,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 54 letters. Loop has 15 letters. [2022-02-21 04:21:23,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 59 letters. Loop has 39 letters. [2022-02-21 04:21:23,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 39 letters. [2022-02-21 04:21:23,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 59 letters. Loop has 39 letters. [2022-02-21 04:21:23,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 60 letters. Loop has 39 letters. [2022-02-21 04:21:23,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 39 letters. [2022-02-21 04:21:23,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 60 letters. Loop has 39 letters. [2022-02-21 04:21:23,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 75 letters. Loop has 39 letters. [2022-02-21 04:21:23,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 75 letters. Loop has 39 letters. [2022-02-21 04:21:23,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 75 letters. Loop has 39 letters. [2022-02-21 04:21:23,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 76 letters. Loop has 39 letters. [2022-02-21 04:21:23,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 76 letters. Loop has 39 letters. [2022-02-21 04:21:23,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 76 letters. Loop has 39 letters. [2022-02-21 04:21:23,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 39 letters. [2022-02-21 04:21:23,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 39 letters. [2022-02-21 04:21:23,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 54 letters. Loop has 39 letters. [2022-02-21 04:21:23,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 55 letters. Loop has 39 letters. [2022-02-21 04:21:23,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 39 letters. [2022-02-21 04:21:23,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 55 letters. Loop has 39 letters. [2022-02-21 04:21:23,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 61 letters. Loop has 39 letters. [2022-02-21 04:21:23,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 39 letters. [2022-02-21 04:21:23,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 61 letters. Loop has 39 letters. [2022-02-21 04:21:23,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 44 letters. Loop has 7 letters. [2022-02-21 04:21:23,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 44 letters. Loop has 7 letters. [2022-02-21 04:21:23,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 44 letters. Loop has 7 letters. [2022-02-21 04:21:23,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 45 letters. Loop has 7 letters. [2022-02-21 04:21:23,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 45 letters. Loop has 7 letters. [2022-02-21 04:21:23,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 45 letters. Loop has 7 letters. [2022-02-21 04:21:23,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 45 letters. Loop has 7 letters. [2022-02-21 04:21:23,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 45 letters. Loop has 7 letters. [2022-02-21 04:21:23,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 45 letters. Loop has 7 letters. [2022-02-21 04:21:23,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 66 letters. Loop has 39 letters. [2022-02-21 04:21:23,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 39 letters. [2022-02-21 04:21:23,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 66 letters. Loop has 39 letters. [2022-02-21 04:21:23,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 55 letters. Loop has 16 letters. [2022-02-21 04:21:23,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 16 letters. [2022-02-21 04:21:23,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 55 letters. Loop has 16 letters. [2022-02-21 04:21:23,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 55 letters. Loop has 15 letters. [2022-02-21 04:21:23,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 15 letters. [2022-02-21 04:21:23,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 55 letters. Loop has 15 letters. [2022-02-21 04:21:23,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 64 letters. Loop has 42 letters. [2022-02-21 04:21:23,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 42 letters. [2022-02-21 04:21:23,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 64 letters. Loop has 42 letters. [2022-02-21 04:21:23,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 39 letters. [2022-02-21 04:21:23,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 39 letters. [2022-02-21 04:21:23,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 62 letters. Loop has 39 letters. [2022-02-21 04:21:23,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 53 letters. Loop has 15 letters. [2022-02-21 04:21:23,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 15 letters. [2022-02-21 04:21:23,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 53 letters. Loop has 15 letters. [2022-02-21 04:21:23,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 39 letters. [2022-02-21 04:21:23,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 39 letters. [2022-02-21 04:21:23,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 67 letters. Loop has 39 letters. [2022-02-21 04:21:23,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 51 letters. Loop has 16 letters. [2022-02-21 04:21:23,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 16 letters. [2022-02-21 04:21:23,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 51 letters. Loop has 16 letters. [2022-02-21 04:21:23,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 51 letters. Loop has 15 letters. [2022-02-21 04:21:23,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 15 letters. [2022-02-21 04:21:23,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 51 letters. Loop has 15 letters. [2022-02-21 04:21:23,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 40 letters. Loop has 39 letters. [2022-02-21 04:21:23,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 40 letters. Loop has 39 letters. [2022-02-21 04:21:23,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 40 letters. Loop has 39 letters. [2022-02-21 04:21:23,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 41 letters. Loop has 39 letters. [2022-02-21 04:21:23,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 41 letters. Loop has 39 letters. [2022-02-21 04:21:23,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 41 letters. Loop has 39 letters. [2022-02-21 04:21:23,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:21:23,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:21:23,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:21:23,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 91 letters. Loop has 8 letters. [2022-02-21 04:21:23,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 91 letters. Loop has 8 letters. [2022-02-21 04:21:23,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 91 letters. Loop has 8 letters. [2022-02-21 04:21:23,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 42 letters. [2022-02-21 04:21:23,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 42 letters. [2022-02-21 04:21:23,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 54 letters. Loop has 42 letters. [2022-02-21 04:21:23,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 91 letters. Loop has 39 letters. [2022-02-21 04:21:23,753 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,753 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 91 letters. Loop has 39 letters. [2022-02-21 04:21:23,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 91 letters. Loop has 39 letters. [2022-02-21 04:21:23,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 92 letters. Loop has 15 letters. [2022-02-21 04:21:23,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 92 letters. Loop has 15 letters. [2022-02-21 04:21:23,754 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,754 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 92 letters. Loop has 15 letters. [2022-02-21 04:21:23,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 92 letters. Loop has 42 letters. [2022-02-21 04:21:23,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 92 letters. Loop has 42 letters. [2022-02-21 04:21:23,755 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,755 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 92 letters. Loop has 42 letters. [2022-02-21 04:21:23,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 93 letters. Loop has 16 letters. [2022-02-21 04:21:23,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 93 letters. Loop has 16 letters. [2022-02-21 04:21:23,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,756 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 93 letters. Loop has 16 letters. [2022-02-21 04:21:23,756 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 93 letters. Loop has 15 letters. [2022-02-21 04:21:23,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 93 letters. Loop has 15 letters. [2022-02-21 04:21:23,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 93 letters. Loop has 15 letters. [2022-02-21 04:21:23,757 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,757 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 94 letters. Loop has 16 letters. [2022-02-21 04:21:23,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 94 letters. Loop has 16 letters. [2022-02-21 04:21:23,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 94 letters. Loop has 16 letters. [2022-02-21 04:21:23,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,758 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 94 letters. Loop has 15 letters. [2022-02-21 04:21:23,758 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 94 letters. Loop has 15 letters. [2022-02-21 04:21:23,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 94 letters. Loop has 15 letters. [2022-02-21 04:21:23,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 95 letters. Loop has 16 letters. [2022-02-21 04:21:23,759 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,759 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 95 letters. Loop has 16 letters. [2022-02-21 04:21:23,760 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,760 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 95 letters. Loop has 16 letters. [2022-02-21 04:21:23,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 95 letters. Loop has 15 letters. [2022-02-21 04:21:23,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 95 letters. Loop has 15 letters. [2022-02-21 04:21:23,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,761 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 95 letters. Loop has 15 letters. [2022-02-21 04:21:23,761 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 96 letters. Loop has 15 letters. [2022-02-21 04:21:23,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 96 letters. Loop has 15 letters. [2022-02-21 04:21:23,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 96 letters. Loop has 15 letters. [2022-02-21 04:21:23,762 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,762 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 96 letters. Loop has 16 letters. [2022-02-21 04:21:23,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 96 letters. Loop has 16 letters. [2022-02-21 04:21:23,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 96 letters. Loop has 16 letters. [2022-02-21 04:21:23,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 55 letters. Loop has 39 letters. [2022-02-21 04:21:23,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 39 letters. [2022-02-21 04:21:23,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 55 letters. Loop has 39 letters. [2022-02-21 04:21:23,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 97 letters. Loop has 15 letters. [2022-02-21 04:21:23,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 97 letters. Loop has 15 letters. [2022-02-21 04:21:23,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 97 letters. Loop has 15 letters. [2022-02-21 04:21:23,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 55 letters. Loop has 42 letters. [2022-02-21 04:21:23,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 42 letters. [2022-02-21 04:21:23,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 55 letters. Loop has 42 letters. [2022-02-21 04:21:23,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 97 letters. Loop has 16 letters. [2022-02-21 04:21:23,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 97 letters. Loop has 16 letters. [2022-02-21 04:21:23,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 97 letters. Loop has 16 letters. [2022-02-21 04:21:23,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 55 letters. Loop has 42 letters. [2022-02-21 04:21:23,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 42 letters. [2022-02-21 04:21:23,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 55 letters. Loop has 42 letters. [2022-02-21 04:21:23,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 98 letters. Loop has 15 letters. [2022-02-21 04:21:23,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 98 letters. Loop has 15 letters. [2022-02-21 04:21:23,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 98 letters. Loop has 15 letters. [2022-02-21 04:21:23,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 56 letters. Loop has 39 letters. [2022-02-21 04:21:23,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 39 letters. [2022-02-21 04:21:23,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 56 letters. Loop has 39 letters. [2022-02-21 04:21:23,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 56 letters. Loop has 42 letters. [2022-02-21 04:21:23,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 42 letters. [2022-02-21 04:21:23,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 56 letters. Loop has 42 letters. [2022-02-21 04:21:23,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 56 letters. Loop has 42 letters. [2022-02-21 04:21:23,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 42 letters. [2022-02-21 04:21:23,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 56 letters. Loop has 42 letters. [2022-02-21 04:21:23,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 56 letters. Loop has 42 letters. [2022-02-21 04:21:23,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 42 letters. [2022-02-21 04:21:23,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 56 letters. Loop has 42 letters. [2022-02-21 04:21:23,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 57 letters. Loop has 39 letters. [2022-02-21 04:21:23,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 39 letters. [2022-02-21 04:21:23,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 57 letters. Loop has 39 letters. [2022-02-21 04:21:23,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 57 letters. Loop has 42 letters. [2022-02-21 04:21:23,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 42 letters. [2022-02-21 04:21:23,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 57 letters. Loop has 42 letters. [2022-02-21 04:21:23,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 57 letters. Loop has 42 letters. [2022-02-21 04:21:23,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 42 letters. [2022-02-21 04:21:23,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 57 letters. Loop has 42 letters. [2022-02-21 04:21:23,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 57 letters. Loop has 42 letters. [2022-02-21 04:21:23,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 42 letters. [2022-02-21 04:21:23,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 57 letters. Loop has 42 letters. [2022-02-21 04:21:23,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 58 letters. Loop has 39 letters. [2022-02-21 04:21:23,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 39 letters. [2022-02-21 04:21:23,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 58 letters. Loop has 39 letters. [2022-02-21 04:21:23,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 58 letters. Loop has 42 letters. [2022-02-21 04:21:23,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 42 letters. [2022-02-21 04:21:23,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 58 letters. Loop has 42 letters. [2022-02-21 04:21:23,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 58 letters. Loop has 42 letters. [2022-02-21 04:21:23,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 42 letters. [2022-02-21 04:21:23,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 58 letters. Loop has 42 letters. [2022-02-21 04:21:23,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 59 letters. Loop has 39 letters. [2022-02-21 04:21:23,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 39 letters. [2022-02-21 04:21:23,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 59 letters. Loop has 39 letters. [2022-02-21 04:21:23,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 59 letters. Loop has 42 letters. [2022-02-21 04:21:23,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 42 letters. [2022-02-21 04:21:23,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 59 letters. Loop has 42 letters. [2022-02-21 04:21:23,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 60 letters. Loop has 39 letters. [2022-02-21 04:21:23,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 39 letters. [2022-02-21 04:21:23,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 60 letters. Loop has 39 letters. [2022-02-21 04:21:23,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 61 letters. Loop has 39 letters. [2022-02-21 04:21:23,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 39 letters. [2022-02-21 04:21:23,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 61 letters. Loop has 39 letters. [2022-02-21 04:21:23,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 39 letters. [2022-02-21 04:21:23,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 39 letters. [2022-02-21 04:21:23,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 62 letters. Loop has 39 letters. [2022-02-21 04:21:23,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 63 letters. Loop has 39 letters. [2022-02-21 04:21:23,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 39 letters. [2022-02-21 04:21:23,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 63 letters. Loop has 39 letters. [2022-02-21 04:21:23,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 64 letters. Loop has 39 letters. [2022-02-21 04:21:23,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 39 letters. [2022-02-21 04:21:23,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 64 letters. Loop has 39 letters. [2022-02-21 04:21:23,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 65 letters. Loop has 39 letters. [2022-02-21 04:21:23,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 39 letters. [2022-02-21 04:21:23,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 65 letters. Loop has 39 letters. [2022-02-21 04:21:23,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 65 letters. Loop has 40 letters. [2022-02-21 04:21:23,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 40 letters. [2022-02-21 04:21:23,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 65 letters. Loop has 40 letters. [2022-02-21 04:21:23,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 66 letters. Loop has 39 letters. [2022-02-21 04:21:23,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 39 letters. [2022-02-21 04:21:23,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 66 letters. Loop has 39 letters. [2022-02-21 04:21:23,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 66 letters. Loop has 41 letters. [2022-02-21 04:21:23,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 41 letters. [2022-02-21 04:21:23,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 66 letters. Loop has 41 letters. [2022-02-21 04:21:23,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 39 letters. [2022-02-21 04:21:23,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 39 letters. [2022-02-21 04:21:23,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 67 letters. Loop has 39 letters. [2022-02-21 04:21:23,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 42 letters. [2022-02-21 04:21:23,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 42 letters. [2022-02-21 04:21:23,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 67 letters. Loop has 42 letters. [2022-02-21 04:21:23,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 39 letters. [2022-02-21 04:21:23,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 39 letters. [2022-02-21 04:21:23,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 68 letters. Loop has 39 letters. [2022-02-21 04:21:23,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 69 letters. Loop has 39 letters. [2022-02-21 04:21:23,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 39 letters. [2022-02-21 04:21:23,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 69 letters. Loop has 39 letters. [2022-02-21 04:21:23,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 39 letters. [2022-02-21 04:21:23,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 39 letters. [2022-02-21 04:21:23,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 70 letters. Loop has 39 letters. [2022-02-21 04:21:23,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 71 letters. Loop has 39 letters. [2022-02-21 04:21:23,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 39 letters. [2022-02-21 04:21:23,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 71 letters. Loop has 39 letters. [2022-02-21 04:21:23,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 51 letters. Loop has 42 letters. [2022-02-21 04:21:23,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 42 letters. [2022-02-21 04:21:23,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 51 letters. Loop has 42 letters. [2022-02-21 04:21:23,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 72 letters. Loop has 39 letters. [2022-02-21 04:21:23,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 39 letters. [2022-02-21 04:21:23,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 72 letters. Loop has 39 letters. [2022-02-21 04:21:23,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 73 letters. Loop has 39 letters. [2022-02-21 04:21:23,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 39 letters. [2022-02-21 04:21:23,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 73 letters. Loop has 39 letters. [2022-02-21 04:21:23,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 74 letters. Loop has 39 letters. [2022-02-21 04:21:23,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 39 letters. [2022-02-21 04:21:23,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 74 letters. Loop has 39 letters. [2022-02-21 04:21:23,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 75 letters. Loop has 39 letters. [2022-02-21 04:21:23,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 75 letters. Loop has 39 letters. [2022-02-21 04:21:23,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 75 letters. Loop has 39 letters. [2022-02-21 04:21:23,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 52 letters. Loop has 42 letters. [2022-02-21 04:21:23,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 42 letters. [2022-02-21 04:21:23,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 52 letters. Loop has 42 letters. [2022-02-21 04:21:23,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 76 letters. Loop has 39 letters. [2022-02-21 04:21:23,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 76 letters. Loop has 39 letters. [2022-02-21 04:21:23,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 76 letters. Loop has 39 letters. [2022-02-21 04:21:23,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 77 letters. Loop has 39 letters. [2022-02-21 04:21:23,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 77 letters. Loop has 39 letters. [2022-02-21 04:21:23,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 77 letters. Loop has 39 letters. [2022-02-21 04:21:23,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 78 letters. Loop has 39 letters. [2022-02-21 04:21:23,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 78 letters. Loop has 39 letters. [2022-02-21 04:21:23,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 78 letters. Loop has 39 letters. [2022-02-21 04:21:23,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 79 letters. Loop has 39 letters. [2022-02-21 04:21:23,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 79 letters. Loop has 39 letters. [2022-02-21 04:21:23,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 79 letters. Loop has 39 letters. [2022-02-21 04:21:23,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 80 letters. Loop has 39 letters. [2022-02-21 04:21:23,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 80 letters. Loop has 39 letters. [2022-02-21 04:21:23,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 80 letters. Loop has 39 letters. [2022-02-21 04:21:23,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 81 letters. Loop has 39 letters. [2022-02-21 04:21:23,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 81 letters. Loop has 39 letters. [2022-02-21 04:21:23,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 81 letters. Loop has 39 letters. [2022-02-21 04:21:23,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 53 letters. Loop has 39 letters. [2022-02-21 04:21:23,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 39 letters. [2022-02-21 04:21:23,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 53 letters. Loop has 39 letters. [2022-02-21 04:21:23,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 82 letters. Loop has 39 letters. [2022-02-21 04:21:23,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 82 letters. Loop has 39 letters. [2022-02-21 04:21:23,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 82 letters. Loop has 39 letters. [2022-02-21 04:21:23,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 83 letters. Loop has 39 letters. [2022-02-21 04:21:23,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 83 letters. Loop has 39 letters. [2022-02-21 04:21:23,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 83 letters. Loop has 39 letters. [2022-02-21 04:21:23,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 84 letters. Loop has 7 letters. [2022-02-21 04:21:23,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 84 letters. Loop has 7 letters. [2022-02-21 04:21:23,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 84 letters. Loop has 7 letters. [2022-02-21 04:21:23,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 85 letters. Loop has 7 letters. [2022-02-21 04:21:23,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 85 letters. Loop has 7 letters. [2022-02-21 04:21:23,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 85 letters. Loop has 7 letters. [2022-02-21 04:21:23,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 86 letters. Loop has 7 letters. [2022-02-21 04:21:23,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 86 letters. Loop has 7 letters. [2022-02-21 04:21:23,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 86 letters. Loop has 7 letters. [2022-02-21 04:21:23,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 87 letters. Loop has 7 letters. [2022-02-21 04:21:23,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 87 letters. Loop has 7 letters. [2022-02-21 04:21:23,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 87 letters. Loop has 7 letters. [2022-02-21 04:21:23,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 87 letters. Loop has 7 letters. [2022-02-21 04:21:23,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 87 letters. Loop has 7 letters. [2022-02-21 04:21:23,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 87 letters. Loop has 7 letters. [2022-02-21 04:21:23,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 88 letters. Loop has 7 letters. [2022-02-21 04:21:23,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 88 letters. Loop has 7 letters. [2022-02-21 04:21:23,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 88 letters. Loop has 7 letters. [2022-02-21 04:21:23,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 88 letters. Loop has 7 letters. [2022-02-21 04:21:23,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 88 letters. Loop has 7 letters. [2022-02-21 04:21:23,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 88 letters. Loop has 7 letters. [2022-02-21 04:21:23,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 89 letters. Loop has 7 letters. [2022-02-21 04:21:23,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 89 letters. Loop has 7 letters. [2022-02-21 04:21:23,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 89 letters. Loop has 7 letters. [2022-02-21 04:21:23,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 89 letters. Loop has 7 letters. [2022-02-21 04:21:23,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 89 letters. Loop has 7 letters. [2022-02-21 04:21:23,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 89 letters. Loop has 7 letters. [2022-02-21 04:21:23,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 90 letters. Loop has 7 letters. [2022-02-21 04:21:23,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 90 letters. Loop has 7 letters. [2022-02-21 04:21:23,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 90 letters. Loop has 7 letters. [2022-02-21 04:21:23,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 90 letters. Loop has 39 letters. [2022-02-21 04:21:23,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 90 letters. Loop has 39 letters. [2022-02-21 04:21:23,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 90 letters. Loop has 39 letters. [2022-02-21 04:21:23,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 39 letters. [2022-02-21 04:21:23,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 39 letters. [2022-02-21 04:21:23,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 54 letters. Loop has 39 letters. [2022-02-21 04:21:23,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 55 letters. Loop has 15 letters. [2022-02-21 04:21:23,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 15 letters. [2022-02-21 04:21:23,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 55 letters. Loop has 15 letters. [2022-02-21 04:21:23,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 55 letters. Loop has 16 letters. [2022-02-21 04:21:23,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 16 letters. [2022-02-21 04:21:23,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 55 letters. Loop has 16 letters. [2022-02-21 04:21:23,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 55 letters. Loop has 39 letters. [2022-02-21 04:21:23,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 39 letters. [2022-02-21 04:21:23,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 55 letters. Loop has 39 letters. [2022-02-21 04:21:23,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 55 letters. Loop has 42 letters. [2022-02-21 04:21:23,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 42 letters. [2022-02-21 04:21:23,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 55 letters. Loop has 42 letters. [2022-02-21 04:21:23,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 55 letters. Loop has 42 letters. [2022-02-21 04:21:23,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 42 letters. [2022-02-21 04:21:23,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 55 letters. Loop has 42 letters. [2022-02-21 04:21:23,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 56 letters. Loop has 15 letters. [2022-02-21 04:21:23,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 15 letters. [2022-02-21 04:21:23,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 56 letters. Loop has 15 letters. [2022-02-21 04:21:23,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 56 letters. Loop has 39 letters. [2022-02-21 04:21:23,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 39 letters. [2022-02-21 04:21:23,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 56 letters. Loop has 39 letters. [2022-02-21 04:21:23,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 56 letters. Loop has 42 letters. [2022-02-21 04:21:23,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 42 letters. [2022-02-21 04:21:23,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 56 letters. Loop has 42 letters. [2022-02-21 04:21:23,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 57 letters. Loop has 39 letters. [2022-02-21 04:21:23,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 39 letters. [2022-02-21 04:21:23,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 57 letters. Loop has 39 letters. [2022-02-21 04:21:23,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 58 letters. Loop has 39 letters. [2022-02-21 04:21:23,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 39 letters. [2022-02-21 04:21:23,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 58 letters. Loop has 39 letters. [2022-02-21 04:21:23,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 59 letters. Loop has 39 letters. [2022-02-21 04:21:23,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 39 letters. [2022-02-21 04:21:23,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 59 letters. Loop has 39 letters. [2022-02-21 04:21:23,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 60 letters. Loop has 39 letters. [2022-02-21 04:21:23,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 39 letters. [2022-02-21 04:21:23,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 60 letters. Loop has 39 letters. [2022-02-21 04:21:23,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 61 letters. Loop has 39 letters. [2022-02-21 04:21:23,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 39 letters. [2022-02-21 04:21:23,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 61 letters. Loop has 39 letters. [2022-02-21 04:21:23,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 42 letters. Loop has 7 letters. [2022-02-21 04:21:23,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 7 letters. [2022-02-21 04:21:23,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 42 letters. Loop has 7 letters. [2022-02-21 04:21:23,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 43 letters. Loop has 7 letters. [2022-02-21 04:21:23,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 43 letters. Loop has 7 letters. [2022-02-21 04:21:23,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 43 letters. Loop has 7 letters. [2022-02-21 04:21:23,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 39 letters. [2022-02-21 04:21:23,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 39 letters. [2022-02-21 04:21:23,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 62 letters. Loop has 39 letters. [2022-02-21 04:21:23,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 62 letters. Loop has 40 letters. [2022-02-21 04:21:23,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 40 letters. [2022-02-21 04:21:23,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 62 letters. Loop has 40 letters. [2022-02-21 04:21:23,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 44 letters. Loop has 7 letters. [2022-02-21 04:21:23,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 44 letters. Loop has 7 letters. [2022-02-21 04:21:23,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 44 letters. Loop has 7 letters. [2022-02-21 04:21:23,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 45 letters. Loop has 7 letters. [2022-02-21 04:21:23,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 45 letters. Loop has 7 letters. [2022-02-21 04:21:23,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 45 letters. Loop has 7 letters. [2022-02-21 04:21:23,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 63 letters. Loop has 39 letters. [2022-02-21 04:21:23,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 39 letters. [2022-02-21 04:21:23,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 63 letters. Loop has 39 letters. [2022-02-21 04:21:23,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 45 letters. Loop has 7 letters. [2022-02-21 04:21:23,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 45 letters. Loop has 7 letters. [2022-02-21 04:21:23,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 45 letters. Loop has 7 letters. [2022-02-21 04:21:23,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 63 letters. Loop has 41 letters. [2022-02-21 04:21:23,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 41 letters. [2022-02-21 04:21:23,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 63 letters. Loop has 41 letters. [2022-02-21 04:21:23,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 7 letters. [2022-02-21 04:21:23,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 46 letters. Loop has 7 letters. [2022-02-21 04:21:23,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 46 letters. Loop has 7 letters. [2022-02-21 04:21:23,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 46 letters. Loop has 7 letters. [2022-02-21 04:21:23,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 46 letters. Loop has 7 letters. [2022-02-21 04:21:23,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 46 letters. Loop has 7 letters. [2022-02-21 04:21:23,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 64 letters. Loop has 39 letters. [2022-02-21 04:21:23,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 39 letters. [2022-02-21 04:21:23,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 64 letters. Loop has 39 letters. [2022-02-21 04:21:23,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 64 letters. Loop has 42 letters. [2022-02-21 04:21:23,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 42 letters. [2022-02-21 04:21:23,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 64 letters. Loop has 42 letters. [2022-02-21 04:21:23,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 47 letters. Loop has 7 letters. [2022-02-21 04:21:23,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 47 letters. Loop has 7 letters. [2022-02-21 04:21:23,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 47 letters. Loop has 7 letters. [2022-02-21 04:21:23,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 47 letters. Loop has 7 letters. [2022-02-21 04:21:23,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 47 letters. Loop has 7 letters. [2022-02-21 04:21:23,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 47 letters. Loop has 7 letters. [2022-02-21 04:21:23,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 65 letters. Loop has 39 letters. [2022-02-21 04:21:23,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 39 letters. [2022-02-21 04:21:23,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 65 letters. Loop has 39 letters. [2022-02-21 04:21:23,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 7 letters. [2022-02-21 04:21:23,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 7 letters. [2022-02-21 04:21:23,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 48 letters. Loop has 7 letters. [2022-02-21 04:21:23,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 48 letters. Loop has 39 letters. [2022-02-21 04:21:23,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 39 letters. [2022-02-21 04:21:23,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 48 letters. Loop has 39 letters. [2022-02-21 04:21:23,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 66 letters. Loop has 39 letters. [2022-02-21 04:21:23,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 39 letters. [2022-02-21 04:21:23,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 66 letters. Loop has 39 letters. [2022-02-21 04:21:23,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:21:23,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:21:23,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:21:23,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 49 letters. Loop has 39 letters. [2022-02-21 04:21:23,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 49 letters. Loop has 39 letters. [2022-02-21 04:21:23,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 49 letters. Loop has 39 letters. [2022-02-21 04:21:23,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 67 letters. Loop has 39 letters. [2022-02-21 04:21:23,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 39 letters. [2022-02-21 04:21:23,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 67 letters. Loop has 39 letters. [2022-02-21 04:21:23,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 50 letters. Loop has 15 letters. [2022-02-21 04:21:23,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 15 letters. [2022-02-21 04:21:23,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 50 letters. Loop has 15 letters. [2022-02-21 04:21:23,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 50 letters. Loop has 39 letters. [2022-02-21 04:21:23,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 39 letters. [2022-02-21 04:21:23,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 50 letters. Loop has 39 letters. [2022-02-21 04:21:23,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 50 letters. Loop has 42 letters. [2022-02-21 04:21:23,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 42 letters. [2022-02-21 04:21:23,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 50 letters. Loop has 42 letters. [2022-02-21 04:21:23,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 68 letters. Loop has 39 letters. [2022-02-21 04:21:23,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 39 letters. [2022-02-21 04:21:23,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 68 letters. Loop has 39 letters. [2022-02-21 04:21:23,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 69 letters. Loop has 39 letters. [2022-02-21 04:21:23,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 39 letters. [2022-02-21 04:21:23,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 69 letters. Loop has 39 letters. [2022-02-21 04:21:23,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 51 letters. Loop has 16 letters. [2022-02-21 04:21:23,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 16 letters. [2022-02-21 04:21:23,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 51 letters. Loop has 16 letters. [2022-02-21 04:21:23,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 51 letters. Loop has 15 letters. [2022-02-21 04:21:23,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 15 letters. [2022-02-21 04:21:23,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 51 letters. Loop has 15 letters. [2022-02-21 04:21:23,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 70 letters. Loop has 39 letters. [2022-02-21 04:21:23,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 39 letters. [2022-02-21 04:21:23,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 70 letters. Loop has 39 letters. [2022-02-21 04:21:23,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 51 letters. Loop has 39 letters. [2022-02-21 04:21:23,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 39 letters. [2022-02-21 04:21:23,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 51 letters. Loop has 39 letters. [2022-02-21 04:21:23,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 51 letters. Loop has 42 letters. [2022-02-21 04:21:23,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 42 letters. [2022-02-21 04:21:23,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 51 letters. Loop has 42 letters. [2022-02-21 04:21:23,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 71 letters. Loop has 39 letters. [2022-02-21 04:21:23,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 39 letters. [2022-02-21 04:21:23,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 71 letters. Loop has 39 letters. [2022-02-21 04:21:23,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 51 letters. Loop has 42 letters. [2022-02-21 04:21:23,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 42 letters. [2022-02-21 04:21:23,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 51 letters. Loop has 42 letters. [2022-02-21 04:21:23,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 72 letters. Loop has 39 letters. [2022-02-21 04:21:23,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 39 letters. [2022-02-21 04:21:23,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 72 letters. Loop has 39 letters. [2022-02-21 04:21:23,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 73 letters. Loop has 39 letters. [2022-02-21 04:21:23,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 39 letters. [2022-02-21 04:21:23,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 73 letters. Loop has 39 letters. [2022-02-21 04:21:23,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 52 letters. Loop has 16 letters. [2022-02-21 04:21:23,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 16 letters. [2022-02-21 04:21:23,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 52 letters. Loop has 16 letters. [2022-02-21 04:21:23,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 74 letters. Loop has 39 letters. [2022-02-21 04:21:23,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 39 letters. [2022-02-21 04:21:23,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 74 letters. Loop has 39 letters. [2022-02-21 04:21:23,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 52 letters. Loop has 15 letters. [2022-02-21 04:21:23,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 15 letters. [2022-02-21 04:21:23,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 52 letters. Loop has 15 letters. [2022-02-21 04:21:23,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 52 letters. Loop has 39 letters. [2022-02-21 04:21:23,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 39 letters. [2022-02-21 04:21:23,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 52 letters. Loop has 39 letters. [2022-02-21 04:21:23,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 75 letters. Loop has 39 letters. [2022-02-21 04:21:23,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 75 letters. Loop has 39 letters. [2022-02-21 04:21:23,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 75 letters. Loop has 39 letters. [2022-02-21 04:21:23,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 52 letters. Loop has 42 letters. [2022-02-21 04:21:23,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 42 letters. [2022-02-21 04:21:23,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 52 letters. Loop has 42 letters. [2022-02-21 04:21:23,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 52 letters. Loop has 42 letters. [2022-02-21 04:21:23,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 42 letters. [2022-02-21 04:21:23,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 52 letters. Loop has 42 letters. [2022-02-21 04:21:23,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 76 letters. Loop has 39 letters. [2022-02-21 04:21:23,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 76 letters. Loop has 39 letters. [2022-02-21 04:21:23,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 76 letters. Loop has 39 letters. [2022-02-21 04:21:23,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 52 letters. Loop has 42 letters. [2022-02-21 04:21:23,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 42 letters. [2022-02-21 04:21:23,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 52 letters. Loop has 42 letters. [2022-02-21 04:21:23,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 77 letters. Loop has 39 letters. [2022-02-21 04:21:23,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 77 letters. Loop has 39 letters. [2022-02-21 04:21:23,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 77 letters. Loop has 39 letters. [2022-02-21 04:21:23,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 78 letters. Loop has 39 letters. [2022-02-21 04:21:23,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 78 letters. Loop has 39 letters. [2022-02-21 04:21:23,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 78 letters. Loop has 39 letters. [2022-02-21 04:21:23,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 53 letters. Loop has 16 letters. [2022-02-21 04:21:23,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 16 letters. [2022-02-21 04:21:23,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 53 letters. Loop has 16 letters. [2022-02-21 04:21:23,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 53 letters. Loop has 15 letters. [2022-02-21 04:21:23,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 15 letters. [2022-02-21 04:21:23,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 53 letters. Loop has 15 letters. [2022-02-21 04:21:23,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 79 letters. Loop has 39 letters. [2022-02-21 04:21:23,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 79 letters. Loop has 39 letters. [2022-02-21 04:21:23,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 79 letters. Loop has 39 letters. [2022-02-21 04:21:23,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 53 letters. Loop has 39 letters. [2022-02-21 04:21:23,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 39 letters. [2022-02-21 04:21:23,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 53 letters. Loop has 39 letters. [2022-02-21 04:21:23,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 53 letters. Loop has 42 letters. [2022-02-21 04:21:23,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 42 letters. [2022-02-21 04:21:23,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 53 letters. Loop has 42 letters. [2022-02-21 04:21:23,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 80 letters. Loop has 39 letters. [2022-02-21 04:21:23,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 80 letters. Loop has 39 letters. [2022-02-21 04:21:23,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 80 letters. Loop has 39 letters. [2022-02-21 04:21:23,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 53 letters. Loop has 42 letters. [2022-02-21 04:21:23,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 42 letters. [2022-02-21 04:21:23,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 53 letters. Loop has 42 letters. [2022-02-21 04:21:23,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 53 letters. Loop has 42 letters. [2022-02-21 04:21:23,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 42 letters. [2022-02-21 04:21:23,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 53 letters. Loop has 42 letters. [2022-02-21 04:21:23,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 15 letters. [2022-02-21 04:21:23,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 15 letters. [2022-02-21 04:21:23,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 54 letters. Loop has 15 letters. [2022-02-21 04:21:23,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 16 letters. [2022-02-21 04:21:23,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 16 letters. [2022-02-21 04:21:23,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 54 letters. Loop has 16 letters. [2022-02-21 04:21:23,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 39 letters. [2022-02-21 04:21:23,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 39 letters. [2022-02-21 04:21:23,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 54 letters. Loop has 39 letters. [2022-02-21 04:21:23,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 42 letters. [2022-02-21 04:21:23,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 42 letters. [2022-02-21 04:21:23,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 54 letters. Loop has 42 letters. [2022-02-21 04:21:23,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 42 letters. [2022-02-21 04:21:23,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 42 letters. [2022-02-21 04:21:23,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 54 letters. Loop has 42 letters. [2022-02-21 04:21:23,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 120 states and 180 transitions. cyclomatic complexity: 61 Stem has 54 letters. Loop has 42 letters. [2022-02-21 04:21:23,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 42 letters. [2022-02-21 04:21:23,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 274 states and 422 transitions. cyclomatic complexity: 151 Stem has 54 letters. Loop has 42 letters. [2022-02-21 04:21:23,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,890 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:21:23,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 15.8) internal successors, (79), 5 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:23,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 181 transitions. [2022-02-21 04:21:23,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 181 transitions. Stem has 40 letters. Loop has 39 letters. [2022-02-21 04:21:23,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 181 transitions. Stem has 79 letters. Loop has 39 letters. [2022-02-21 04:21:23,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 181 transitions. Stem has 40 letters. Loop has 78 letters. [2022-02-21 04:21:23,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:23,892 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 274 states and 422 transitions. cyclomatic complexity: 151 [2022-02-21 04:21:23,897 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 148 [2022-02-21 04:21:23,900 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 274 states to 274 states and 422 transitions. [2022-02-21 04:21:23,900 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 195 [2022-02-21 04:21:23,901 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 198 [2022-02-21 04:21:23,901 INFO L73 IsDeterministic]: Start isDeterministic. Operand 274 states and 422 transitions. [2022-02-21 04:21:23,901 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:21:23,901 INFO L681 BuchiCegarLoop]: Abstraction has 274 states and 422 transitions. [2022-02-21 04:21:23,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 274 states and 422 transitions. [2022-02-21 04:21:23,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 274 to 271. [2022-02-21 04:21:23,904 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:21:23,904 INFO L82 GeneralOperation]: Start isEquivalent. First operand 274 states and 422 transitions. Second operand has 271 states, 271 states have (on average 1.5387453874538746) internal successors, (417), 270 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:23,905 INFO L74 IsIncluded]: Start isIncluded. First operand 274 states and 422 transitions. Second operand has 271 states, 271 states have (on average 1.5387453874538746) internal successors, (417), 270 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:23,905 INFO L87 Difference]: Start difference. First operand 274 states and 422 transitions. Second operand has 271 states, 271 states have (on average 1.5387453874538746) internal successors, (417), 270 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:23,906 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:21:23,912 INFO L93 Difference]: Finished difference Result 274 states and 422 transitions. [2022-02-21 04:21:23,912 INFO L276 IsEmpty]: Start isEmpty. Operand 274 states and 422 transitions. [2022-02-21 04:21:23,913 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:23,913 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:23,913 INFO L74 IsIncluded]: Start isIncluded. First operand has 271 states, 271 states have (on average 1.5387453874538746) internal successors, (417), 270 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 274 states and 422 transitions. [2022-02-21 04:21:23,914 INFO L87 Difference]: Start difference. First operand has 271 states, 271 states have (on average 1.5387453874538746) internal successors, (417), 270 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 274 states and 422 transitions. [2022-02-21 04:21:23,914 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:21:23,919 INFO L93 Difference]: Finished difference Result 277 states and 427 transitions. [2022-02-21 04:21:23,919 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 427 transitions. [2022-02-21 04:21:23,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:23,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:23,920 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:21:23,920 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:21:23,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 271 states have (on average 1.5387453874538746) internal successors, (417), 270 states have internal predecessors, (417), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:23,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 417 transitions. [2022-02-21 04:21:23,924 INFO L704 BuchiCegarLoop]: Abstraction has 271 states and 417 transitions. [2022-02-21 04:21:23,924 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:21:23,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 04:21:23,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 04:21:23,925 INFO L87 Difference]: Start difference. First operand 271 states and 417 transitions. Second operand has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:24,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:24,084 INFO L93 Difference]: Finished difference Result 271 states and 416 transitions. [2022-02-21 04:21:24,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:21:24,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 10.0) internal successors, (40), 4 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:24,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:21:24,108 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 271 states and 416 transitions. [2022-02-21 04:21:24,113 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 148 [2022-02-21 04:21:24,117 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 271 states to 271 states and 416 transitions. [2022-02-21 04:21:24,117 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 195 [2022-02-21 04:21:24,117 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 195 [2022-02-21 04:21:24,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 271 states and 416 transitions. [2022-02-21 04:21:24,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:21:24,117 INFO L681 BuchiCegarLoop]: Abstraction has 271 states and 416 transitions. [2022-02-21 04:21:24,118 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states and 416 transitions. [2022-02-21 04:21:24,120 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 271. [2022-02-21 04:21:24,120 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:21:24,121 INFO L82 GeneralOperation]: Start isEquivalent. First operand 271 states and 416 transitions. Second operand has 271 states, 271 states have (on average 1.5350553505535056) internal successors, (416), 270 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:24,121 INFO L74 IsIncluded]: Start isIncluded. First operand 271 states and 416 transitions. Second operand has 271 states, 271 states have (on average 1.5350553505535056) internal successors, (416), 270 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:24,121 INFO L87 Difference]: Start difference. First operand 271 states and 416 transitions. Second operand has 271 states, 271 states have (on average 1.5350553505535056) internal successors, (416), 270 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:24,122 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:21:24,126 INFO L93 Difference]: Finished difference Result 271 states and 416 transitions. [2022-02-21 04:21:24,133 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 416 transitions. [2022-02-21 04:21:24,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:24,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:24,134 INFO L74 IsIncluded]: Start isIncluded. First operand has 271 states, 271 states have (on average 1.5350553505535056) internal successors, (416), 270 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 271 states and 416 transitions. [2022-02-21 04:21:24,135 INFO L87 Difference]: Start difference. First operand has 271 states, 271 states have (on average 1.5350553505535056) internal successors, (416), 270 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 271 states and 416 transitions. [2022-02-21 04:21:24,135 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:21:24,140 INFO L93 Difference]: Finished difference Result 271 states and 416 transitions. [2022-02-21 04:21:24,140 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 416 transitions. [2022-02-21 04:21:24,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:24,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:24,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:21:24,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:21:24,141 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 271 states have (on average 1.5350553505535056) internal successors, (416), 270 states have internal predecessors, (416), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:24,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 416 transitions. [2022-02-21 04:21:24,144 INFO L704 BuchiCegarLoop]: Abstraction has 271 states and 416 transitions. [2022-02-21 04:21:24,144 INFO L587 BuchiCegarLoop]: Abstraction has 271 states and 416 transitions. [2022-02-21 04:21:24,144 INFO L425 BuchiCegarLoop]: ======== Iteration 10============ [2022-02-21 04:21:24,145 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 271 states and 416 transitions. [2022-02-21 04:21:24,145 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 148 [2022-02-21 04:21:24,146 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:21:24,146 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:21:24,146 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:24,146 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:24,146 INFO L791 eck$LassoCheckResult]: Stem: 6415#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(16, 2);call #Ultimate.allocInit(12, 3);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 6321#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~2#1;havoc main_~__retres1~2#1;assume { :begin_inline_init_model } true;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 6257#L490 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret8#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 6258#L212 assume 1 == ~b0_req_up~0;assume { :begin_inline_update_b0 } true; 6363#L137 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 6364#L137-2 ~b0_req_up~0 := 0; 6353#L145 assume { :end_inline_update_b0 } true; 6354#L212-2 assume 1 == ~b1_req_up~0;assume { :begin_inline_update_b1 } true; 6286#L152 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 6287#L152-2 ~b1_req_up~0 := 0; 6395#L160 assume { :end_inline_update_b1 } true; 6394#L219-1 assume 1 == ~d0_req_up~0;assume { :begin_inline_update_d0 } true; 6261#L167 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 6262#L167-2 ~d0_req_up~0 := 0; 6225#L175 assume { :end_inline_update_d0 } true; 6226#L226-1 assume 1 == ~d1_req_up~0;assume { :begin_inline_update_d1 } true; 6322#L182 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 6272#L182-2 ~d1_req_up~0 := 0; 6273#L190 assume { :end_inline_update_d1 } true; 6362#L233-1 assume !(1 == ~z_req_up~0); 6370#L240-1 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 6251#L255 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 6252#L255-2 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 6371#L321 assume !(0 == ~b0_ev~0); 6372#L321-2 assume !(0 == ~b1_ev~0); 6280#L326-1 assume !(0 == ~d0_ev~0); 6281#L331-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 6235#L336-1 assume !(0 == ~z_ev~0); 6236#L341-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; 6419#L107 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; 6264#L129 is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; 6346#L130 activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; 6347#L390 assume !(0 != activate_threads_~tmp~1#1); 6398#L390-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 6345#L354 assume !(1 == ~b0_ev~0); 6317#L354-2 assume !(1 == ~b1_ev~0); 6318#L359-1 assume !(1 == ~d0_ev~0); 6319#L364-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 6320#L369-1 assume !(1 == ~z_ev~0); 6329#L374-1 assume { :end_inline_reset_delta_events } true; 6401#L432-2 assume !false; 6426#L433 [2022-02-21 04:21:24,146 INFO L793 eck$LassoCheckResult]: Loop: 6426#L433 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1; 6227#L295 assume !false; 6228#L286 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; 6266#L268 assume !(0 == ~comp_m1_st~0);exists_runnable_thread_~__retres1~1#1 := 0; 6268#L275 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; 6481#L276 eval_#t~ret4#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___0~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; 6476#L290 assume !(0 != eval_~tmp___0~0#1); 6325#L311 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; 6326#L212-3 assume !(1 == ~b0_req_up~0); 6374#L212-5 assume !(1 == ~b1_req_up~0); 6302#L219-3 assume !(1 == ~d0_req_up~0); 6396#L226-3 assume !(1 == ~d1_req_up~0); 6430#L233-3 assume !(1 == ~z_req_up~0); 6253#L240-3 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; 6254#L321-3 assume !(0 == ~b0_ev~0); 6390#L321-5 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 6485#L326-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 6484#L331-3 assume !(0 == ~d1_ev~0); 6483#L336-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 6482#L341-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; 6480#L107-1 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; 6475#L129-1 is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; 6474#L130-1 activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; 6473#L390-3 assume 0 != activate_threads_~tmp~1#1;~comp_m1_st~0 := 0; 6472#L390-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 6471#L354-3 assume !(1 == ~b0_ev~0); 6470#L354-5 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 6428#L359-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 6469#L364-3 assume !(1 == ~d1_ev~0); 6468#L369-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 6467#L374-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret7#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; 6466#L268-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; 6420#L275-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; 6315#L276-1 stop_simulation_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret7#1;havoc stop_simulation_#t~ret7#1; 6247#L407 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 6248#L414 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 6458#L415 start_simulation_#t~ret8#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret8#1;havoc start_simulation_#t~ret8#1; 6456#L449 assume !(0 != start_simulation_~tmp~3#1); 6453#L432-2 assume !false; 6426#L433 [2022-02-21 04:21:24,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:24,147 INFO L85 PathProgramCache]: Analyzing trace with hash 750743388, now seen corresponding path program 1 times [2022-02-21 04:21:24,147 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:24,147 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653085626] [2022-02-21 04:21:24,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:24,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:24,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:24,162 INFO L290 TraceCheckUtils]: 0: Hoare triple {7523#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(16, 2);call #Ultimate.allocInit(12, 3);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; {7523#true} is VALID [2022-02-21 04:21:24,163 INFO L290 TraceCheckUtils]: 1: Hoare triple {7523#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~2#1;havoc main_~__retres1~2#1;assume { :begin_inline_init_model } true;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; {7523#true} is VALID [2022-02-21 04:21:24,163 INFO L290 TraceCheckUtils]: 2: Hoare triple {7523#true} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret8#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; {7523#true} is VALID [2022-02-21 04:21:24,163 INFO L290 TraceCheckUtils]: 3: Hoare triple {7523#true} assume 1 == ~b0_req_up~0;assume { :begin_inline_update_b0 } true; {7523#true} is VALID [2022-02-21 04:21:24,163 INFO L290 TraceCheckUtils]: 4: Hoare triple {7523#true} assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; {7525#(= ~b0_ev~0 0)} is VALID [2022-02-21 04:21:24,163 INFO L290 TraceCheckUtils]: 5: Hoare triple {7525#(= ~b0_ev~0 0)} ~b0_req_up~0 := 0; {7525#(= ~b0_ev~0 0)} is VALID [2022-02-21 04:21:24,164 INFO L290 TraceCheckUtils]: 6: Hoare triple {7525#(= ~b0_ev~0 0)} assume { :end_inline_update_b0 } true; {7525#(= ~b0_ev~0 0)} is VALID [2022-02-21 04:21:24,164 INFO L290 TraceCheckUtils]: 7: Hoare triple {7525#(= ~b0_ev~0 0)} assume 1 == ~b1_req_up~0;assume { :begin_inline_update_b1 } true; {7525#(= ~b0_ev~0 0)} is VALID [2022-02-21 04:21:24,164 INFO L290 TraceCheckUtils]: 8: Hoare triple {7525#(= ~b0_ev~0 0)} assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; {7525#(= ~b0_ev~0 0)} is VALID [2022-02-21 04:21:24,164 INFO L290 TraceCheckUtils]: 9: Hoare triple {7525#(= ~b0_ev~0 0)} ~b1_req_up~0 := 0; {7525#(= ~b0_ev~0 0)} is VALID [2022-02-21 04:21:24,165 INFO L290 TraceCheckUtils]: 10: Hoare triple {7525#(= ~b0_ev~0 0)} assume { :end_inline_update_b1 } true; {7525#(= ~b0_ev~0 0)} is VALID [2022-02-21 04:21:24,165 INFO L290 TraceCheckUtils]: 11: Hoare triple {7525#(= ~b0_ev~0 0)} assume 1 == ~d0_req_up~0;assume { :begin_inline_update_d0 } true; {7525#(= ~b0_ev~0 0)} is VALID [2022-02-21 04:21:24,165 INFO L290 TraceCheckUtils]: 12: Hoare triple {7525#(= ~b0_ev~0 0)} assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; {7525#(= ~b0_ev~0 0)} is VALID [2022-02-21 04:21:24,166 INFO L290 TraceCheckUtils]: 13: Hoare triple {7525#(= ~b0_ev~0 0)} ~d0_req_up~0 := 0; {7525#(= ~b0_ev~0 0)} is VALID [2022-02-21 04:21:24,166 INFO L290 TraceCheckUtils]: 14: Hoare triple {7525#(= ~b0_ev~0 0)} assume { :end_inline_update_d0 } true; {7525#(= ~b0_ev~0 0)} is VALID [2022-02-21 04:21:24,166 INFO L290 TraceCheckUtils]: 15: Hoare triple {7525#(= ~b0_ev~0 0)} assume 1 == ~d1_req_up~0;assume { :begin_inline_update_d1 } true; {7525#(= ~b0_ev~0 0)} is VALID [2022-02-21 04:21:24,166 INFO L290 TraceCheckUtils]: 16: Hoare triple {7525#(= ~b0_ev~0 0)} assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; {7525#(= ~b0_ev~0 0)} is VALID [2022-02-21 04:21:24,167 INFO L290 TraceCheckUtils]: 17: Hoare triple {7525#(= ~b0_ev~0 0)} ~d1_req_up~0 := 0; {7525#(= ~b0_ev~0 0)} is VALID [2022-02-21 04:21:24,167 INFO L290 TraceCheckUtils]: 18: Hoare triple {7525#(= ~b0_ev~0 0)} assume { :end_inline_update_d1 } true; {7525#(= ~b0_ev~0 0)} is VALID [2022-02-21 04:21:24,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {7525#(= ~b0_ev~0 0)} assume !(1 == ~z_req_up~0); {7525#(= ~b0_ev~0 0)} is VALID [2022-02-21 04:21:24,178 INFO L290 TraceCheckUtils]: 20: Hoare triple {7525#(= ~b0_ev~0 0)} assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; {7525#(= ~b0_ev~0 0)} is VALID [2022-02-21 04:21:24,178 INFO L290 TraceCheckUtils]: 21: Hoare triple {7525#(= ~b0_ev~0 0)} assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; {7525#(= ~b0_ev~0 0)} is VALID [2022-02-21 04:21:24,178 INFO L290 TraceCheckUtils]: 22: Hoare triple {7525#(= ~b0_ev~0 0)} assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; {7525#(= ~b0_ev~0 0)} is VALID [2022-02-21 04:21:24,179 INFO L290 TraceCheckUtils]: 23: Hoare triple {7525#(= ~b0_ev~0 0)} assume !(0 == ~b0_ev~0); {7524#false} is VALID [2022-02-21 04:21:24,179 INFO L290 TraceCheckUtils]: 24: Hoare triple {7524#false} assume !(0 == ~b1_ev~0); {7524#false} is VALID [2022-02-21 04:21:24,179 INFO L290 TraceCheckUtils]: 25: Hoare triple {7524#false} assume !(0 == ~d0_ev~0); {7524#false} is VALID [2022-02-21 04:21:24,179 INFO L290 TraceCheckUtils]: 26: Hoare triple {7524#false} assume 0 == ~d1_ev~0;~d1_ev~0 := 1; {7524#false} is VALID [2022-02-21 04:21:24,179 INFO L290 TraceCheckUtils]: 27: Hoare triple {7524#false} assume !(0 == ~z_ev~0); {7524#false} is VALID [2022-02-21 04:21:24,179 INFO L290 TraceCheckUtils]: 28: Hoare triple {7524#false} assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; {7524#false} is VALID [2022-02-21 04:21:24,179 INFO L290 TraceCheckUtils]: 29: Hoare triple {7524#false} assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; {7524#false} is VALID [2022-02-21 04:21:24,180 INFO L290 TraceCheckUtils]: 30: Hoare triple {7524#false} is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; {7524#false} is VALID [2022-02-21 04:21:24,180 INFO L290 TraceCheckUtils]: 31: Hoare triple {7524#false} activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; {7524#false} is VALID [2022-02-21 04:21:24,180 INFO L290 TraceCheckUtils]: 32: Hoare triple {7524#false} assume !(0 != activate_threads_~tmp~1#1); {7524#false} is VALID [2022-02-21 04:21:24,180 INFO L290 TraceCheckUtils]: 33: Hoare triple {7524#false} assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; {7524#false} is VALID [2022-02-21 04:21:24,180 INFO L290 TraceCheckUtils]: 34: Hoare triple {7524#false} assume !(1 == ~b0_ev~0); {7524#false} is VALID [2022-02-21 04:21:24,180 INFO L290 TraceCheckUtils]: 35: Hoare triple {7524#false} assume !(1 == ~b1_ev~0); {7524#false} is VALID [2022-02-21 04:21:24,180 INFO L290 TraceCheckUtils]: 36: Hoare triple {7524#false} assume !(1 == ~d0_ev~0); {7524#false} is VALID [2022-02-21 04:21:24,180 INFO L290 TraceCheckUtils]: 37: Hoare triple {7524#false} assume 1 == ~d1_ev~0;~d1_ev~0 := 2; {7524#false} is VALID [2022-02-21 04:21:24,180 INFO L290 TraceCheckUtils]: 38: Hoare triple {7524#false} assume !(1 == ~z_ev~0); {7524#false} is VALID [2022-02-21 04:21:24,181 INFO L290 TraceCheckUtils]: 39: Hoare triple {7524#false} assume { :end_inline_reset_delta_events } true; {7524#false} is VALID [2022-02-21 04:21:24,181 INFO L290 TraceCheckUtils]: 40: Hoare triple {7524#false} assume !false; {7524#false} is VALID [2022-02-21 04:21:24,181 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:21:24,181 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:24,181 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653085626] [2022-02-21 04:21:24,181 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653085626] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:24,181 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:24,182 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:21:24,182 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217138145] [2022-02-21 04:21:24,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:24,182 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:21:24,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:24,183 INFO L85 PathProgramCache]: Analyzing trace with hash 618560829, now seen corresponding path program 1 times [2022-02-21 04:21:24,183 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:24,183 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601445488] [2022-02-21 04:21:24,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:24,183 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:24,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:24,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {7526#true} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1; {7526#true} is VALID [2022-02-21 04:21:24,199 INFO L290 TraceCheckUtils]: 1: Hoare triple {7526#true} assume !false; {7526#true} is VALID [2022-02-21 04:21:24,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {7526#true} assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; {7526#true} is VALID [2022-02-21 04:21:24,199 INFO L290 TraceCheckUtils]: 3: Hoare triple {7526#true} assume !(0 == ~comp_m1_st~0);exists_runnable_thread_~__retres1~1#1 := 0; {7526#true} is VALID [2022-02-21 04:21:24,199 INFO L290 TraceCheckUtils]: 4: Hoare triple {7526#true} exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; {7526#true} is VALID [2022-02-21 04:21:24,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {7526#true} eval_#t~ret4#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___0~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; {7526#true} is VALID [2022-02-21 04:21:24,199 INFO L290 TraceCheckUtils]: 6: Hoare triple {7526#true} assume !(0 != eval_~tmp___0~0#1); {7526#true} is VALID [2022-02-21 04:21:24,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {7526#true} assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; {7526#true} is VALID [2022-02-21 04:21:24,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {7526#true} assume !(1 == ~b0_req_up~0); {7526#true} is VALID [2022-02-21 04:21:24,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {7526#true} assume !(1 == ~b1_req_up~0); {7526#true} is VALID [2022-02-21 04:21:24,200 INFO L290 TraceCheckUtils]: 10: Hoare triple {7526#true} assume !(1 == ~d0_req_up~0); {7526#true} is VALID [2022-02-21 04:21:24,200 INFO L290 TraceCheckUtils]: 11: Hoare triple {7526#true} assume !(1 == ~d1_req_up~0); {7526#true} is VALID [2022-02-21 04:21:24,200 INFO L290 TraceCheckUtils]: 12: Hoare triple {7526#true} assume !(1 == ~z_req_up~0); {7526#true} is VALID [2022-02-21 04:21:24,200 INFO L290 TraceCheckUtils]: 13: Hoare triple {7526#true} assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; {7526#true} is VALID [2022-02-21 04:21:24,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {7526#true} assume !(0 == ~b0_ev~0); {7526#true} is VALID [2022-02-21 04:21:24,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {7526#true} assume 0 == ~b1_ev~0;~b1_ev~0 := 1; {7526#true} is VALID [2022-02-21 04:21:24,200 INFO L290 TraceCheckUtils]: 16: Hoare triple {7526#true} assume 0 == ~d0_ev~0;~d0_ev~0 := 1; {7526#true} is VALID [2022-02-21 04:21:24,200 INFO L290 TraceCheckUtils]: 17: Hoare triple {7526#true} assume !(0 == ~d1_ev~0); {7526#true} is VALID [2022-02-21 04:21:24,201 INFO L290 TraceCheckUtils]: 18: Hoare triple {7526#true} assume 0 == ~z_ev~0;~z_ev~0 := 1; {7526#true} is VALID [2022-02-21 04:21:24,201 INFO L290 TraceCheckUtils]: 19: Hoare triple {7526#true} assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; {7526#true} is VALID [2022-02-21 04:21:24,201 INFO L290 TraceCheckUtils]: 20: Hoare triple {7526#true} assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; {7528#(= (+ (- 1) ~b0_ev~0) 0)} is VALID [2022-02-21 04:21:24,201 INFO L290 TraceCheckUtils]: 21: Hoare triple {7528#(= (+ (- 1) ~b0_ev~0) 0)} is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; {7528#(= (+ (- 1) ~b0_ev~0) 0)} is VALID [2022-02-21 04:21:24,202 INFO L290 TraceCheckUtils]: 22: Hoare triple {7528#(= (+ (- 1) ~b0_ev~0) 0)} activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; {7528#(= (+ (- 1) ~b0_ev~0) 0)} is VALID [2022-02-21 04:21:24,202 INFO L290 TraceCheckUtils]: 23: Hoare triple {7528#(= (+ (- 1) ~b0_ev~0) 0)} assume 0 != activate_threads_~tmp~1#1;~comp_m1_st~0 := 0; {7528#(= (+ (- 1) ~b0_ev~0) 0)} is VALID [2022-02-21 04:21:24,202 INFO L290 TraceCheckUtils]: 24: Hoare triple {7528#(= (+ (- 1) ~b0_ev~0) 0)} assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; {7528#(= (+ (- 1) ~b0_ev~0) 0)} is VALID [2022-02-21 04:21:24,202 INFO L290 TraceCheckUtils]: 25: Hoare triple {7528#(= (+ (- 1) ~b0_ev~0) 0)} assume !(1 == ~b0_ev~0); {7527#false} is VALID [2022-02-21 04:21:24,203 INFO L290 TraceCheckUtils]: 26: Hoare triple {7527#false} assume 1 == ~b1_ev~0;~b1_ev~0 := 2; {7527#false} is VALID [2022-02-21 04:21:24,203 INFO L290 TraceCheckUtils]: 27: Hoare triple {7527#false} assume 1 == ~d0_ev~0;~d0_ev~0 := 2; {7527#false} is VALID [2022-02-21 04:21:24,203 INFO L290 TraceCheckUtils]: 28: Hoare triple {7527#false} assume !(1 == ~d1_ev~0); {7527#false} is VALID [2022-02-21 04:21:24,203 INFO L290 TraceCheckUtils]: 29: Hoare triple {7527#false} assume 1 == ~z_ev~0;~z_ev~0 := 2; {7527#false} is VALID [2022-02-21 04:21:24,203 INFO L290 TraceCheckUtils]: 30: Hoare triple {7527#false} assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret7#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; {7527#false} is VALID [2022-02-21 04:21:24,203 INFO L290 TraceCheckUtils]: 31: Hoare triple {7527#false} assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; {7527#false} is VALID [2022-02-21 04:21:24,203 INFO L290 TraceCheckUtils]: 32: Hoare triple {7527#false} exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; {7527#false} is VALID [2022-02-21 04:21:24,203 INFO L290 TraceCheckUtils]: 33: Hoare triple {7527#false} stop_simulation_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret7#1;havoc stop_simulation_#t~ret7#1; {7527#false} is VALID [2022-02-21 04:21:24,203 INFO L290 TraceCheckUtils]: 34: Hoare triple {7527#false} assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; {7527#false} is VALID [2022-02-21 04:21:24,204 INFO L290 TraceCheckUtils]: 35: Hoare triple {7527#false} stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; {7527#false} is VALID [2022-02-21 04:21:24,204 INFO L290 TraceCheckUtils]: 36: Hoare triple {7527#false} start_simulation_#t~ret8#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret8#1;havoc start_simulation_#t~ret8#1; {7527#false} is VALID [2022-02-21 04:21:24,204 INFO L290 TraceCheckUtils]: 37: Hoare triple {7527#false} assume !(0 != start_simulation_~tmp~3#1); {7527#false} is VALID [2022-02-21 04:21:24,204 INFO L290 TraceCheckUtils]: 38: Hoare triple {7527#false} assume !false; {7527#false} is VALID [2022-02-21 04:21:24,204 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:21:24,204 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:24,204 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601445488] [2022-02-21 04:21:24,204 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601445488] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:24,205 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:24,205 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:21:24,205 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840064950] [2022-02-21 04:21:24,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:24,205 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:21:24,205 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:21:24,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:21:24,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:21:24,206 INFO L87 Difference]: Start difference. First operand 271 states and 416 transitions. cyclomatic complexity: 148 Second operand has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:24,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:24,332 INFO L93 Difference]: Finished difference Result 313 states and 475 transitions. [2022-02-21 04:21:24,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:21:24,332 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 13.0) internal successors, (39), 3 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:24,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 39 edges. 39 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:21:24,356 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 313 states and 475 transitions. [2022-02-21 04:21:24,361 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 159 [2022-02-21 04:21:24,368 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 313 states to 303 states and 459 transitions. [2022-02-21 04:21:24,369 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 217 [2022-02-21 04:21:24,369 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 217 [2022-02-21 04:21:24,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 303 states and 459 transitions. [2022-02-21 04:21:24,369 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:21:24,369 INFO L681 BuchiCegarLoop]: Abstraction has 303 states and 459 transitions. [2022-02-21 04:21:24,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 303 states and 459 transitions. [2022-02-21 04:21:24,373 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 303 to 303. [2022-02-21 04:21:24,374 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:21:24,374 INFO L82 GeneralOperation]: Start isEquivalent. First operand 303 states and 459 transitions. Second operand has 303 states, 303 states have (on average 1.5148514851485149) internal successors, (459), 302 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:24,374 INFO L74 IsIncluded]: Start isIncluded. First operand 303 states and 459 transitions. Second operand has 303 states, 303 states have (on average 1.5148514851485149) internal successors, (459), 302 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:24,375 INFO L87 Difference]: Start difference. First operand 303 states and 459 transitions. Second operand has 303 states, 303 states have (on average 1.5148514851485149) internal successors, (459), 302 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:24,381 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:21:24,385 INFO L93 Difference]: Finished difference Result 303 states and 459 transitions. [2022-02-21 04:21:24,386 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 459 transitions. [2022-02-21 04:21:24,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:24,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:24,386 INFO L74 IsIncluded]: Start isIncluded. First operand has 303 states, 303 states have (on average 1.5148514851485149) internal successors, (459), 302 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 303 states and 459 transitions. [2022-02-21 04:21:24,387 INFO L87 Difference]: Start difference. First operand has 303 states, 303 states have (on average 1.5148514851485149) internal successors, (459), 302 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 303 states and 459 transitions. [2022-02-21 04:21:24,387 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:21:24,392 INFO L93 Difference]: Finished difference Result 303 states and 459 transitions. [2022-02-21 04:21:24,392 INFO L276 IsEmpty]: Start isEmpty. Operand 303 states and 459 transitions. [2022-02-21 04:21:24,393 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:24,393 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:24,393 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:21:24,393 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:21:24,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 303 states, 303 states have (on average 1.5148514851485149) internal successors, (459), 302 states have internal predecessors, (459), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:24,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 303 states to 303 states and 459 transitions. [2022-02-21 04:21:24,397 INFO L704 BuchiCegarLoop]: Abstraction has 303 states and 459 transitions. [2022-02-21 04:21:24,397 INFO L587 BuchiCegarLoop]: Abstraction has 303 states and 459 transitions. [2022-02-21 04:21:24,397 INFO L425 BuchiCegarLoop]: ======== Iteration 11============ [2022-02-21 04:21:24,397 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 303 states and 459 transitions. [2022-02-21 04:21:24,398 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 159 [2022-02-21 04:21:24,398 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:21:24,399 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:21:24,399 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:24,399 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:24,399 INFO L791 eck$LassoCheckResult]: Stem: 8039#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(16, 2);call #Ultimate.allocInit(12, 3);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 7945#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~2#1;havoc main_~__retres1~2#1;assume { :begin_inline_init_model } true;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 7884#L490 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret8#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 7885#L212 assume 1 == ~b0_req_up~0;assume { :begin_inline_update_b0 } true; 7986#L137 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 7987#L137-2 ~b0_req_up~0 := 0; 7977#L145 assume { :end_inline_update_b0 } true; 7978#L212-2 assume 1 == ~b1_req_up~0;assume { :begin_inline_update_b1 } true; 7913#L152 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 7914#L152-2 ~b1_req_up~0 := 0; 8018#L160 assume { :end_inline_update_b1 } true; 8017#L219-1 assume 1 == ~d0_req_up~0;assume { :begin_inline_update_d0 } true; 7888#L167 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 7889#L167-2 ~d0_req_up~0 := 0; 7852#L175 assume { :end_inline_update_d0 } true; 7853#L226-1 assume 1 == ~d1_req_up~0;assume { :begin_inline_update_d1 } true; 7949#L182 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 7899#L182-2 ~d1_req_up~0 := 0; 7900#L190 assume { :end_inline_update_d1 } true; 7985#L233-1 assume !(1 == ~z_req_up~0); 7993#L240-1 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 7882#L255 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 7883#L255-2 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 7994#L321 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 7995#L321-2 assume !(0 == ~b1_ev~0); 7907#L326-1 assume !(0 == ~d0_ev~0); 7908#L331-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 7862#L336-1 assume !(0 == ~z_ev~0); 7863#L341-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; 8042#L107 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; 8035#L129 is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; 7970#L130 activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; 7971#L390 assume !(0 != activate_threads_~tmp~1#1); 8021#L390-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 7969#L354 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 7941#L354-2 assume !(1 == ~b1_ev~0); 7942#L359-1 assume !(1 == ~d0_ev~0); 7943#L364-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 7944#L369-1 assume !(1 == ~z_ev~0); 7954#L374-1 assume { :end_inline_reset_delta_events } true; 8024#L432-2 assume !false; 7924#L433 [2022-02-21 04:21:24,399 INFO L793 eck$LassoCheckResult]: Loop: 7924#L433 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1; 7854#L295 assume !false; 7855#L286 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; 7893#L268 assume !(0 == ~comp_m1_st~0);exists_runnable_thread_~__retres1~1#1 := 0; 7895#L275 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; 8106#L276 eval_#t~ret4#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___0~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; 8105#L290 assume !(0 != eval_~tmp___0~0#1); 8104#L311 assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; 8101#L212-3 assume !(1 == ~b0_req_up~0); 8098#L212-5 assume !(1 == ~b1_req_up~0); 8019#L219-3 assume !(1 == ~d0_req_up~0); 7846#L226-3 assume !(1 == ~d1_req_up~0); 7847#L233-3 assume !(1 == ~z_req_up~0); 7878#L240-3 assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; 7879#L321-3 assume !(0 == ~b0_ev~0); 7988#L321-5 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 7989#L326-3 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 7961#L331-3 assume !(0 == ~d1_ev~0); 7866#L336-3 assume 0 == ~z_ev~0;~z_ev~0 := 1; 7867#L341-3 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; 7886#L107-1 assume !(1 == ~b0_ev~0); 8033#L111-1 assume 1 == ~b1_ev~0;is_method1_triggered_~__retres1~0#1 := 1; 7910#L129-1 is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; 7946#L130-1 activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; 7858#L390-3 assume 0 != activate_threads_~tmp~1#1;~comp_m1_st~0 := 0; 7859#L390-5 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 7901#L354-3 assume !(1 == ~b0_ev~0); 7915#L354-5 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 8025#L359-3 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 8015#L364-3 assume !(1 == ~d1_ev~0); 8012#L369-3 assume 1 == ~z_ev~0;~z_ev~0 := 2; 7955#L374-3 assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret7#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; 7956#L268-1 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; 8002#L275-1 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; 7939#L276-1 stop_simulation_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret7#1;havoc stop_simulation_#t~ret7#1; 7874#L407 assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; 7875#L414 stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; 8031#L415 start_simulation_#t~ret8#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret8#1;havoc start_simulation_#t~ret8#1; 8004#L449 assume !(0 != start_simulation_~tmp~3#1); 7923#L432-2 assume !false; 7924#L433 [2022-02-21 04:21:24,400 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:24,400 INFO L85 PathProgramCache]: Analyzing trace with hash 969880732, now seen corresponding path program 1 times [2022-02-21 04:21:24,400 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:24,400 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051384850] [2022-02-21 04:21:24,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:24,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:24,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:24,421 INFO L290 TraceCheckUtils]: 0: Hoare triple {9332#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(16, 2);call #Ultimate.allocInit(12, 3);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; {9332#true} is VALID [2022-02-21 04:21:24,421 INFO L290 TraceCheckUtils]: 1: Hoare triple {9332#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~2#1;havoc main_~__retres1~2#1;assume { :begin_inline_init_model } true;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; {9332#true} is VALID [2022-02-21 04:21:24,421 INFO L290 TraceCheckUtils]: 2: Hoare triple {9332#true} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret8#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; {9332#true} is VALID [2022-02-21 04:21:24,421 INFO L290 TraceCheckUtils]: 3: Hoare triple {9332#true} assume 1 == ~b0_req_up~0;assume { :begin_inline_update_b0 } true; {9332#true} is VALID [2022-02-21 04:21:24,421 INFO L290 TraceCheckUtils]: 4: Hoare triple {9332#true} assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; {9332#true} is VALID [2022-02-21 04:21:24,422 INFO L290 TraceCheckUtils]: 5: Hoare triple {9332#true} ~b0_req_up~0 := 0; {9332#true} is VALID [2022-02-21 04:21:24,422 INFO L290 TraceCheckUtils]: 6: Hoare triple {9332#true} assume { :end_inline_update_b0 } true; {9332#true} is VALID [2022-02-21 04:21:24,422 INFO L290 TraceCheckUtils]: 7: Hoare triple {9332#true} assume 1 == ~b1_req_up~0;assume { :begin_inline_update_b1 } true; {9332#true} is VALID [2022-02-21 04:21:24,422 INFO L290 TraceCheckUtils]: 8: Hoare triple {9332#true} assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; {9334#(= ~b1_ev~0 0)} is VALID [2022-02-21 04:21:24,422 INFO L290 TraceCheckUtils]: 9: Hoare triple {9334#(= ~b1_ev~0 0)} ~b1_req_up~0 := 0; {9334#(= ~b1_ev~0 0)} is VALID [2022-02-21 04:21:24,423 INFO L290 TraceCheckUtils]: 10: Hoare triple {9334#(= ~b1_ev~0 0)} assume { :end_inline_update_b1 } true; {9334#(= ~b1_ev~0 0)} is VALID [2022-02-21 04:21:24,423 INFO L290 TraceCheckUtils]: 11: Hoare triple {9334#(= ~b1_ev~0 0)} assume 1 == ~d0_req_up~0;assume { :begin_inline_update_d0 } true; {9334#(= ~b1_ev~0 0)} is VALID [2022-02-21 04:21:24,423 INFO L290 TraceCheckUtils]: 12: Hoare triple {9334#(= ~b1_ev~0 0)} assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; {9334#(= ~b1_ev~0 0)} is VALID [2022-02-21 04:21:24,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {9334#(= ~b1_ev~0 0)} ~d0_req_up~0 := 0; {9334#(= ~b1_ev~0 0)} is VALID [2022-02-21 04:21:24,424 INFO L290 TraceCheckUtils]: 14: Hoare triple {9334#(= ~b1_ev~0 0)} assume { :end_inline_update_d0 } true; {9334#(= ~b1_ev~0 0)} is VALID [2022-02-21 04:21:24,424 INFO L290 TraceCheckUtils]: 15: Hoare triple {9334#(= ~b1_ev~0 0)} assume 1 == ~d1_req_up~0;assume { :begin_inline_update_d1 } true; {9334#(= ~b1_ev~0 0)} is VALID [2022-02-21 04:21:24,424 INFO L290 TraceCheckUtils]: 16: Hoare triple {9334#(= ~b1_ev~0 0)} assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; {9334#(= ~b1_ev~0 0)} is VALID [2022-02-21 04:21:24,424 INFO L290 TraceCheckUtils]: 17: Hoare triple {9334#(= ~b1_ev~0 0)} ~d1_req_up~0 := 0; {9334#(= ~b1_ev~0 0)} is VALID [2022-02-21 04:21:24,425 INFO L290 TraceCheckUtils]: 18: Hoare triple {9334#(= ~b1_ev~0 0)} assume { :end_inline_update_d1 } true; {9334#(= ~b1_ev~0 0)} is VALID [2022-02-21 04:21:24,425 INFO L290 TraceCheckUtils]: 19: Hoare triple {9334#(= ~b1_ev~0 0)} assume !(1 == ~z_req_up~0); {9334#(= ~b1_ev~0 0)} is VALID [2022-02-21 04:21:24,425 INFO L290 TraceCheckUtils]: 20: Hoare triple {9334#(= ~b1_ev~0 0)} assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; {9334#(= ~b1_ev~0 0)} is VALID [2022-02-21 04:21:24,426 INFO L290 TraceCheckUtils]: 21: Hoare triple {9334#(= ~b1_ev~0 0)} assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; {9334#(= ~b1_ev~0 0)} is VALID [2022-02-21 04:21:24,426 INFO L290 TraceCheckUtils]: 22: Hoare triple {9334#(= ~b1_ev~0 0)} assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; {9334#(= ~b1_ev~0 0)} is VALID [2022-02-21 04:21:24,426 INFO L290 TraceCheckUtils]: 23: Hoare triple {9334#(= ~b1_ev~0 0)} assume 0 == ~b0_ev~0;~b0_ev~0 := 1; {9334#(= ~b1_ev~0 0)} is VALID [2022-02-21 04:21:24,426 INFO L290 TraceCheckUtils]: 24: Hoare triple {9334#(= ~b1_ev~0 0)} assume !(0 == ~b1_ev~0); {9333#false} is VALID [2022-02-21 04:21:24,426 INFO L290 TraceCheckUtils]: 25: Hoare triple {9333#false} assume !(0 == ~d0_ev~0); {9333#false} is VALID [2022-02-21 04:21:24,427 INFO L290 TraceCheckUtils]: 26: Hoare triple {9333#false} assume 0 == ~d1_ev~0;~d1_ev~0 := 1; {9333#false} is VALID [2022-02-21 04:21:24,427 INFO L290 TraceCheckUtils]: 27: Hoare triple {9333#false} assume !(0 == ~z_ev~0); {9333#false} is VALID [2022-02-21 04:21:24,427 INFO L290 TraceCheckUtils]: 28: Hoare triple {9333#false} assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; {9333#false} is VALID [2022-02-21 04:21:24,427 INFO L290 TraceCheckUtils]: 29: Hoare triple {9333#false} assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; {9333#false} is VALID [2022-02-21 04:21:24,427 INFO L290 TraceCheckUtils]: 30: Hoare triple {9333#false} is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; {9333#false} is VALID [2022-02-21 04:21:24,427 INFO L290 TraceCheckUtils]: 31: Hoare triple {9333#false} activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; {9333#false} is VALID [2022-02-21 04:21:24,427 INFO L290 TraceCheckUtils]: 32: Hoare triple {9333#false} assume !(0 != activate_threads_~tmp~1#1); {9333#false} is VALID [2022-02-21 04:21:24,427 INFO L290 TraceCheckUtils]: 33: Hoare triple {9333#false} assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; {9333#false} is VALID [2022-02-21 04:21:24,427 INFO L290 TraceCheckUtils]: 34: Hoare triple {9333#false} assume 1 == ~b0_ev~0;~b0_ev~0 := 2; {9333#false} is VALID [2022-02-21 04:21:24,428 INFO L290 TraceCheckUtils]: 35: Hoare triple {9333#false} assume !(1 == ~b1_ev~0); {9333#false} is VALID [2022-02-21 04:21:24,428 INFO L290 TraceCheckUtils]: 36: Hoare triple {9333#false} assume !(1 == ~d0_ev~0); {9333#false} is VALID [2022-02-21 04:21:24,428 INFO L290 TraceCheckUtils]: 37: Hoare triple {9333#false} assume 1 == ~d1_ev~0;~d1_ev~0 := 2; {9333#false} is VALID [2022-02-21 04:21:24,428 INFO L290 TraceCheckUtils]: 38: Hoare triple {9333#false} assume !(1 == ~z_ev~0); {9333#false} is VALID [2022-02-21 04:21:24,428 INFO L290 TraceCheckUtils]: 39: Hoare triple {9333#false} assume { :end_inline_reset_delta_events } true; {9333#false} is VALID [2022-02-21 04:21:24,428 INFO L290 TraceCheckUtils]: 40: Hoare triple {9333#false} assume !false; {9333#false} is VALID [2022-02-21 04:21:24,428 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:21:24,428 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:24,429 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051384850] [2022-02-21 04:21:24,429 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051384850] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:24,429 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:24,429 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:21:24,429 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106510503] [2022-02-21 04:21:24,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:24,430 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:21:24,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:24,430 INFO L85 PathProgramCache]: Analyzing trace with hash 571541896, now seen corresponding path program 1 times [2022-02-21 04:21:24,430 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:24,431 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650184868] [2022-02-21 04:21:24,431 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:24,431 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:24,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:21:24,436 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:21:24,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:21:24,442 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:21:24,701 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:21:24,702 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:21:24,702 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:21:24,702 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:21:24,702 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:21:24,702 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:21:24,702 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:21:24,702 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:21:24,702 INFO L133 ssoRankerPreferences]: Filename of dumped script: bist_cell.cil.c_Iteration11_Loop [2022-02-21 04:21:24,702 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:21:24,702 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:21:24,703 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:21:24,705 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:21:24,707 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:21:24,710 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:21:24,712 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:21:24,713 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:21:24,717 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:21:24,720 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:21:24,722 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:21:24,724 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:21:24,728 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:21:24,730 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:21:24,732 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:21:24,734 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:21:24,736 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:21:24,738 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:21:24,742 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:21:24,744 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:21:24,750 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:21:24,753 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:21:24,755 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:21:24,759 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:21:24,763 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:21:25,071 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:21:25,071 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:21:25,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:21:25,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:21:25,072 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:21:25,073 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:21:25,075 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:21:25,075 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:21:25,092 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:21:25,092 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stop_simulation_~__retres2~0#1=0} Honda state: {ULTIMATE.start_stop_simulation_~__retres2~0#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:21:25,110 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 04:21:25,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:21:25,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:21:25,115 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:21:25,120 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:21:25,120 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:21:25,129 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:21:25,143 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:21:25,143 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_stop_simulation_#t~ret7#1=0} Honda state: {ULTIMATE.start_stop_simulation_#t~ret7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:21:25,159 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 04:21:25,159 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:21:25,160 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:21:25,164 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:21:25,167 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:21:25,167 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:21:25,167 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:21:25,205 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:21:25,205 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:21:25,205 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:21:25,206 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:21:25,207 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:21:25,209 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:21:25,209 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:21:25,227 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:21:25,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 04:21:25,242 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:21:25,242 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:21:25,242 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:21:25,242 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:21:25,242 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:21:25,242 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:21:25,242 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:21:25,242 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:21:25,242 INFO L133 ssoRankerPreferences]: Filename of dumped script: bist_cell.cil.c_Iteration11_Loop [2022-02-21 04:21:25,243 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:21:25,243 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:21:25,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:21:25,249 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:21:25,251 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:21:25,253 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:21:25,255 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:21:25,258 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:21:25,261 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:21:25,263 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:21:25,265 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:21:25,267 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:21:25,271 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:21:25,273 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:21:25,274 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:21:25,276 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:21:25,278 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:21:25,280 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:21:25,282 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:21:25,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:21:25,287 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:21:25,290 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:21:25,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:21:25,296 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:21:25,300 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:21:25,573 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:21:25,573 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:21:25,573 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:21:25,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:21:25,574 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:21:25,575 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:21:25,577 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:21:25,582 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:21:25,582 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:21:25,582 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:21:25,582 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:21:25,582 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:21:25,583 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:21:25,583 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:21:25,598 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:21:25,600 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:21:25,600 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:21:25,600 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:21:25,600 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:21:25,602 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:21:25,603 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:21:25,604 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:21:25,604 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:21:25,604 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:21:25,604 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(~d0_ev~0) = -1*~d0_ev~0 + 1 Supporting invariants [] [2022-02-21 04:21:25,621 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:21:25,636 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:21:25,640 INFO L390 LassoCheck]: Loop: "start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1;" "assume !false;" "assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1;" "assume !(0 == ~comp_m1_st~0);exists_runnable_thread_~__retres1~1#1 := 0;" "exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1;" "eval_#t~ret4#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___0~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1;" "assume !(0 != eval_~tmp___0~0#1);" "assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true;" "assume !(1 == ~b0_req_up~0);" "assume !(1 == ~b1_req_up~0);" "assume !(1 == ~d0_req_up~0);" "assume !(1 == ~d1_req_up~0);" "assume !(1 == ~z_req_up~0);" "assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true;" "assume !(0 == ~b0_ev~0);" "assume 0 == ~b1_ev~0;~b1_ev~0 := 1;" "assume 0 == ~d0_ev~0;~d0_ev~0 := 1;" "assume !(0 == ~d1_ev~0);" "assume 0 == ~z_ev~0;~z_ev~0 := 1;" "assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1;" "assume !(1 == ~b0_ev~0);" "assume 1 == ~b1_ev~0;is_method1_triggered_~__retres1~0#1 := 1;" "is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1;" "activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1;" "assume 0 != activate_threads_~tmp~1#1;~comp_m1_st~0 := 0;" "assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true;" "assume !(1 == ~b0_ev~0);" "assume 1 == ~b1_ev~0;~b1_ev~0 := 2;" "assume 1 == ~d0_ev~0;~d0_ev~0 := 2;" "assume !(1 == ~d1_ev~0);" "assume 1 == ~z_ev~0;~z_ev~0 := 2;" "assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret7#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1;" "assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1;" "exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1;" "stop_simulation_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret7#1;havoc stop_simulation_#t~ret7#1;" "assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0;" "stop_simulation_#res#1 := stop_simulation_~__retres2~0#1;" "start_simulation_#t~ret8#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret8#1;havoc start_simulation_#t~ret8#1;" "assume !(0 != start_simulation_~tmp~3#1);" "assume !false;" [2022-02-21 04:21:25,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:25,653 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:25,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:25,675 INFO L263 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:21:25,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:25,684 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:21:25,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {9337#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(16, 2);call #Ultimate.allocInit(12, 3);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; {9337#unseeded} is VALID [2022-02-21 04:21:25,744 INFO L290 TraceCheckUtils]: 1: Hoare triple {9337#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~2#1;havoc main_~__retres1~2#1;assume { :begin_inline_init_model } true;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; {9337#unseeded} is VALID [2022-02-21 04:21:25,744 INFO L290 TraceCheckUtils]: 2: Hoare triple {9337#unseeded} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret8#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; {9337#unseeded} is VALID [2022-02-21 04:21:25,744 INFO L290 TraceCheckUtils]: 3: Hoare triple {9337#unseeded} assume 1 == ~b0_req_up~0;assume { :begin_inline_update_b0 } true; {9337#unseeded} is VALID [2022-02-21 04:21:25,744 INFO L290 TraceCheckUtils]: 4: Hoare triple {9337#unseeded} assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; {9337#unseeded} is VALID [2022-02-21 04:21:25,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {9337#unseeded} ~b0_req_up~0 := 0; {9337#unseeded} is VALID [2022-02-21 04:21:25,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {9337#unseeded} assume { :end_inline_update_b0 } true; {9337#unseeded} is VALID [2022-02-21 04:21:25,745 INFO L290 TraceCheckUtils]: 7: Hoare triple {9337#unseeded} assume 1 == ~b1_req_up~0;assume { :begin_inline_update_b1 } true; {9337#unseeded} is VALID [2022-02-21 04:21:25,745 INFO L290 TraceCheckUtils]: 8: Hoare triple {9337#unseeded} assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; {9337#unseeded} is VALID [2022-02-21 04:21:25,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {9337#unseeded} ~b1_req_up~0 := 0; {9337#unseeded} is VALID [2022-02-21 04:21:25,746 INFO L290 TraceCheckUtils]: 10: Hoare triple {9337#unseeded} assume { :end_inline_update_b1 } true; {9337#unseeded} is VALID [2022-02-21 04:21:25,746 INFO L290 TraceCheckUtils]: 11: Hoare triple {9337#unseeded} assume 1 == ~d0_req_up~0;assume { :begin_inline_update_d0 } true; {9337#unseeded} is VALID [2022-02-21 04:21:25,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {9337#unseeded} assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; {9337#unseeded} is VALID [2022-02-21 04:21:25,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {9337#unseeded} ~d0_req_up~0 := 0; {9337#unseeded} is VALID [2022-02-21 04:21:25,747 INFO L290 TraceCheckUtils]: 14: Hoare triple {9337#unseeded} assume { :end_inline_update_d0 } true; {9337#unseeded} is VALID [2022-02-21 04:21:25,747 INFO L290 TraceCheckUtils]: 15: Hoare triple {9337#unseeded} assume 1 == ~d1_req_up~0;assume { :begin_inline_update_d1 } true; {9337#unseeded} is VALID [2022-02-21 04:21:25,750 INFO L290 TraceCheckUtils]: 16: Hoare triple {9337#unseeded} assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; {9337#unseeded} is VALID [2022-02-21 04:21:25,750 INFO L290 TraceCheckUtils]: 17: Hoare triple {9337#unseeded} ~d1_req_up~0 := 0; {9337#unseeded} is VALID [2022-02-21 04:21:25,750 INFO L290 TraceCheckUtils]: 18: Hoare triple {9337#unseeded} assume { :end_inline_update_d1 } true; {9337#unseeded} is VALID [2022-02-21 04:21:25,750 INFO L290 TraceCheckUtils]: 19: Hoare triple {9337#unseeded} assume !(1 == ~z_req_up~0); {9337#unseeded} is VALID [2022-02-21 04:21:25,751 INFO L290 TraceCheckUtils]: 20: Hoare triple {9337#unseeded} assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; {9337#unseeded} is VALID [2022-02-21 04:21:25,751 INFO L290 TraceCheckUtils]: 21: Hoare triple {9337#unseeded} assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; {9337#unseeded} is VALID [2022-02-21 04:21:25,751 INFO L290 TraceCheckUtils]: 22: Hoare triple {9337#unseeded} assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; {9337#unseeded} is VALID [2022-02-21 04:21:25,751 INFO L290 TraceCheckUtils]: 23: Hoare triple {9337#unseeded} assume 0 == ~b0_ev~0;~b0_ev~0 := 1; {9337#unseeded} is VALID [2022-02-21 04:21:25,752 INFO L290 TraceCheckUtils]: 24: Hoare triple {9337#unseeded} assume !(0 == ~b1_ev~0); {9337#unseeded} is VALID [2022-02-21 04:21:25,752 INFO L290 TraceCheckUtils]: 25: Hoare triple {9337#unseeded} assume !(0 == ~d0_ev~0); {9337#unseeded} is VALID [2022-02-21 04:21:25,752 INFO L290 TraceCheckUtils]: 26: Hoare triple {9337#unseeded} assume 0 == ~d1_ev~0;~d1_ev~0 := 1; {9337#unseeded} is VALID [2022-02-21 04:21:25,752 INFO L290 TraceCheckUtils]: 27: Hoare triple {9337#unseeded} assume !(0 == ~z_ev~0); {9337#unseeded} is VALID [2022-02-21 04:21:25,752 INFO L290 TraceCheckUtils]: 28: Hoare triple {9337#unseeded} assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; {9337#unseeded} is VALID [2022-02-21 04:21:25,753 INFO L290 TraceCheckUtils]: 29: Hoare triple {9337#unseeded} assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; {9337#unseeded} is VALID [2022-02-21 04:21:25,753 INFO L290 TraceCheckUtils]: 30: Hoare triple {9337#unseeded} is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; {9337#unseeded} is VALID [2022-02-21 04:21:25,753 INFO L290 TraceCheckUtils]: 31: Hoare triple {9337#unseeded} activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; {9337#unseeded} is VALID [2022-02-21 04:21:25,754 INFO L290 TraceCheckUtils]: 32: Hoare triple {9337#unseeded} assume !(0 != activate_threads_~tmp~1#1); {9337#unseeded} is VALID [2022-02-21 04:21:25,754 INFO L290 TraceCheckUtils]: 33: Hoare triple {9337#unseeded} assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; {9337#unseeded} is VALID [2022-02-21 04:21:25,754 INFO L290 TraceCheckUtils]: 34: Hoare triple {9337#unseeded} assume 1 == ~b0_ev~0;~b0_ev~0 := 2; {9337#unseeded} is VALID [2022-02-21 04:21:25,754 INFO L290 TraceCheckUtils]: 35: Hoare triple {9337#unseeded} assume !(1 == ~b1_ev~0); {9337#unseeded} is VALID [2022-02-21 04:21:25,754 INFO L290 TraceCheckUtils]: 36: Hoare triple {9337#unseeded} assume !(1 == ~d0_ev~0); {9337#unseeded} is VALID [2022-02-21 04:21:25,755 INFO L290 TraceCheckUtils]: 37: Hoare triple {9337#unseeded} assume 1 == ~d1_ev~0;~d1_ev~0 := 2; {9337#unseeded} is VALID [2022-02-21 04:21:25,755 INFO L290 TraceCheckUtils]: 38: Hoare triple {9337#unseeded} assume !(1 == ~z_ev~0); {9337#unseeded} is VALID [2022-02-21 04:21:25,755 INFO L290 TraceCheckUtils]: 39: Hoare triple {9337#unseeded} assume { :end_inline_reset_delta_events } true; {9337#unseeded} is VALID [2022-02-21 04:21:25,755 INFO L290 TraceCheckUtils]: 40: Hoare triple {9337#unseeded} assume !false; {9337#unseeded} is VALID [2022-02-21 04:21:25,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:25,766 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:21:25,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:25,773 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:21:25,943 INFO L290 TraceCheckUtils]: 0: Hoare triple {9340#(>= oldRank0 (+ (* (- 1) ~d0_ev~0) 1))} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1; {9340#(>= oldRank0 (+ (* (- 1) ~d0_ev~0) 1))} is VALID [2022-02-21 04:21:25,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {9340#(>= oldRank0 (+ (* (- 1) ~d0_ev~0) 1))} assume !false; {9340#(>= oldRank0 (+ (* (- 1) ~d0_ev~0) 1))} is VALID [2022-02-21 04:21:25,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {9340#(>= oldRank0 (+ (* (- 1) ~d0_ev~0) 1))} assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; {9340#(>= oldRank0 (+ (* (- 1) ~d0_ev~0) 1))} is VALID [2022-02-21 04:21:25,944 INFO L290 TraceCheckUtils]: 3: Hoare triple {9340#(>= oldRank0 (+ (* (- 1) ~d0_ev~0) 1))} assume !(0 == ~comp_m1_st~0);exists_runnable_thread_~__retres1~1#1 := 0; {9340#(>= oldRank0 (+ (* (- 1) ~d0_ev~0) 1))} is VALID [2022-02-21 04:21:25,945 INFO L290 TraceCheckUtils]: 4: Hoare triple {9340#(>= oldRank0 (+ (* (- 1) ~d0_ev~0) 1))} exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; {9340#(>= oldRank0 (+ (* (- 1) ~d0_ev~0) 1))} is VALID [2022-02-21 04:21:25,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {9340#(>= oldRank0 (+ (* (- 1) ~d0_ev~0) 1))} eval_#t~ret4#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___0~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; {9340#(>= oldRank0 (+ (* (- 1) ~d0_ev~0) 1))} is VALID [2022-02-21 04:21:25,945 INFO L290 TraceCheckUtils]: 6: Hoare triple {9340#(>= oldRank0 (+ (* (- 1) ~d0_ev~0) 1))} assume !(0 != eval_~tmp___0~0#1); {9340#(>= oldRank0 (+ (* (- 1) ~d0_ev~0) 1))} is VALID [2022-02-21 04:21:25,945 INFO L290 TraceCheckUtils]: 7: Hoare triple {9340#(>= oldRank0 (+ (* (- 1) ~d0_ev~0) 1))} assume { :end_inline_eval } true;start_simulation_~kernel_st~0#1 := 2;assume { :begin_inline_update_channels } true; {9340#(>= oldRank0 (+ (* (- 1) ~d0_ev~0) 1))} is VALID [2022-02-21 04:21:25,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {9340#(>= oldRank0 (+ (* (- 1) ~d0_ev~0) 1))} assume !(1 == ~b0_req_up~0); {9340#(>= oldRank0 (+ (* (- 1) ~d0_ev~0) 1))} is VALID [2022-02-21 04:21:25,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {9340#(>= oldRank0 (+ (* (- 1) ~d0_ev~0) 1))} assume !(1 == ~b1_req_up~0); {9340#(>= oldRank0 (+ (* (- 1) ~d0_ev~0) 1))} is VALID [2022-02-21 04:21:25,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {9340#(>= oldRank0 (+ (* (- 1) ~d0_ev~0) 1))} assume !(1 == ~d0_req_up~0); {9340#(>= oldRank0 (+ (* (- 1) ~d0_ev~0) 1))} is VALID [2022-02-21 04:21:25,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {9340#(>= oldRank0 (+ (* (- 1) ~d0_ev~0) 1))} assume !(1 == ~d1_req_up~0); {9340#(>= oldRank0 (+ (* (- 1) ~d0_ev~0) 1))} is VALID [2022-02-21 04:21:25,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {9340#(>= oldRank0 (+ (* (- 1) ~d0_ev~0) 1))} assume !(1 == ~z_req_up~0); {9340#(>= oldRank0 (+ (* (- 1) ~d0_ev~0) 1))} is VALID [2022-02-21 04:21:25,947 INFO L290 TraceCheckUtils]: 13: Hoare triple {9340#(>= oldRank0 (+ (* (- 1) ~d0_ev~0) 1))} assume { :end_inline_update_channels } true;start_simulation_~kernel_st~0#1 := 3;assume { :begin_inline_fire_delta_events } true; {9340#(>= oldRank0 (+ (* (- 1) ~d0_ev~0) 1))} is VALID [2022-02-21 04:21:25,948 INFO L290 TraceCheckUtils]: 14: Hoare triple {9340#(>= oldRank0 (+ (* (- 1) ~d0_ev~0) 1))} assume !(0 == ~b0_ev~0); {9340#(>= oldRank0 (+ (* (- 1) ~d0_ev~0) 1))} is VALID [2022-02-21 04:21:25,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {9340#(>= oldRank0 (+ (* (- 1) ~d0_ev~0) 1))} assume 0 == ~b1_ev~0;~b1_ev~0 := 1; {9340#(>= oldRank0 (+ (* (- 1) ~d0_ev~0) 1))} is VALID [2022-02-21 04:21:25,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {9340#(>= oldRank0 (+ (* (- 1) ~d0_ev~0) 1))} assume 0 == ~d0_ev~0;~d0_ev~0 := 1; {9523#(<= 1 oldRank0)} is VALID [2022-02-21 04:21:25,949 INFO L290 TraceCheckUtils]: 17: Hoare triple {9523#(<= 1 oldRank0)} assume !(0 == ~d1_ev~0); {9523#(<= 1 oldRank0)} is VALID [2022-02-21 04:21:25,949 INFO L290 TraceCheckUtils]: 18: Hoare triple {9523#(<= 1 oldRank0)} assume 0 == ~z_ev~0;~z_ev~0 := 1; {9523#(<= 1 oldRank0)} is VALID [2022-02-21 04:21:25,949 INFO L290 TraceCheckUtils]: 19: Hoare triple {9523#(<= 1 oldRank0)} assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; {9523#(<= 1 oldRank0)} is VALID [2022-02-21 04:21:25,949 INFO L290 TraceCheckUtils]: 20: Hoare triple {9523#(<= 1 oldRank0)} assume !(1 == ~b0_ev~0); {9523#(<= 1 oldRank0)} is VALID [2022-02-21 04:21:25,950 INFO L290 TraceCheckUtils]: 21: Hoare triple {9523#(<= 1 oldRank0)} assume 1 == ~b1_ev~0;is_method1_triggered_~__retres1~0#1 := 1; {9523#(<= 1 oldRank0)} is VALID [2022-02-21 04:21:25,950 INFO L290 TraceCheckUtils]: 22: Hoare triple {9523#(<= 1 oldRank0)} is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; {9523#(<= 1 oldRank0)} is VALID [2022-02-21 04:21:25,950 INFO L290 TraceCheckUtils]: 23: Hoare triple {9523#(<= 1 oldRank0)} activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; {9523#(<= 1 oldRank0)} is VALID [2022-02-21 04:21:25,951 INFO L290 TraceCheckUtils]: 24: Hoare triple {9523#(<= 1 oldRank0)} assume 0 != activate_threads_~tmp~1#1;~comp_m1_st~0 := 0; {9523#(<= 1 oldRank0)} is VALID [2022-02-21 04:21:25,951 INFO L290 TraceCheckUtils]: 25: Hoare triple {9523#(<= 1 oldRank0)} assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; {9523#(<= 1 oldRank0)} is VALID [2022-02-21 04:21:25,951 INFO L290 TraceCheckUtils]: 26: Hoare triple {9523#(<= 1 oldRank0)} assume !(1 == ~b0_ev~0); {9523#(<= 1 oldRank0)} is VALID [2022-02-21 04:21:25,951 INFO L290 TraceCheckUtils]: 27: Hoare triple {9523#(<= 1 oldRank0)} assume 1 == ~b1_ev~0;~b1_ev~0 := 2; {9523#(<= 1 oldRank0)} is VALID [2022-02-21 04:21:25,952 INFO L290 TraceCheckUtils]: 28: Hoare triple {9523#(<= 1 oldRank0)} assume 1 == ~d0_ev~0;~d0_ev~0 := 2; {9560#(and (<= 2 ~d0_ev~0) (<= 1 oldRank0))} is VALID [2022-02-21 04:21:25,952 INFO L290 TraceCheckUtils]: 29: Hoare triple {9560#(and (<= 2 ~d0_ev~0) (<= 1 oldRank0))} assume !(1 == ~d1_ev~0); {9560#(and (<= 2 ~d0_ev~0) (<= 1 oldRank0))} is VALID [2022-02-21 04:21:25,952 INFO L290 TraceCheckUtils]: 30: Hoare triple {9560#(and (<= 2 ~d0_ev~0) (<= 1 oldRank0))} assume 1 == ~z_ev~0;~z_ev~0 := 2; {9560#(and (<= 2 ~d0_ev~0) (<= 1 oldRank0))} is VALID [2022-02-21 04:21:25,953 INFO L290 TraceCheckUtils]: 31: Hoare triple {9560#(and (<= 2 ~d0_ev~0) (<= 1 oldRank0))} assume { :end_inline_reset_delta_events } true;assume { :begin_inline_stop_simulation } true;havoc stop_simulation_#res#1;havoc stop_simulation_#t~ret7#1, stop_simulation_~tmp~2#1, stop_simulation_~__retres2~0#1;havoc stop_simulation_~tmp~2#1;havoc stop_simulation_~__retres2~0#1;assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; {9560#(and (<= 2 ~d0_ev~0) (<= 1 oldRank0))} is VALID [2022-02-21 04:21:25,953 INFO L290 TraceCheckUtils]: 32: Hoare triple {9560#(and (<= 2 ~d0_ev~0) (<= 1 oldRank0))} assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; {9560#(and (<= 2 ~d0_ev~0) (<= 1 oldRank0))} is VALID [2022-02-21 04:21:25,953 INFO L290 TraceCheckUtils]: 33: Hoare triple {9560#(and (<= 2 ~d0_ev~0) (<= 1 oldRank0))} exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; {9560#(and (<= 2 ~d0_ev~0) (<= 1 oldRank0))} is VALID [2022-02-21 04:21:25,954 INFO L290 TraceCheckUtils]: 34: Hoare triple {9560#(and (<= 2 ~d0_ev~0) (<= 1 oldRank0))} stop_simulation_#t~ret7#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;stop_simulation_~tmp~2#1 := stop_simulation_#t~ret7#1;havoc stop_simulation_#t~ret7#1; {9560#(and (<= 2 ~d0_ev~0) (<= 1 oldRank0))} is VALID [2022-02-21 04:21:25,954 INFO L290 TraceCheckUtils]: 35: Hoare triple {9560#(and (<= 2 ~d0_ev~0) (<= 1 oldRank0))} assume 0 != stop_simulation_~tmp~2#1;stop_simulation_~__retres2~0#1 := 0; {9560#(and (<= 2 ~d0_ev~0) (<= 1 oldRank0))} is VALID [2022-02-21 04:21:25,954 INFO L290 TraceCheckUtils]: 36: Hoare triple {9560#(and (<= 2 ~d0_ev~0) (<= 1 oldRank0))} stop_simulation_#res#1 := stop_simulation_~__retres2~0#1; {9560#(and (<= 2 ~d0_ev~0) (<= 1 oldRank0))} is VALID [2022-02-21 04:21:25,955 INFO L290 TraceCheckUtils]: 37: Hoare triple {9560#(and (<= 2 ~d0_ev~0) (<= 1 oldRank0))} start_simulation_#t~ret8#1 := stop_simulation_#res#1;assume { :end_inline_stop_simulation } true;start_simulation_~tmp~3#1 := start_simulation_#t~ret8#1;havoc start_simulation_#t~ret8#1; {9560#(and (<= 2 ~d0_ev~0) (<= 1 oldRank0))} is VALID [2022-02-21 04:21:25,955 INFO L290 TraceCheckUtils]: 38: Hoare triple {9560#(and (<= 2 ~d0_ev~0) (<= 1 oldRank0))} assume !(0 != start_simulation_~tmp~3#1); {9560#(and (<= 2 ~d0_ev~0) (<= 1 oldRank0))} is VALID [2022-02-21 04:21:25,956 INFO L290 TraceCheckUtils]: 39: Hoare triple {9560#(and (<= 2 ~d0_ev~0) (<= 1 oldRank0))} assume !false; {9350#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 1) ~d0_ev~0) 1))))} is VALID [2022-02-21 04:21:25,956 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:21:25,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:25,975 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:21:25,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 41 letters. Loop has 40 letters. [2022-02-21 04:21:25,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:25,976 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:21:25,976 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 303 states and 459 transitions. cyclomatic complexity: 159 Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:26,167 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 303 states and 459 transitions. cyclomatic complexity: 159. Second operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 810 states and 1251 transitions. Complement of second has 5 states. [2022-02-21 04:21:26,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 04:21:26,167 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:21:26,167 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 303 states and 459 transitions. cyclomatic complexity: 159 [2022-02-21 04:21:26,167 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:21:26,168 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:21:26,168 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:26,169 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:21:26,169 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:21:26,169 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:21:26,169 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 810 states and 1251 transitions. [2022-02-21 04:21:26,171 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 318 [2022-02-21 04:21:26,171 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:21:26,172 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:21:26,172 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 303 states and 459 transitions. cyclomatic complexity: 159 [2022-02-21 04:21:26,202 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:21:26,223 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 159 examples of accepted words. [2022-02-21 04:21:26,224 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:26,225 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:21:26,225 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:21:26,225 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 810 states and 1251 transitions. cyclomatic complexity: 450 [2022-02-21 04:21:26,265 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 318 examples of accepted words. [2022-02-21 04:21:26,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 41 letters. Loop has 40 letters. [2022-02-21 04:21:26,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 41 letters. Loop has 40 letters. [2022-02-21 04:21:26,266 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,266 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 41 letters. Loop has 40 letters. [2022-02-21 04:21:26,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:21:26,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:21:26,267 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,267 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:21:26,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 43 letters. Loop has 7 letters. [2022-02-21 04:21:26,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 43 letters. Loop has 7 letters. [2022-02-21 04:21:26,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 43 letters. Loop has 7 letters. [2022-02-21 04:21:26,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,268 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 810 letters. Loop has 810 letters. [2022-02-21 04:21:26,268 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 810 letters. Loop has 810 letters. [2022-02-21 04:21:26,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 810 letters. Loop has 810 letters. [2022-02-21 04:21:26,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 303 letters. Loop has 303 letters. [2022-02-21 04:21:26,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 303 letters. Loop has 303 letters. [2022-02-21 04:21:26,269 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,269 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 303 letters. Loop has 303 letters. [2022-02-21 04:21:26,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:21:26,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:21:26,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:21:26,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 69 letters. Loop has 40 letters. [2022-02-21 04:21:26,270 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,270 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 40 letters. [2022-02-21 04:21:26,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 69 letters. Loop has 40 letters. [2022-02-21 04:21:26,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 68 letters. Loop has 39 letters. [2022-02-21 04:21:26,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,271 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 39 letters. [2022-02-21 04:21:26,271 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 68 letters. Loop has 39 letters. [2022-02-21 04:21:26,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 68 letters. Loop has 40 letters. [2022-02-21 04:21:26,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 40 letters. [2022-02-21 04:21:26,272 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,272 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 68 letters. Loop has 40 letters. [2022-02-21 04:21:26,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 67 letters. Loop has 39 letters. [2022-02-21 04:21:26,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 39 letters. [2022-02-21 04:21:26,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 67 letters. Loop has 39 letters. [2022-02-21 04:21:26,273 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,273 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 67 letters. Loop has 40 letters. [2022-02-21 04:21:26,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 40 letters. [2022-02-21 04:21:26,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 67 letters. Loop has 40 letters. [2022-02-21 04:21:26,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 66 letters. Loop has 39 letters. [2022-02-21 04:21:26,274 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,274 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 39 letters. [2022-02-21 04:21:26,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 66 letters. Loop has 39 letters. [2022-02-21 04:21:26,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 66 letters. Loop has 40 letters. [2022-02-21 04:21:26,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 40 letters. [2022-02-21 04:21:26,275 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,275 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 66 letters. Loop has 40 letters. [2022-02-21 04:21:26,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 65 letters. Loop has 39 letters. [2022-02-21 04:21:26,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 39 letters. [2022-02-21 04:21:26,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,276 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 65 letters. Loop has 39 letters. [2022-02-21 04:21:26,276 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 65 letters. Loop has 40 letters. [2022-02-21 04:21:26,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 40 letters. [2022-02-21 04:21:26,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 65 letters. Loop has 40 letters. [2022-02-21 04:21:26,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,277 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 66 letters. Loop has 41 letters. [2022-02-21 04:21:26,277 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 41 letters. [2022-02-21 04:21:26,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 66 letters. Loop has 41 letters. [2022-02-21 04:21:26,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 67 letters. Loop has 42 letters. [2022-02-21 04:21:26,278 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,278 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 42 letters. [2022-02-21 04:21:26,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 67 letters. Loop has 42 letters. [2022-02-21 04:21:26,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 64 letters. Loop has 39 letters. [2022-02-21 04:21:26,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 39 letters. [2022-02-21 04:21:26,279 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,279 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 64 letters. Loop has 39 letters. [2022-02-21 04:21:26,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 64 letters. Loop has 39 letters. [2022-02-21 04:21:26,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 39 letters. [2022-02-21 04:21:26,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,280 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 64 letters. Loop has 39 letters. [2022-02-21 04:21:26,280 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 63 letters. Loop has 39 letters. [2022-02-21 04:21:26,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 39 letters. [2022-02-21 04:21:26,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 63 letters. Loop has 39 letters. [2022-02-21 04:21:26,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,281 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 90 letters. Loop has 39 letters. [2022-02-21 04:21:26,281 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 90 letters. Loop has 39 letters. [2022-02-21 04:21:26,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 90 letters. Loop has 39 letters. [2022-02-21 04:21:26,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 63 letters. Loop has 39 letters. [2022-02-21 04:21:26,282 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,282 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 39 letters. [2022-02-21 04:21:26,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 63 letters. Loop has 39 letters. [2022-02-21 04:21:26,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 62 letters. Loop has 39 letters. [2022-02-21 04:21:26,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 39 letters. [2022-02-21 04:21:26,283 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,283 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 62 letters. Loop has 39 letters. [2022-02-21 04:21:26,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 91 letters. Loop has 39 letters. [2022-02-21 04:21:26,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 91 letters. Loop has 39 letters. [2022-02-21 04:21:26,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,284 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 91 letters. Loop has 39 letters. [2022-02-21 04:21:26,284 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 62 letters. Loop has 39 letters. [2022-02-21 04:21:26,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 39 letters. [2022-02-21 04:21:26,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 62 letters. Loop has 39 letters. [2022-02-21 04:21:26,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,285 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 61 letters. Loop has 39 letters. [2022-02-21 04:21:26,285 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 39 letters. [2022-02-21 04:21:26,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 61 letters. Loop has 39 letters. [2022-02-21 04:21:26,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,286 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 61 letters. Loop has 39 letters. [2022-02-21 04:21:26,286 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 39 letters. [2022-02-21 04:21:26,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 61 letters. Loop has 39 letters. [2022-02-21 04:21:26,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 60 letters. Loop has 39 letters. [2022-02-21 04:21:26,287 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,287 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 39 letters. [2022-02-21 04:21:26,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 60 letters. Loop has 39 letters. [2022-02-21 04:21:26,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 60 letters. Loop has 39 letters. [2022-02-21 04:21:26,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 39 letters. [2022-02-21 04:21:26,288 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,288 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 60 letters. Loop has 39 letters. [2022-02-21 04:21:26,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 59 letters. Loop has 39 letters. [2022-02-21 04:21:26,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 39 letters. [2022-02-21 04:21:26,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 59 letters. Loop has 39 letters. [2022-02-21 04:21:26,289 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,289 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 59 letters. Loop has 39 letters. [2022-02-21 04:21:26,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 39 letters. [2022-02-21 04:21:26,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 59 letters. Loop has 39 letters. [2022-02-21 04:21:26,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 58 letters. Loop has 39 letters. [2022-02-21 04:21:26,290 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,290 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 39 letters. [2022-02-21 04:21:26,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 58 letters. Loop has 39 letters. [2022-02-21 04:21:26,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 57 letters. Loop has 39 letters. [2022-02-21 04:21:26,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 39 letters. [2022-02-21 04:21:26,291 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,291 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 57 letters. Loop has 39 letters. [2022-02-21 04:21:26,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 59 letters. Loop has 42 letters. [2022-02-21 04:21:26,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 42 letters. [2022-02-21 04:21:26,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 59 letters. Loop has 42 letters. [2022-02-21 04:21:26,292 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,292 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 56 letters. Loop has 39 letters. [2022-02-21 04:21:26,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 39 letters. [2022-02-21 04:21:26,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 56 letters. Loop has 39 letters. [2022-02-21 04:21:26,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 57 letters. Loop has 42 letters. [2022-02-21 04:21:26,293 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,293 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 42 letters. [2022-02-21 04:21:26,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 57 letters. Loop has 42 letters. [2022-02-21 04:21:26,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 58 letters. Loop has 42 letters. [2022-02-21 04:21:26,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 42 letters. [2022-02-21 04:21:26,294 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,294 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 58 letters. Loop has 42 letters. [2022-02-21 04:21:26,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 58 letters. Loop has 42 letters. [2022-02-21 04:21:26,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 42 letters. [2022-02-21 04:21:26,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 58 letters. Loop has 42 letters. [2022-02-21 04:21:26,295 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,295 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 55 letters. Loop has 42 letters. [2022-02-21 04:21:26,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 42 letters. [2022-02-21 04:21:26,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 55 letters. Loop has 42 letters. [2022-02-21 04:21:26,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 55 letters. Loop has 39 letters. [2022-02-21 04:21:26,296 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,296 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 39 letters. [2022-02-21 04:21:26,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 55 letters. Loop has 39 letters. [2022-02-21 04:21:26,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 56 letters. Loop has 42 letters. [2022-02-21 04:21:26,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 42 letters. [2022-02-21 04:21:26,297 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,297 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 56 letters. Loop has 42 letters. [2022-02-21 04:21:26,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 57 letters. Loop has 42 letters. [2022-02-21 04:21:26,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 42 letters. [2022-02-21 04:21:26,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,298 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 57 letters. Loop has 42 letters. [2022-02-21 04:21:26,298 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 55 letters. Loop has 42 letters. [2022-02-21 04:21:26,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 42 letters. [2022-02-21 04:21:26,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 55 letters. Loop has 42 letters. [2022-02-21 04:21:26,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,299 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 56 letters. Loop has 42 letters. [2022-02-21 04:21:26,299 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 42 letters. [2022-02-21 04:21:26,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 56 letters. Loop has 42 letters. [2022-02-21 04:21:26,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 92 letters. Loop has 42 letters. [2022-02-21 04:21:26,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,300 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 92 letters. Loop has 42 letters. [2022-02-21 04:21:26,300 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 92 letters. Loop has 42 letters. [2022-02-21 04:21:26,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 89 letters. Loop has 7 letters. [2022-02-21 04:21:26,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 89 letters. Loop has 7 letters. [2022-02-21 04:21:26,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 89 letters. Loop has 7 letters. [2022-02-21 04:21:26,301 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,301 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 90 letters. Loop has 7 letters. [2022-02-21 04:21:26,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 90 letters. Loop has 7 letters. [2022-02-21 04:21:26,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 90 letters. Loop has 7 letters. [2022-02-21 04:21:26,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 51 letters. Loop has 42 letters. [2022-02-21 04:21:26,302 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,302 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 42 letters. [2022-02-21 04:21:26,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 51 letters. Loop has 42 letters. [2022-02-21 04:21:26,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 88 letters. Loop has 7 letters. [2022-02-21 04:21:26,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 88 letters. Loop has 7 letters. [2022-02-21 04:21:26,303 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,303 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 88 letters. Loop has 7 letters. [2022-02-21 04:21:26,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 87 letters. Loop has 7 letters. [2022-02-21 04:21:26,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 87 letters. Loop has 7 letters. [2022-02-21 04:21:26,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 87 letters. Loop has 7 letters. [2022-02-21 04:21:26,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,304 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 86 letters. Loop has 7 letters. [2022-02-21 04:21:26,304 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 86 letters. Loop has 7 letters. [2022-02-21 04:21:26,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 86 letters. Loop has 7 letters. [2022-02-21 04:21:26,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 87 letters. Loop has 7 letters. [2022-02-21 04:21:26,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 87 letters. Loop has 7 letters. [2022-02-21 04:21:26,305 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,305 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 87 letters. Loop has 7 letters. [2022-02-21 04:21:26,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 85 letters. Loop has 7 letters. [2022-02-21 04:21:26,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 85 letters. Loop has 7 letters. [2022-02-21 04:21:26,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 85 letters. Loop has 7 letters. [2022-02-21 04:21:26,306 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,306 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 84 letters. Loop has 7 letters. [2022-02-21 04:21:26,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 84 letters. Loop has 7 letters. [2022-02-21 04:21:26,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 84 letters. Loop has 7 letters. [2022-02-21 04:21:26,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 91 letters. Loop has 8 letters. [2022-02-21 04:21:26,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,307 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 91 letters. Loop has 8 letters. [2022-02-21 04:21:26,307 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 91 letters. Loop has 8 letters. [2022-02-21 04:21:26,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 83 letters. Loop has 39 letters. [2022-02-21 04:21:26,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 83 letters. Loop has 39 letters. [2022-02-21 04:21:26,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,308 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 83 letters. Loop has 39 letters. [2022-02-21 04:21:26,308 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 89 letters. Loop has 7 letters. [2022-02-21 04:21:26,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 89 letters. Loop has 7 letters. [2022-02-21 04:21:26,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 89 letters. Loop has 7 letters. [2022-02-21 04:21:26,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 88 letters. Loop has 7 letters. [2022-02-21 04:21:26,309 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,309 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 88 letters. Loop has 7 letters. [2022-02-21 04:21:26,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 88 letters. Loop has 7 letters. [2022-02-21 04:21:26,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 82 letters. Loop has 39 letters. [2022-02-21 04:21:26,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 82 letters. Loop has 39 letters. [2022-02-21 04:21:26,310 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,310 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 82 letters. Loop has 39 letters. [2022-02-21 04:21:26,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 81 letters. Loop has 39 letters. [2022-02-21 04:21:26,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 81 letters. Loop has 39 letters. [2022-02-21 04:21:26,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 81 letters. Loop has 39 letters. [2022-02-21 04:21:26,311 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,311 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 80 letters. Loop has 39 letters. [2022-02-21 04:21:26,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 80 letters. Loop has 39 letters. [2022-02-21 04:21:26,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 80 letters. Loop has 39 letters. [2022-02-21 04:21:26,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,312 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 79 letters. Loop has 39 letters. [2022-02-21 04:21:26,312 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,313 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 79 letters. Loop has 39 letters. [2022-02-21 04:21:26,320 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 79 letters. Loop has 39 letters. [2022-02-21 04:21:26,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 78 letters. Loop has 39 letters. [2022-02-21 04:21:26,321 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,321 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 78 letters. Loop has 39 letters. [2022-02-21 04:21:26,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 78 letters. Loop has 39 letters. [2022-02-21 04:21:26,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 77 letters. Loop has 39 letters. [2022-02-21 04:21:26,322 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,322 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 77 letters. Loop has 39 letters. [2022-02-21 04:21:26,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 77 letters. Loop has 39 letters. [2022-02-21 04:21:26,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 76 letters. Loop has 39 letters. [2022-02-21 04:21:26,323 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,323 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 76 letters. Loop has 39 letters. [2022-02-21 04:21:26,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 76 letters. Loop has 39 letters. [2022-02-21 04:21:26,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 52 letters. Loop has 42 letters. [2022-02-21 04:21:26,324 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,324 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 42 letters. [2022-02-21 04:21:26,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 52 letters. Loop has 42 letters. [2022-02-21 04:21:26,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 96 letters. Loop has 16 letters. [2022-02-21 04:21:26,325 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,325 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 96 letters. Loop has 16 letters. [2022-02-21 04:21:26,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 96 letters. Loop has 16 letters. [2022-02-21 04:21:26,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 75 letters. Loop has 39 letters. [2022-02-21 04:21:26,326 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,326 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 75 letters. Loop has 39 letters. [2022-02-21 04:21:26,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 75 letters. Loop has 39 letters. [2022-02-21 04:21:26,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 53 letters. Loop has 39 letters. [2022-02-21 04:21:26,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,327 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 39 letters. [2022-02-21 04:21:26,327 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 53 letters. Loop has 39 letters. [2022-02-21 04:21:26,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 96 letters. Loop has 15 letters. [2022-02-21 04:21:26,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,328 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 96 letters. Loop has 15 letters. [2022-02-21 04:21:26,328 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 96 letters. Loop has 15 letters. [2022-02-21 04:21:26,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 74 letters. Loop has 39 letters. [2022-02-21 04:21:26,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 39 letters. [2022-02-21 04:21:26,329 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,329 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 74 letters. Loop has 39 letters. [2022-02-21 04:21:26,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 98 letters. Loop has 15 letters. [2022-02-21 04:21:26,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 98 letters. Loop has 15 letters. [2022-02-21 04:21:26,330 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,330 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 98 letters. Loop has 15 letters. [2022-02-21 04:21:26,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 73 letters. Loop has 39 letters. [2022-02-21 04:21:26,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 39 letters. [2022-02-21 04:21:26,331 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,331 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 73 letters. Loop has 39 letters. [2022-02-21 04:21:26,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 72 letters. Loop has 39 letters. [2022-02-21 04:21:26,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 39 letters. [2022-02-21 04:21:26,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 72 letters. Loop has 39 letters. [2022-02-21 04:21:26,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 94 letters. Loop has 15 letters. [2022-02-21 04:21:26,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 94 letters. Loop has 15 letters. [2022-02-21 04:21:26,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 94 letters. Loop has 15 letters. [2022-02-21 04:21:26,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 95 letters. Loop has 16 letters. [2022-02-21 04:21:26,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 95 letters. Loop has 16 letters. [2022-02-21 04:21:26,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 95 letters. Loop has 16 letters. [2022-02-21 04:21:26,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 71 letters. Loop has 39 letters. [2022-02-21 04:21:26,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 39 letters. [2022-02-21 04:21:26,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 71 letters. Loop has 39 letters. [2022-02-21 04:21:26,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 94 letters. Loop has 16 letters. [2022-02-21 04:21:26,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 94 letters. Loop has 16 letters. [2022-02-21 04:21:26,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 94 letters. Loop has 16 letters. [2022-02-21 04:21:26,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 97 letters. Loop has 16 letters. [2022-02-21 04:21:26,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 97 letters. Loop has 16 letters. [2022-02-21 04:21:26,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 97 letters. Loop has 16 letters. [2022-02-21 04:21:26,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 97 letters. Loop has 15 letters. [2022-02-21 04:21:26,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 97 letters. Loop has 15 letters. [2022-02-21 04:21:26,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 97 letters. Loop has 15 letters. [2022-02-21 04:21:26,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 54 letters. Loop has 42 letters. [2022-02-21 04:21:26,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 42 letters. [2022-02-21 04:21:26,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 54 letters. Loop has 42 letters. [2022-02-21 04:21:26,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 57 letters. Loop has 42 letters. [2022-02-21 04:21:26,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 42 letters. [2022-02-21 04:21:26,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 57 letters. Loop has 42 letters. [2022-02-21 04:21:26,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 92 letters. Loop has 15 letters. [2022-02-21 04:21:26,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 92 letters. Loop has 15 letters. [2022-02-21 04:21:26,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 92 letters. Loop has 15 letters. [2022-02-21 04:21:26,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 95 letters. Loop has 15 letters. [2022-02-21 04:21:26,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 95 letters. Loop has 15 letters. [2022-02-21 04:21:26,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 95 letters. Loop has 15 letters. [2022-02-21 04:21:26,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 93 letters. Loop has 16 letters. [2022-02-21 04:21:26,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 93 letters. Loop has 16 letters. [2022-02-21 04:21:26,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 93 letters. Loop has 16 letters. [2022-02-21 04:21:26,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 93 letters. Loop has 15 letters. [2022-02-21 04:21:26,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 93 letters. Loop has 15 letters. [2022-02-21 04:21:26,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 93 letters. Loop has 15 letters. [2022-02-21 04:21:26,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 56 letters. Loop has 42 letters. [2022-02-21 04:21:26,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 42 letters. [2022-02-21 04:21:26,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 56 letters. Loop has 42 letters. [2022-02-21 04:21:26,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 54 letters. Loop has 39 letters. [2022-02-21 04:21:26,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 39 letters. [2022-02-21 04:21:26,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 54 letters. Loop has 39 letters. [2022-02-21 04:21:26,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 69 letters. Loop has 39 letters. [2022-02-21 04:21:26,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 39 letters. [2022-02-21 04:21:26,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 69 letters. Loop has 39 letters. [2022-02-21 04:21:26,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 70 letters. Loop has 39 letters. [2022-02-21 04:21:26,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 39 letters. [2022-02-21 04:21:26,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 70 letters. Loop has 39 letters. [2022-02-21 04:21:26,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 70 letters. Loop has 40 letters. [2022-02-21 04:21:26,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 40 letters. [2022-02-21 04:21:26,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 70 letters. Loop has 40 letters. [2022-02-21 04:21:26,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 50 letters. Loop has 15 letters. [2022-02-21 04:21:26,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 15 letters. [2022-02-21 04:21:26,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 50 letters. Loop has 15 letters. [2022-02-21 04:21:26,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 74 letters. Loop has 40 letters. [2022-02-21 04:21:26,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 40 letters. [2022-02-21 04:21:26,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 74 letters. Loop has 40 letters. [2022-02-21 04:21:26,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 64 letters. Loop has 40 letters. [2022-02-21 04:21:26,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 40 letters. [2022-02-21 04:21:26,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 64 letters. Loop has 40 letters. [2022-02-21 04:21:26,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 71 letters. Loop has 40 letters. [2022-02-21 04:21:26,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 40 letters. [2022-02-21 04:21:26,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 71 letters. Loop has 40 letters. [2022-02-21 04:21:26,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 72 letters. Loop has 40 letters. [2022-02-21 04:21:26,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 40 letters. [2022-02-21 04:21:26,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 72 letters. Loop has 40 letters. [2022-02-21 04:21:26,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 56 letters. Loop has 43 letters. [2022-02-21 04:21:26,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 43 letters. [2022-02-21 04:21:26,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 56 letters. Loop has 43 letters. [2022-02-21 04:21:26,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 58 letters. Loop has 40 letters. [2022-02-21 04:21:26,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 40 letters. [2022-02-21 04:21:26,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 58 letters. Loop has 40 letters. [2022-02-21 04:21:26,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 55 letters. Loop has 43 letters. [2022-02-21 04:21:26,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 43 letters. [2022-02-21 04:21:26,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 55 letters. Loop has 43 letters. [2022-02-21 04:21:26,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 56 letters. Loop has 15 letters. [2022-02-21 04:21:26,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 15 letters. [2022-02-21 04:21:26,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 56 letters. Loop has 15 letters. [2022-02-21 04:21:26,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 53 letters. Loop has 43 letters. [2022-02-21 04:21:26,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 43 letters. [2022-02-21 04:21:26,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 53 letters. Loop has 43 letters. [2022-02-21 04:21:26,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 46 letters. Loop has 7 letters. [2022-02-21 04:21:26,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 46 letters. Loop has 7 letters. [2022-02-21 04:21:26,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 46 letters. Loop has 7 letters. [2022-02-21 04:21:26,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 50 letters. Loop has 40 letters. [2022-02-21 04:21:26,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 40 letters. [2022-02-21 04:21:26,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 50 letters. Loop has 40 letters. [2022-02-21 04:21:26,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 47 letters. Loop has 7 letters. [2022-02-21 04:21:26,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 47 letters. Loop has 7 letters. [2022-02-21 04:21:26,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 47 letters. Loop has 7 letters. [2022-02-21 04:21:26,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 53 letters. Loop has 43 letters. [2022-02-21 04:21:26,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 43 letters. [2022-02-21 04:21:26,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 53 letters. Loop has 43 letters. [2022-02-21 04:21:26,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 52 letters. Loop has 43 letters. [2022-02-21 04:21:26,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 43 letters. [2022-02-21 04:21:26,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 52 letters. Loop has 43 letters. [2022-02-21 04:21:26,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 49 letters. Loop has 40 letters. [2022-02-21 04:21:26,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 49 letters. Loop has 40 letters. [2022-02-21 04:21:26,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 49 letters. Loop has 40 letters. [2022-02-21 04:21:26,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 52 letters. Loop has 40 letters. [2022-02-21 04:21:26,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 40 letters. [2022-02-21 04:21:26,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 52 letters. Loop has 40 letters. [2022-02-21 04:21:26,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 50 letters. Loop has 43 letters. [2022-02-21 04:21:26,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 43 letters. [2022-02-21 04:21:26,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 50 letters. Loop has 43 letters. [2022-02-21 04:21:26,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 53 letters. Loop has 40 letters. [2022-02-21 04:21:26,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 40 letters. [2022-02-21 04:21:26,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 53 letters. Loop has 40 letters. [2022-02-21 04:21:26,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 51 letters. Loop has 43 letters. [2022-02-21 04:21:26,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 43 letters. [2022-02-21 04:21:26,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 51 letters. Loop has 43 letters. [2022-02-21 04:21:26,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 53 letters. Loop has 43 letters. [2022-02-21 04:21:26,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 43 letters. [2022-02-21 04:21:26,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 53 letters. Loop has 43 letters. [2022-02-21 04:21:26,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 48 letters. Loop has 40 letters. [2022-02-21 04:21:26,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 40 letters. [2022-02-21 04:21:26,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 48 letters. Loop has 40 letters. [2022-02-21 04:21:26,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 47 letters. Loop has 7 letters. [2022-02-21 04:21:26,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 47 letters. Loop has 7 letters. [2022-02-21 04:21:26,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 47 letters. Loop has 7 letters. [2022-02-21 04:21:26,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 46 letters. Loop has 7 letters. [2022-02-21 04:21:26,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 46 letters. Loop has 7 letters. [2022-02-21 04:21:26,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 46 letters. Loop has 7 letters. [2022-02-21 04:21:26,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 42 letters. Loop has 7 letters. [2022-02-21 04:21:26,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 7 letters. [2022-02-21 04:21:26,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 42 letters. Loop has 7 letters. [2022-02-21 04:21:26,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 63 letters. Loop has 41 letters. [2022-02-21 04:21:26,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 41 letters. [2022-02-21 04:21:26,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 63 letters. Loop has 41 letters. [2022-02-21 04:21:26,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 43 letters. Loop has 7 letters. [2022-02-21 04:21:26,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 43 letters. Loop has 7 letters. [2022-02-21 04:21:26,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 43 letters. Loop has 7 letters. [2022-02-21 04:21:26,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 65 letters. Loop has 40 letters. [2022-02-21 04:21:26,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 40 letters. [2022-02-21 04:21:26,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 65 letters. Loop has 40 letters. [2022-02-21 04:21:26,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 66 letters. Loop has 40 letters. [2022-02-21 04:21:26,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 40 letters. [2022-02-21 04:21:26,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 66 letters. Loop has 40 letters. [2022-02-21 04:21:26,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 56 letters. Loop has 40 letters. [2022-02-21 04:21:26,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 40 letters. [2022-02-21 04:21:26,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 56 letters. Loop has 40 letters. [2022-02-21 04:21:26,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 57 letters. Loop has 40 letters. [2022-02-21 04:21:26,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 40 letters. [2022-02-21 04:21:26,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 57 letters. Loop has 40 letters. [2022-02-21 04:21:26,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 54 letters. Loop has 43 letters. [2022-02-21 04:21:26,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 43 letters. [2022-02-21 04:21:26,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 54 letters. Loop has 43 letters. [2022-02-21 04:21:26,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 59 letters. Loop has 40 letters. [2022-02-21 04:21:26,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 40 letters. [2022-02-21 04:21:26,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 59 letters. Loop has 40 letters. [2022-02-21 04:21:26,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 60 letters. Loop has 40 letters. [2022-02-21 04:21:26,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 40 letters. [2022-02-21 04:21:26,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 60 letters. Loop has 40 letters. [2022-02-21 04:21:26,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 55 letters. Loop has 15 letters. [2022-02-21 04:21:26,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 15 letters. [2022-02-21 04:21:26,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 55 letters. Loop has 15 letters. [2022-02-21 04:21:26,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 54 letters. Loop has 15 letters. [2022-02-21 04:21:26,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 15 letters. [2022-02-21 04:21:26,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 54 letters. Loop has 15 letters. [2022-02-21 04:21:26,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 55 letters. Loop has 16 letters. [2022-02-21 04:21:26,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 16 letters. [2022-02-21 04:21:26,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 55 letters. Loop has 16 letters. [2022-02-21 04:21:26,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 75 letters. Loop has 40 letters. [2022-02-21 04:21:26,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 75 letters. Loop has 40 letters. [2022-02-21 04:21:26,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 75 letters. Loop has 40 letters. [2022-02-21 04:21:26,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 73 letters. Loop has 40 letters. [2022-02-21 04:21:26,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 40 letters. [2022-02-21 04:21:26,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 73 letters. Loop has 40 letters. [2022-02-21 04:21:26,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 76 letters. Loop has 40 letters. [2022-02-21 04:21:26,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 76 letters. Loop has 40 letters. [2022-02-21 04:21:26,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 76 letters. Loop has 40 letters. [2022-02-21 04:21:26,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 78 letters. Loop has 40 letters. [2022-02-21 04:21:26,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 78 letters. Loop has 40 letters. [2022-02-21 04:21:26,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 78 letters. Loop has 40 letters. [2022-02-21 04:21:26,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 53 letters. Loop has 15 letters. [2022-02-21 04:21:26,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 15 letters. [2022-02-21 04:21:26,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 53 letters. Loop has 15 letters. [2022-02-21 04:21:26,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 54 letters. Loop has 16 letters. [2022-02-21 04:21:26,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 16 letters. [2022-02-21 04:21:26,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 54 letters. Loop has 16 letters. [2022-02-21 04:21:26,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 54 letters. Loop has 40 letters. [2022-02-21 04:21:26,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 40 letters. [2022-02-21 04:21:26,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 54 letters. Loop has 40 letters. [2022-02-21 04:21:26,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 55 letters. Loop has 40 letters. [2022-02-21 04:21:26,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 40 letters. [2022-02-21 04:21:26,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 55 letters. Loop has 40 letters. [2022-02-21 04:21:26,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 53 letters. Loop has 16 letters. [2022-02-21 04:21:26,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 16 letters. [2022-02-21 04:21:26,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 53 letters. Loop has 16 letters. [2022-02-21 04:21:26,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 52 letters. Loop has 15 letters. [2022-02-21 04:21:26,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 15 letters. [2022-02-21 04:21:26,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 52 letters. Loop has 15 letters. [2022-02-21 04:21:26,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 52 letters. Loop has 16 letters. [2022-02-21 04:21:26,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 16 letters. [2022-02-21 04:21:26,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 52 letters. Loop has 16 letters. [2022-02-21 04:21:26,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 51 letters. Loop has 15 letters. [2022-02-21 04:21:26,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 15 letters. [2022-02-21 04:21:26,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 51 letters. Loop has 15 letters. [2022-02-21 04:21:26,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 51 letters. Loop has 16 letters. [2022-02-21 04:21:26,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 16 letters. [2022-02-21 04:21:26,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 51 letters. Loop has 16 letters. [2022-02-21 04:21:26,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 70 letters. Loop has 40 letters. [2022-02-21 04:21:26,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 40 letters. [2022-02-21 04:21:26,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 70 letters. Loop has 40 letters. [2022-02-21 04:21:26,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 61 letters. Loop has 40 letters. [2022-02-21 04:21:26,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 40 letters. [2022-02-21 04:21:26,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 61 letters. Loop has 40 letters. [2022-02-21 04:21:26,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 69 letters. Loop has 40 letters. [2022-02-21 04:21:26,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 40 letters. [2022-02-21 04:21:26,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 69 letters. Loop has 40 letters. [2022-02-21 04:21:26,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 51 letters. Loop has 40 letters. [2022-02-21 04:21:26,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 40 letters. [2022-02-21 04:21:26,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 51 letters. Loop has 40 letters. [2022-02-21 04:21:26,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 52 letters. Loop has 43 letters. [2022-02-21 04:21:26,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 43 letters. [2022-02-21 04:21:26,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 52 letters. Loop has 43 letters. [2022-02-21 04:21:26,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 44 letters. Loop has 7 letters. [2022-02-21 04:21:26,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 44 letters. Loop has 7 letters. [2022-02-21 04:21:26,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 44 letters. Loop has 7 letters. [2022-02-21 04:21:26,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 45 letters. Loop has 7 letters. [2022-02-21 04:21:26,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 45 letters. Loop has 7 letters. [2022-02-21 04:21:26,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 45 letters. Loop has 7 letters. [2022-02-21 04:21:26,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 45 letters. Loop has 7 letters. [2022-02-21 04:21:26,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 45 letters. Loop has 7 letters. [2022-02-21 04:21:26,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 45 letters. Loop has 7 letters. [2022-02-21 04:21:26,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 68 letters. Loop has 40 letters. [2022-02-21 04:21:26,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 40 letters. [2022-02-21 04:21:26,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 68 letters. Loop has 40 letters. [2022-02-21 04:21:26,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 51 letters. Loop has 43 letters. [2022-02-21 04:21:26,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 43 letters. [2022-02-21 04:21:26,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 51 letters. Loop has 43 letters. [2022-02-21 04:21:26,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 52 letters. Loop has 43 letters. [2022-02-21 04:21:26,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 43 letters. [2022-02-21 04:21:26,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 52 letters. Loop has 43 letters. [2022-02-21 04:21:26,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 67 letters. Loop has 40 letters. [2022-02-21 04:21:26,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 40 letters. [2022-02-21 04:21:26,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 67 letters. Loop has 40 letters. [2022-02-21 04:21:26,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 77 letters. Loop has 40 letters. [2022-02-21 04:21:26,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 77 letters. Loop has 40 letters. [2022-02-21 04:21:26,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 77 letters. Loop has 40 letters. [2022-02-21 04:21:26,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 62 letters. Loop has 40 letters. [2022-02-21 04:21:26,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 40 letters. [2022-02-21 04:21:26,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 62 letters. Loop has 40 letters. [2022-02-21 04:21:26,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 48 letters. Loop has 7 letters. [2022-02-21 04:21:26,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 7 letters. [2022-02-21 04:21:26,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 48 letters. Loop has 7 letters. [2022-02-21 04:21:26,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 64 letters. Loop has 42 letters. [2022-02-21 04:21:26,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 42 letters. [2022-02-21 04:21:26,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 64 letters. Loop has 42 letters. [2022-02-21 04:21:26,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 63 letters. Loop has 40 letters. [2022-02-21 04:21:26,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 40 letters. [2022-02-21 04:21:26,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 63 letters. Loop has 40 letters. [2022-02-21 04:21:26,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 54 letters. Loop has 43 letters. [2022-02-21 04:21:26,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 43 letters. [2022-02-21 04:21:26,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 54 letters. Loop has 43 letters. [2022-02-21 04:21:26,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 68 letters. Loop has 40 letters. [2022-02-21 04:21:26,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 40 letters. [2022-02-21 04:21:26,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 68 letters. Loop has 40 letters. [2022-02-21 04:21:26,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 79 letters. Loop has 40 letters. [2022-02-21 04:21:26,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 79 letters. Loop has 40 letters. [2022-02-21 04:21:26,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 79 letters. Loop has 40 letters. [2022-02-21 04:21:26,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 41 letters. Loop has 40 letters. [2022-02-21 04:21:26,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 41 letters. Loop has 40 letters. [2022-02-21 04:21:26,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 41 letters. Loop has 40 letters. [2022-02-21 04:21:26,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 55 letters. Loop has 43 letters. [2022-02-21 04:21:26,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 43 letters. [2022-02-21 04:21:26,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 55 letters. Loop has 43 letters. [2022-02-21 04:21:26,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 54 letters. Loop has 43 letters. [2022-02-21 04:21:26,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 43 letters. [2022-02-21 04:21:26,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 54 letters. Loop has 43 letters. [2022-02-21 04:21:26,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:21:26,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:21:26,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:21:26,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:21:26,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:21:26,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:21:26,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 95 letters. Loop has 42 letters. [2022-02-21 04:21:26,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 95 letters. Loop has 42 letters. [2022-02-21 04:21:26,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 95 letters. Loop has 42 letters. [2022-02-21 04:21:26,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 81 letters. Loop has 39 letters. [2022-02-21 04:21:26,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 81 letters. Loop has 39 letters. [2022-02-21 04:21:26,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 81 letters. Loop has 39 letters. [2022-02-21 04:21:26,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 69 letters. Loop has 39 letters. [2022-02-21 04:21:26,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 39 letters. [2022-02-21 04:21:26,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 69 letters. Loop has 39 letters. [2022-02-21 04:21:26,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 69 letters. Loop has 40 letters. [2022-02-21 04:21:26,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 40 letters. [2022-02-21 04:21:26,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 69 letters. Loop has 40 letters. [2022-02-21 04:21:26,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 82 letters. Loop has 39 letters. [2022-02-21 04:21:26,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 82 letters. Loop has 39 letters. [2022-02-21 04:21:26,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 82 letters. Loop has 39 letters. [2022-02-21 04:21:26,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 69 letters. Loop has 41 letters. [2022-02-21 04:21:26,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 41 letters. [2022-02-21 04:21:26,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 69 letters. Loop has 41 letters. [2022-02-21 04:21:26,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 62 letters. Loop has 39 letters. [2022-02-21 04:21:26,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 39 letters. [2022-02-21 04:21:26,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 62 letters. Loop has 39 letters. [2022-02-21 04:21:26,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 62 letters. Loop has 39 letters. [2022-02-21 04:21:26,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 39 letters. [2022-02-21 04:21:26,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 62 letters. Loop has 39 letters. [2022-02-21 04:21:26,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 96 letters. Loop has 16 letters. [2022-02-21 04:21:26,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 96 letters. Loop has 16 letters. [2022-02-21 04:21:26,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 96 letters. Loop has 16 letters. [2022-02-21 04:21:26,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 83 letters. Loop has 39 letters. [2022-02-21 04:21:26,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 83 letters. Loop has 39 letters. [2022-02-21 04:21:26,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 83 letters. Loop has 39 letters. [2022-02-21 04:21:26,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 62 letters. Loop has 42 letters. [2022-02-21 04:21:26,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 42 letters. [2022-02-21 04:21:26,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 62 letters. Loop has 42 letters. [2022-02-21 04:21:26,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 96 letters. Loop has 15 letters. [2022-02-21 04:21:26,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 96 letters. Loop has 15 letters. [2022-02-21 04:21:26,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 96 letters. Loop has 15 letters. [2022-02-21 04:21:26,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 96 letters. Loop has 39 letters. [2022-02-21 04:21:26,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 96 letters. Loop has 39 letters. [2022-02-21 04:21:26,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 96 letters. Loop has 39 letters. [2022-02-21 04:21:26,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 96 letters. Loop has 42 letters. [2022-02-21 04:21:26,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 96 letters. Loop has 42 letters. [2022-02-21 04:21:26,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 96 letters. Loop has 42 letters. [2022-02-21 04:21:26,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 84 letters. Loop has 39 letters. [2022-02-21 04:21:26,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 84 letters. Loop has 39 letters. [2022-02-21 04:21:26,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 84 letters. Loop has 39 letters. [2022-02-21 04:21:26,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 56 letters. Loop has 42 letters. [2022-02-21 04:21:26,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 42 letters. [2022-02-21 04:21:26,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 56 letters. Loop has 42 letters. [2022-02-21 04:21:26,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 70 letters. Loop has 39 letters. [2022-02-21 04:21:26,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 39 letters. [2022-02-21 04:21:26,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 70 letters. Loop has 39 letters. [2022-02-21 04:21:26,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 85 letters. Loop has 39 letters. [2022-02-21 04:21:26,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 85 letters. Loop has 39 letters. [2022-02-21 04:21:26,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 85 letters. Loop has 39 letters. [2022-02-21 04:21:26,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 70 letters. Loop has 40 letters. [2022-02-21 04:21:26,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 40 letters. [2022-02-21 04:21:26,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 70 letters. Loop has 40 letters. [2022-02-21 04:21:26,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 70 letters. Loop has 42 letters. [2022-02-21 04:21:26,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 42 letters. [2022-02-21 04:21:26,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 70 letters. Loop has 42 letters. [2022-02-21 04:21:26,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 97 letters. Loop has 16 letters. [2022-02-21 04:21:26,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 97 letters. Loop has 16 letters. [2022-02-21 04:21:26,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 97 letters. Loop has 16 letters. [2022-02-21 04:21:26,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 97 letters. Loop has 15 letters. [2022-02-21 04:21:26,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 97 letters. Loop has 15 letters. [2022-02-21 04:21:26,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 97 letters. Loop has 15 letters. [2022-02-21 04:21:26,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 97 letters. Loop has 42 letters. [2022-02-21 04:21:26,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 97 letters. Loop has 42 letters. [2022-02-21 04:21:26,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 97 letters. Loop has 42 letters. [2022-02-21 04:21:26,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 86 letters. Loop has 39 letters. [2022-02-21 04:21:26,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 86 letters. Loop has 39 letters. [2022-02-21 04:21:26,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 86 letters. Loop has 39 letters. [2022-02-21 04:21:26,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 97 letters. Loop has 42 letters. [2022-02-21 04:21:26,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 97 letters. Loop has 42 letters. [2022-02-21 04:21:26,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 97 letters. Loop has 42 letters. [2022-02-21 04:21:26,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 63 letters. Loop has 39 letters. [2022-02-21 04:21:26,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 39 letters. [2022-02-21 04:21:26,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 63 letters. Loop has 39 letters. [2022-02-21 04:21:26,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 63 letters. Loop has 39 letters. [2022-02-21 04:21:26,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 39 letters. [2022-02-21 04:21:26,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 63 letters. Loop has 39 letters. [2022-02-21 04:21:26,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 71 letters. Loop has 39 letters. [2022-02-21 04:21:26,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 39 letters. [2022-02-21 04:21:26,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 71 letters. Loop has 39 letters. [2022-02-21 04:21:26,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 98 letters. Loop has 16 letters. [2022-02-21 04:21:26,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 98 letters. Loop has 16 letters. [2022-02-21 04:21:26,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 98 letters. Loop has 16 letters. [2022-02-21 04:21:26,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 87 letters. Loop has 7 letters. [2022-02-21 04:21:26,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 87 letters. Loop has 7 letters. [2022-02-21 04:21:26,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 87 letters. Loop has 7 letters. [2022-02-21 04:21:26,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 98 letters. Loop has 15 letters. [2022-02-21 04:21:26,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 98 letters. Loop has 15 letters. [2022-02-21 04:21:26,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 98 letters. Loop has 15 letters. [2022-02-21 04:21:26,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 71 letters. Loop has 40 letters. [2022-02-21 04:21:26,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 40 letters. [2022-02-21 04:21:26,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 71 letters. Loop has 40 letters. [2022-02-21 04:21:26,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 98 letters. Loop has 42 letters. [2022-02-21 04:21:26,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 98 letters. Loop has 42 letters. [2022-02-21 04:21:26,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 98 letters. Loop has 42 letters. [2022-02-21 04:21:26,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 99 letters. Loop has 15 letters. [2022-02-21 04:21:26,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 99 letters. Loop has 15 letters. [2022-02-21 04:21:26,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 99 letters. Loop has 15 letters. [2022-02-21 04:21:26,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 99 letters. Loop has 16 letters. [2022-02-21 04:21:26,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 99 letters. Loop has 16 letters. [2022-02-21 04:21:26,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 99 letters. Loop has 16 letters. [2022-02-21 04:21:26,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 100 letters. Loop has 15 letters. [2022-02-21 04:21:26,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 100 letters. Loop has 15 letters. [2022-02-21 04:21:26,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 100 letters. Loop has 15 letters. [2022-02-21 04:21:26,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 100 letters. Loop has 16 letters. [2022-02-21 04:21:26,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 100 letters. Loop has 16 letters. [2022-02-21 04:21:26,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 100 letters. Loop has 16 letters. [2022-02-21 04:21:26,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 101 letters. Loop has 15 letters. [2022-02-21 04:21:26,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 101 letters. Loop has 15 letters. [2022-02-21 04:21:26,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 101 letters. Loop has 15 letters. [2022-02-21 04:21:26,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 88 letters. Loop has 7 letters. [2022-02-21 04:21:26,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 88 letters. Loop has 7 letters. [2022-02-21 04:21:26,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 88 letters. Loop has 7 letters. [2022-02-21 04:21:26,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 57 letters. Loop has 42 letters. [2022-02-21 04:21:26,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 42 letters. [2022-02-21 04:21:26,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 57 letters. Loop has 42 letters. [2022-02-21 04:21:26,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 72 letters. Loop has 39 letters. [2022-02-21 04:21:26,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 39 letters. [2022-02-21 04:21:26,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 72 letters. Loop has 39 letters. [2022-02-21 04:21:26,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 64 letters. Loop has 39 letters. [2022-02-21 04:21:26,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 39 letters. [2022-02-21 04:21:26,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 64 letters. Loop has 39 letters. [2022-02-21 04:21:26,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 72 letters. Loop has 40 letters. [2022-02-21 04:21:26,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 40 letters. [2022-02-21 04:21:26,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 72 letters. Loop has 40 letters. [2022-02-21 04:21:26,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 64 letters. Loop has 39 letters. [2022-02-21 04:21:26,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 39 letters. [2022-02-21 04:21:26,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 64 letters. Loop has 39 letters. [2022-02-21 04:21:26,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 89 letters. Loop has 7 letters. [2022-02-21 04:21:26,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 89 letters. Loop has 7 letters. [2022-02-21 04:21:26,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 89 letters. Loop has 7 letters. [2022-02-21 04:21:26,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 73 letters. Loop has 39 letters. [2022-02-21 04:21:26,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 39 letters. [2022-02-21 04:21:26,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 73 letters. Loop has 39 letters. [2022-02-21 04:21:26,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 73 letters. Loop has 40 letters. [2022-02-21 04:21:26,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 40 letters. [2022-02-21 04:21:26,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 73 letters. Loop has 40 letters. [2022-02-21 04:21:26,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 90 letters. Loop has 7 letters. [2022-02-21 04:21:26,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 90 letters. Loop has 7 letters. [2022-02-21 04:21:26,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 90 letters. Loop has 7 letters. [2022-02-21 04:21:26,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 90 letters. Loop has 7 letters. [2022-02-21 04:21:26,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 90 letters. Loop has 7 letters. [2022-02-21 04:21:26,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 90 letters. Loop has 7 letters. [2022-02-21 04:21:26,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 65 letters. Loop has 39 letters. [2022-02-21 04:21:26,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 39 letters. [2022-02-21 04:21:26,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 65 letters. Loop has 39 letters. [2022-02-21 04:21:26,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 65 letters. Loop has 39 letters. [2022-02-21 04:21:26,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 39 letters. [2022-02-21 04:21:26,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 65 letters. Loop has 39 letters. [2022-02-21 04:21:26,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 58 letters. Loop has 39 letters. [2022-02-21 04:21:26,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 39 letters. [2022-02-21 04:21:26,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 58 letters. Loop has 39 letters. [2022-02-21 04:21:26,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 74 letters. Loop has 39 letters. [2022-02-21 04:21:26,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 39 letters. [2022-02-21 04:21:26,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 74 letters. Loop has 39 letters. [2022-02-21 04:21:26,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 91 letters. Loop has 7 letters. [2022-02-21 04:21:26,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 91 letters. Loop has 7 letters. [2022-02-21 04:21:26,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 91 letters. Loop has 7 letters. [2022-02-21 04:21:26,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 91 letters. Loop has 7 letters. [2022-02-21 04:21:26,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 91 letters. Loop has 7 letters. [2022-02-21 04:21:26,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 91 letters. Loop has 7 letters. [2022-02-21 04:21:26,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 75 letters. Loop has 39 letters. [2022-02-21 04:21:26,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 75 letters. Loop has 39 letters. [2022-02-21 04:21:26,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 75 letters. Loop has 39 letters. [2022-02-21 04:21:26,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 92 letters. Loop has 7 letters. [2022-02-21 04:21:26,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 92 letters. Loop has 7 letters. [2022-02-21 04:21:26,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 92 letters. Loop has 7 letters. [2022-02-21 04:21:26,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 66 letters. Loop has 39 letters. [2022-02-21 04:21:26,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 39 letters. [2022-02-21 04:21:26,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 66 letters. Loop has 39 letters. [2022-02-21 04:21:26,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 92 letters. Loop has 7 letters. [2022-02-21 04:21:26,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 92 letters. Loop has 7 letters. [2022-02-21 04:21:26,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 92 letters. Loop has 7 letters. [2022-02-21 04:21:26,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 66 letters. Loop has 39 letters. [2022-02-21 04:21:26,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 39 letters. [2022-02-21 04:21:26,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 66 letters. Loop has 39 letters. [2022-02-21 04:21:26,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 76 letters. Loop has 39 letters. [2022-02-21 04:21:26,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 76 letters. Loop has 39 letters. [2022-02-21 04:21:26,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 76 letters. Loop has 39 letters. [2022-02-21 04:21:26,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 59 letters. Loop has 39 letters. [2022-02-21 04:21:26,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 39 letters. [2022-02-21 04:21:26,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 59 letters. Loop has 39 letters. [2022-02-21 04:21:26,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 59 letters. Loop has 42 letters. [2022-02-21 04:21:26,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 42 letters. [2022-02-21 04:21:26,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 59 letters. Loop has 42 letters. [2022-02-21 04:21:26,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 93 letters. Loop has 7 letters. [2022-02-21 04:21:26,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 93 letters. Loop has 7 letters. [2022-02-21 04:21:26,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 93 letters. Loop has 7 letters. [2022-02-21 04:21:26,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 93 letters. Loop has 39 letters. [2022-02-21 04:21:26,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 93 letters. Loop has 39 letters. [2022-02-21 04:21:26,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 93 letters. Loop has 39 letters. [2022-02-21 04:21:26,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 77 letters. Loop has 39 letters. [2022-02-21 04:21:26,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 77 letters. Loop has 39 letters. [2022-02-21 04:21:26,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 77 letters. Loop has 39 letters. [2022-02-21 04:21:26,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 93 letters. Loop has 42 letters. [2022-02-21 04:21:26,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 93 letters. Loop has 42 letters. [2022-02-21 04:21:26,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 93 letters. Loop has 42 letters. [2022-02-21 04:21:26,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 67 letters. Loop has 39 letters. [2022-02-21 04:21:26,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 39 letters. [2022-02-21 04:21:26,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 67 letters. Loop has 39 letters. [2022-02-21 04:21:26,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 67 letters. Loop has 39 letters. [2022-02-21 04:21:26,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 39 letters. [2022-02-21 04:21:26,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 67 letters. Loop has 39 letters. [2022-02-21 04:21:26,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 60 letters. Loop has 39 letters. [2022-02-21 04:21:26,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 39 letters. [2022-02-21 04:21:26,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 60 letters. Loop has 39 letters. [2022-02-21 04:21:26,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 78 letters. Loop has 39 letters. [2022-02-21 04:21:26,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 78 letters. Loop has 39 letters. [2022-02-21 04:21:26,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 78 letters. Loop has 39 letters. [2022-02-21 04:21:26,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 60 letters. Loop has 42 letters. [2022-02-21 04:21:26,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 42 letters. [2022-02-21 04:21:26,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 60 letters. Loop has 42 letters. [2022-02-21 04:21:26,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 60 letters. Loop has 42 letters. [2022-02-21 04:21:26,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 42 letters. [2022-02-21 04:21:26,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 60 letters. Loop has 42 letters. [2022-02-21 04:21:26,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 94 letters. Loop has 8 letters. [2022-02-21 04:21:26,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 94 letters. Loop has 8 letters. [2022-02-21 04:21:26,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 94 letters. Loop has 8 letters. [2022-02-21 04:21:26,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 94 letters. Loop has 39 letters. [2022-02-21 04:21:26,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 94 letters. Loop has 39 letters. [2022-02-21 04:21:26,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 94 letters. Loop has 39 letters. [2022-02-21 04:21:26,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 79 letters. Loop has 39 letters. [2022-02-21 04:21:26,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 79 letters. Loop has 39 letters. [2022-02-21 04:21:26,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 79 letters. Loop has 39 letters. [2022-02-21 04:21:26,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 94 letters. Loop has 42 letters. [2022-02-21 04:21:26,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 94 letters. Loop has 42 letters. [2022-02-21 04:21:26,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 94 letters. Loop has 42 letters. [2022-02-21 04:21:26,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 68 letters. Loop has 39 letters. [2022-02-21 04:21:26,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 39 letters. [2022-02-21 04:21:26,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 68 letters. Loop has 39 letters. [2022-02-21 04:21:26,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 68 letters. Loop has 40 letters. [2022-02-21 04:21:26,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 40 letters. [2022-02-21 04:21:26,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 68 letters. Loop has 40 letters. [2022-02-21 04:21:26,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 61 letters. Loop has 39 letters. [2022-02-21 04:21:26,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 39 letters. [2022-02-21 04:21:26,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 61 letters. Loop has 39 letters. [2022-02-21 04:21:26,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 80 letters. Loop has 39 letters. [2022-02-21 04:21:26,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 80 letters. Loop has 39 letters. [2022-02-21 04:21:26,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 80 letters. Loop has 39 letters. [2022-02-21 04:21:26,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 61 letters. Loop has 42 letters. [2022-02-21 04:21:26,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 42 letters. [2022-02-21 04:21:26,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 61 letters. Loop has 42 letters. [2022-02-21 04:21:26,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 61 letters. Loop has 42 letters. [2022-02-21 04:21:26,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 42 letters. [2022-02-21 04:21:26,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 61 letters. Loop has 42 letters. [2022-02-21 04:21:26,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 95 letters. Loop has 15 letters. [2022-02-21 04:21:26,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 95 letters. Loop has 15 letters. [2022-02-21 04:21:26,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 95 letters. Loop has 15 letters. [2022-02-21 04:21:26,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 95 letters. Loop has 39 letters. [2022-02-21 04:21:26,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 95 letters. Loop has 39 letters. [2022-02-21 04:21:26,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 95 letters. Loop has 39 letters. [2022-02-21 04:21:26,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 95 letters. Loop has 16 letters. [2022-02-21 04:21:26,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 95 letters. Loop has 16 letters. [2022-02-21 04:21:26,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 95 letters. Loop has 16 letters. [2022-02-21 04:21:26,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 95 letters. Loop has 15 letters. [2022-02-21 04:21:26,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 95 letters. Loop has 15 letters. [2022-02-21 04:21:26,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 95 letters. Loop has 15 letters. [2022-02-21 04:21:26,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 81 letters. Loop has 40 letters. [2022-02-21 04:21:26,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 81 letters. Loop has 40 letters. [2022-02-21 04:21:26,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 81 letters. Loop has 40 letters. [2022-02-21 04:21:26,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 95 letters. Loop has 43 letters. [2022-02-21 04:21:26,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 95 letters. Loop has 43 letters. [2022-02-21 04:21:26,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 95 letters. Loop has 43 letters. [2022-02-21 04:21:26,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 69 letters. Loop has 40 letters. [2022-02-21 04:21:26,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 40 letters. [2022-02-21 04:21:26,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 69 letters. Loop has 40 letters. [2022-02-21 04:21:26,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 62 letters. Loop has 40 letters. [2022-02-21 04:21:26,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 40 letters. [2022-02-21 04:21:26,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 62 letters. Loop has 40 letters. [2022-02-21 04:21:26,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 82 letters. Loop has 40 letters. [2022-02-21 04:21:26,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 82 letters. Loop has 40 letters. [2022-02-21 04:21:26,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 82 letters. Loop has 40 letters. [2022-02-21 04:21:26,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 83 letters. Loop has 40 letters. [2022-02-21 04:21:26,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 83 letters. Loop has 40 letters. [2022-02-21 04:21:26,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 83 letters. Loop has 40 letters. [2022-02-21 04:21:26,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 56 letters. Loop has 40 letters. [2022-02-21 04:21:26,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 40 letters. [2022-02-21 04:21:26,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 56 letters. Loop has 40 letters. [2022-02-21 04:21:26,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 96 letters. Loop has 15 letters. [2022-02-21 04:21:26,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 96 letters. Loop has 15 letters. [2022-02-21 04:21:26,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 96 letters. Loop has 15 letters. [2022-02-21 04:21:26,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 56 letters. Loop has 43 letters. [2022-02-21 04:21:26,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 43 letters. [2022-02-21 04:21:26,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 56 letters. Loop has 43 letters. [2022-02-21 04:21:26,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 96 letters. Loop has 16 letters. [2022-02-21 04:21:26,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 96 letters. Loop has 16 letters. [2022-02-21 04:21:26,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 96 letters. Loop has 16 letters. [2022-02-21 04:21:26,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 84 letters. Loop has 7 letters. [2022-02-21 04:21:26,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 84 letters. Loop has 7 letters. [2022-02-21 04:21:26,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 84 letters. Loop has 7 letters. [2022-02-21 04:21:26,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 70 letters. Loop has 40 letters. [2022-02-21 04:21:26,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 40 letters. [2022-02-21 04:21:26,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 70 letters. Loop has 40 letters. [2022-02-21 04:21:26,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 85 letters. Loop has 7 letters. [2022-02-21 04:21:26,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 85 letters. Loop has 7 letters. [2022-02-21 04:21:26,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 85 letters. Loop has 7 letters. [2022-02-21 04:21:26,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 63 letters. Loop has 40 letters. [2022-02-21 04:21:26,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 40 letters. [2022-02-21 04:21:26,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 63 letters. Loop has 40 letters. [2022-02-21 04:21:26,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 97 letters. Loop has 15 letters. [2022-02-21 04:21:26,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 97 letters. Loop has 15 letters. [2022-02-21 04:21:26,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 97 letters. Loop has 15 letters. [2022-02-21 04:21:26,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 86 letters. Loop has 7 letters. [2022-02-21 04:21:26,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 86 letters. Loop has 7 letters. [2022-02-21 04:21:26,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 86 letters. Loop has 7 letters. [2022-02-21 04:21:26,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 97 letters. Loop has 16 letters. [2022-02-21 04:21:26,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 97 letters. Loop has 16 letters. [2022-02-21 04:21:26,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 97 letters. Loop has 16 letters. [2022-02-21 04:21:26,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 71 letters. Loop has 40 letters. [2022-02-21 04:21:26,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 40 letters. [2022-02-21 04:21:26,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 71 letters. Loop has 40 letters. [2022-02-21 04:21:26,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 87 letters. Loop has 7 letters. [2022-02-21 04:21:26,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 87 letters. Loop has 7 letters. [2022-02-21 04:21:26,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 87 letters. Loop has 7 letters. [2022-02-21 04:21:26,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 87 letters. Loop has 7 letters. [2022-02-21 04:21:26,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 87 letters. Loop has 7 letters. [2022-02-21 04:21:26,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 87 letters. Loop has 7 letters. [2022-02-21 04:21:26,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 98 letters. Loop has 15 letters. [2022-02-21 04:21:26,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 98 letters. Loop has 15 letters. [2022-02-21 04:21:26,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 98 letters. Loop has 15 letters. [2022-02-21 04:21:26,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 57 letters. Loop has 40 letters. [2022-02-21 04:21:26,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 40 letters. [2022-02-21 04:21:26,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 57 letters. Loop has 40 letters. [2022-02-21 04:21:26,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 57 letters. Loop has 43 letters. [2022-02-21 04:21:26,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 43 letters. [2022-02-21 04:21:26,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 57 letters. Loop has 43 letters. [2022-02-21 04:21:26,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 71 letters. Loop has 40 letters. [2022-02-21 04:21:26,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 40 letters. [2022-02-21 04:21:26,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 71 letters. Loop has 40 letters. [2022-02-21 04:21:26,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 57 letters. Loop has 43 letters. [2022-02-21 04:21:26,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 43 letters. [2022-02-21 04:21:26,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 57 letters. Loop has 43 letters. [2022-02-21 04:21:26,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 88 letters. Loop has 7 letters. [2022-02-21 04:21:26,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 88 letters. Loop has 7 letters. [2022-02-21 04:21:26,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 88 letters. Loop has 7 letters. [2022-02-21 04:21:26,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 88 letters. Loop has 7 letters. [2022-02-21 04:21:26,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 88 letters. Loop has 7 letters. [2022-02-21 04:21:26,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 88 letters. Loop has 7 letters. [2022-02-21 04:21:26,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 64 letters. Loop has 40 letters. [2022-02-21 04:21:26,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 40 letters. [2022-02-21 04:21:26,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 64 letters. Loop has 40 letters. [2022-02-21 04:21:26,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 72 letters. Loop has 40 letters. [2022-02-21 04:21:26,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 40 letters. [2022-02-21 04:21:26,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 72 letters. Loop has 40 letters. [2022-02-21 04:21:26,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 89 letters. Loop has 7 letters. [2022-02-21 04:21:26,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 89 letters. Loop has 7 letters. [2022-02-21 04:21:26,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 89 letters. Loop has 7 letters. [2022-02-21 04:21:26,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 89 letters. Loop has 7 letters. [2022-02-21 04:21:26,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 89 letters. Loop has 7 letters. [2022-02-21 04:21:26,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 89 letters. Loop has 7 letters. [2022-02-21 04:21:26,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 53 letters. Loop has 43 letters. [2022-02-21 04:21:26,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 43 letters. [2022-02-21 04:21:26,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 53 letters. Loop has 43 letters. [2022-02-21 04:21:26,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 58 letters. Loop has 40 letters. [2022-02-21 04:21:26,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 40 letters. [2022-02-21 04:21:26,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 58 letters. Loop has 40 letters. [2022-02-21 04:21:26,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 58 letters. Loop has 43 letters. [2022-02-21 04:21:26,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 43 letters. [2022-02-21 04:21:26,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 58 letters. Loop has 43 letters. [2022-02-21 04:21:26,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 58 letters. Loop has 43 letters. [2022-02-21 04:21:26,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 43 letters. [2022-02-21 04:21:26,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 58 letters. Loop has 43 letters. [2022-02-21 04:21:26,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 90 letters. Loop has 7 letters. [2022-02-21 04:21:26,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 90 letters. Loop has 7 letters. [2022-02-21 04:21:26,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 90 letters. Loop has 7 letters. [2022-02-21 04:21:26,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 73 letters. Loop has 40 letters. [2022-02-21 04:21:26,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 40 letters. [2022-02-21 04:21:26,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 73 letters. Loop has 40 letters. [2022-02-21 04:21:26,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 65 letters. Loop has 40 letters. [2022-02-21 04:21:26,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 40 letters. [2022-02-21 04:21:26,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 65 letters. Loop has 40 letters. [2022-02-21 04:21:26,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 90 letters. Loop has 40 letters. [2022-02-21 04:21:26,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 90 letters. Loop has 40 letters. [2022-02-21 04:21:26,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 90 letters. Loop has 40 letters. [2022-02-21 04:21:26,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 74 letters. Loop has 40 letters. [2022-02-21 04:21:26,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 40 letters. [2022-02-21 04:21:26,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 74 letters. Loop has 40 letters. [2022-02-21 04:21:26,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 91 letters. Loop has 8 letters. [2022-02-21 04:21:26,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 91 letters. Loop has 8 letters. [2022-02-21 04:21:26,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 91 letters. Loop has 8 letters. [2022-02-21 04:21:26,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 91 letters. Loop has 40 letters. [2022-02-21 04:21:26,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 91 letters. Loop has 40 letters. [2022-02-21 04:21:26,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 91 letters. Loop has 40 letters. [2022-02-21 04:21:26,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 66 letters. Loop has 40 letters. [2022-02-21 04:21:26,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 40 letters. [2022-02-21 04:21:26,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 66 letters. Loop has 40 letters. [2022-02-21 04:21:26,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 75 letters. Loop has 40 letters. [2022-02-21 04:21:26,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 75 letters. Loop has 40 letters. [2022-02-21 04:21:26,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 75 letters. Loop has 40 letters. [2022-02-21 04:21:26,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 66 letters. Loop has 41 letters. [2022-02-21 04:21:26,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 41 letters. [2022-02-21 04:21:26,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 66 letters. Loop has 41 letters. [2022-02-21 04:21:26,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 59 letters. Loop has 40 letters. [2022-02-21 04:21:26,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 40 letters. [2022-02-21 04:21:26,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 59 letters. Loop has 40 letters. [2022-02-21 04:21:26,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 59 letters. Loop has 43 letters. [2022-02-21 04:21:26,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 43 letters. [2022-02-21 04:21:26,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 59 letters. Loop has 43 letters. [2022-02-21 04:21:26,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 92 letters. Loop has 15 letters. [2022-02-21 04:21:26,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 92 letters. Loop has 15 letters. [2022-02-21 04:21:26,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 92 letters. Loop has 15 letters. [2022-02-21 04:21:26,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 92 letters. Loop has 40 letters. [2022-02-21 04:21:26,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 92 letters. Loop has 40 letters. [2022-02-21 04:21:26,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 92 letters. Loop has 40 letters. [2022-02-21 04:21:26,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 92 letters. Loop has 43 letters. [2022-02-21 04:21:26,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 92 letters. Loop has 43 letters. [2022-02-21 04:21:26,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 92 letters. Loop has 43 letters. [2022-02-21 04:21:26,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 54 letters. Loop has 43 letters. [2022-02-21 04:21:26,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 43 letters. [2022-02-21 04:21:26,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 54 letters. Loop has 43 letters. [2022-02-21 04:21:26,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 76 letters. Loop has 40 letters. [2022-02-21 04:21:26,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 76 letters. Loop has 40 letters. [2022-02-21 04:21:26,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 76 letters. Loop has 40 letters. [2022-02-21 04:21:26,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 93 letters. Loop has 16 letters. [2022-02-21 04:21:26,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 93 letters. Loop has 16 letters. [2022-02-21 04:21:26,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 93 letters. Loop has 16 letters. [2022-02-21 04:21:26,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 93 letters. Loop has 15 letters. [2022-02-21 04:21:26,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 93 letters. Loop has 15 letters. [2022-02-21 04:21:26,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 93 letters. Loop has 15 letters. [2022-02-21 04:21:26,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 93 letters. Loop has 40 letters. [2022-02-21 04:21:26,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 93 letters. Loop has 40 letters. [2022-02-21 04:21:26,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 93 letters. Loop has 40 letters. [2022-02-21 04:21:26,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 93 letters. Loop has 43 letters. [2022-02-21 04:21:26,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 93 letters. Loop has 43 letters. [2022-02-21 04:21:26,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 93 letters. Loop has 43 letters. [2022-02-21 04:21:26,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 77 letters. Loop has 40 letters. [2022-02-21 04:21:26,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 77 letters. Loop has 40 letters. [2022-02-21 04:21:26,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 77 letters. Loop has 40 letters. [2022-02-21 04:21:26,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 67 letters. Loop has 40 letters. [2022-02-21 04:21:26,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 40 letters. [2022-02-21 04:21:26,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 67 letters. Loop has 40 letters. [2022-02-21 04:21:26,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 60 letters. Loop has 40 letters. [2022-02-21 04:21:26,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 40 letters. [2022-02-21 04:21:26,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 60 letters. Loop has 40 letters. [2022-02-21 04:21:26,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 93 letters. Loop has 43 letters. [2022-02-21 04:21:26,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 93 letters. Loop has 43 letters. [2022-02-21 04:21:26,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 93 letters. Loop has 43 letters. [2022-02-21 04:21:26,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 67 letters. Loop has 42 letters. [2022-02-21 04:21:26,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 42 letters. [2022-02-21 04:21:26,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 67 letters. Loop has 42 letters. [2022-02-21 04:21:26,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 78 letters. Loop has 40 letters. [2022-02-21 04:21:26,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 78 letters. Loop has 40 letters. [2022-02-21 04:21:26,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 78 letters. Loop has 40 letters. [2022-02-21 04:21:26,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 94 letters. Loop has 16 letters. [2022-02-21 04:21:26,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 94 letters. Loop has 16 letters. [2022-02-21 04:21:26,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 94 letters. Loop has 16 letters. [2022-02-21 04:21:26,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 94 letters. Loop has 15 letters. [2022-02-21 04:21:26,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 94 letters. Loop has 15 letters. [2022-02-21 04:21:26,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 94 letters. Loop has 15 letters. [2022-02-21 04:21:26,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 94 letters. Loop has 43 letters. [2022-02-21 04:21:26,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 94 letters. Loop has 43 letters. [2022-02-21 04:21:26,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 94 letters. Loop has 43 letters. [2022-02-21 04:21:26,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 94 letters. Loop has 43 letters. [2022-02-21 04:21:26,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 94 letters. Loop has 43 letters. [2022-02-21 04:21:26,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 94 letters. Loop has 43 letters. [2022-02-21 04:21:26,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 68 letters. Loop has 40 letters. [2022-02-21 04:21:26,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 40 letters. [2022-02-21 04:21:26,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 68 letters. Loop has 40 letters. [2022-02-21 04:21:26,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 94 letters. Loop has 43 letters. [2022-02-21 04:21:26,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 94 letters. Loop has 43 letters. [2022-02-21 04:21:26,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 94 letters. Loop has 43 letters. [2022-02-21 04:21:26,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 79 letters. Loop has 40 letters. [2022-02-21 04:21:26,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 79 letters. Loop has 40 letters. [2022-02-21 04:21:26,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 79 letters. Loop has 40 letters. [2022-02-21 04:21:26,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 61 letters. Loop has 40 letters. [2022-02-21 04:21:26,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 40 letters. [2022-02-21 04:21:26,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 61 letters. Loop has 40 letters. [2022-02-21 04:21:26,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 55 letters. Loop has 40 letters. [2022-02-21 04:21:26,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 40 letters. [2022-02-21 04:21:26,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 55 letters. Loop has 40 letters. [2022-02-21 04:21:26,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 80 letters. Loop has 40 letters. [2022-02-21 04:21:26,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 80 letters. Loop has 40 letters. [2022-02-21 04:21:26,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 80 letters. Loop has 40 letters. [2022-02-21 04:21:26,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 69 letters. Loop has 39 letters. [2022-02-21 04:21:26,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 39 letters. [2022-02-21 04:21:26,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 69 letters. Loop has 39 letters. [2022-02-21 04:21:26,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 81 letters. Loop has 39 letters. [2022-02-21 04:21:26,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 81 letters. Loop has 39 letters. [2022-02-21 04:21:26,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 81 letters. Loop has 39 letters. [2022-02-21 04:21:26,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 69 letters. Loop has 40 letters. [2022-02-21 04:21:26,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 40 letters. [2022-02-21 04:21:26,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 69 letters. Loop has 40 letters. [2022-02-21 04:21:26,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 82 letters. Loop has 39 letters. [2022-02-21 04:21:26,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 82 letters. Loop has 39 letters. [2022-02-21 04:21:26,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 82 letters. Loop has 39 letters. [2022-02-21 04:21:26,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 62 letters. Loop has 39 letters. [2022-02-21 04:21:26,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 39 letters. [2022-02-21 04:21:26,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 62 letters. Loop has 39 letters. [2022-02-21 04:21:26,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 51 letters. Loop has 42 letters. [2022-02-21 04:21:26,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 42 letters. [2022-02-21 04:21:26,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 51 letters. Loop has 42 letters. [2022-02-21 04:21:26,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 62 letters. Loop has 39 letters. [2022-02-21 04:21:26,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 39 letters. [2022-02-21 04:21:26,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 62 letters. Loop has 39 letters. [2022-02-21 04:21:26,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 96 letters. Loop has 15 letters. [2022-02-21 04:21:26,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 96 letters. Loop has 15 letters. [2022-02-21 04:21:26,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 96 letters. Loop has 15 letters. [2022-02-21 04:21:26,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 96 letters. Loop has 16 letters. [2022-02-21 04:21:26,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 96 letters. Loop has 16 letters. [2022-02-21 04:21:26,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 96 letters. Loop has 16 letters. [2022-02-21 04:21:26,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 83 letters. Loop has 39 letters. [2022-02-21 04:21:26,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 83 letters. Loop has 39 letters. [2022-02-21 04:21:26,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 83 letters. Loop has 39 letters. [2022-02-21 04:21:26,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 84 letters. Loop has 7 letters. [2022-02-21 04:21:26,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 84 letters. Loop has 7 letters. [2022-02-21 04:21:26,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 84 letters. Loop has 7 letters. [2022-02-21 04:21:26,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 70 letters. Loop has 39 letters. [2022-02-21 04:21:26,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 39 letters. [2022-02-21 04:21:26,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 70 letters. Loop has 39 letters. [2022-02-21 04:21:26,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 56 letters. Loop has 39 letters. [2022-02-21 04:21:26,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 39 letters. [2022-02-21 04:21:26,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 56 letters. Loop has 39 letters. [2022-02-21 04:21:26,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 56 letters. Loop has 42 letters. [2022-02-21 04:21:26,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 42 letters. [2022-02-21 04:21:26,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 56 letters. Loop has 42 letters. [2022-02-21 04:21:26,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 70 letters. Loop has 40 letters. [2022-02-21 04:21:26,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 40 letters. [2022-02-21 04:21:26,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 70 letters. Loop has 40 letters. [2022-02-21 04:21:26,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 56 letters. Loop has 42 letters. [2022-02-21 04:21:26,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 42 letters. [2022-02-21 04:21:26,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 56 letters. Loop has 42 letters. [2022-02-21 04:21:26,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 85 letters. Loop has 7 letters. [2022-02-21 04:21:26,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 85 letters. Loop has 7 letters. [2022-02-21 04:21:26,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 85 letters. Loop has 7 letters. [2022-02-21 04:21:26,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 56 letters. Loop has 42 letters. [2022-02-21 04:21:26,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 42 letters. [2022-02-21 04:21:26,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 56 letters. Loop has 42 letters. [2022-02-21 04:21:26,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 97 letters. Loop has 15 letters. [2022-02-21 04:21:26,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 97 letters. Loop has 15 letters. [2022-02-21 04:21:26,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 97 letters. Loop has 15 letters. [2022-02-21 04:21:26,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 97 letters. Loop has 16 letters. [2022-02-21 04:21:26,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 97 letters. Loop has 16 letters. [2022-02-21 04:21:26,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 97 letters. Loop has 16 letters. [2022-02-21 04:21:26,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 63 letters. Loop has 39 letters. [2022-02-21 04:21:26,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 39 letters. [2022-02-21 04:21:26,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 63 letters. Loop has 39 letters. [2022-02-21 04:21:26,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 86 letters. Loop has 7 letters. [2022-02-21 04:21:26,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 86 letters. Loop has 7 letters. [2022-02-21 04:21:26,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 86 letters. Loop has 7 letters. [2022-02-21 04:21:26,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 63 letters. Loop has 39 letters. [2022-02-21 04:21:26,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 39 letters. [2022-02-21 04:21:26,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 63 letters. Loop has 39 letters. [2022-02-21 04:21:26,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 87 letters. Loop has 7 letters. [2022-02-21 04:21:26,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 87 letters. Loop has 7 letters. [2022-02-21 04:21:26,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 87 letters. Loop has 7 letters. [2022-02-21 04:21:26,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 71 letters. Loop has 39 letters. [2022-02-21 04:21:26,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 39 letters. [2022-02-21 04:21:26,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 71 letters. Loop has 39 letters. [2022-02-21 04:21:26,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 52 letters. Loop has 42 letters. [2022-02-21 04:21:26,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 42 letters. [2022-02-21 04:21:26,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 52 letters. Loop has 42 letters. [2022-02-21 04:21:26,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 98 letters. Loop has 15 letters. [2022-02-21 04:21:26,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 98 letters. Loop has 15 letters. [2022-02-21 04:21:26,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 98 letters. Loop has 15 letters. [2022-02-21 04:21:26,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 87 letters. Loop has 7 letters. [2022-02-21 04:21:26,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 87 letters. Loop has 7 letters. [2022-02-21 04:21:26,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 87 letters. Loop has 7 letters. [2022-02-21 04:21:26,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 88 letters. Loop has 7 letters. [2022-02-21 04:21:26,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 88 letters. Loop has 7 letters. [2022-02-21 04:21:26,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 88 letters. Loop has 7 letters. [2022-02-21 04:21:26,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 57 letters. Loop has 39 letters. [2022-02-21 04:21:26,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 39 letters. [2022-02-21 04:21:26,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 57 letters. Loop has 39 letters. [2022-02-21 04:21:26,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 88 letters. Loop has 7 letters. [2022-02-21 04:21:26,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 88 letters. Loop has 7 letters. [2022-02-21 04:21:26,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 88 letters. Loop has 7 letters. [2022-02-21 04:21:26,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 57 letters. Loop has 42 letters. [2022-02-21 04:21:26,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 42 letters. [2022-02-21 04:21:26,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 57 letters. Loop has 42 letters. [2022-02-21 04:21:26,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 64 letters. Loop has 39 letters. [2022-02-21 04:21:26,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 39 letters. [2022-02-21 04:21:26,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 64 letters. Loop has 39 letters. [2022-02-21 04:21:26,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 57 letters. Loop has 42 letters. [2022-02-21 04:21:26,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 42 letters. [2022-02-21 04:21:26,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 57 letters. Loop has 42 letters. [2022-02-21 04:21:26,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 72 letters. Loop has 39 letters. [2022-02-21 04:21:26,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 39 letters. [2022-02-21 04:21:26,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 72 letters. Loop has 39 letters. [2022-02-21 04:21:26,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 64 letters. Loop has 39 letters. [2022-02-21 04:21:26,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 39 letters. [2022-02-21 04:21:26,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 64 letters. Loop has 39 letters. [2022-02-21 04:21:26,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 57 letters. Loop has 42 letters. [2022-02-21 04:21:26,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 42 letters. [2022-02-21 04:21:26,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 57 letters. Loop has 42 letters. [2022-02-21 04:21:26,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 89 letters. Loop has 7 letters. [2022-02-21 04:21:26,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 89 letters. Loop has 7 letters. [2022-02-21 04:21:26,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 89 letters. Loop has 7 letters. [2022-02-21 04:21:26,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 89 letters. Loop has 7 letters. [2022-02-21 04:21:26,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 89 letters. Loop has 7 letters. [2022-02-21 04:21:26,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 89 letters. Loop has 7 letters. [2022-02-21 04:21:26,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 73 letters. Loop has 39 letters. [2022-02-21 04:21:26,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 39 letters. [2022-02-21 04:21:26,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 73 letters. Loop has 39 letters. [2022-02-21 04:21:26,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 90 letters. Loop has 7 letters. [2022-02-21 04:21:26,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 90 letters. Loop has 7 letters. [2022-02-21 04:21:26,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 90 letters. Loop has 7 letters. [2022-02-21 04:21:26,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 65 letters. Loop has 39 letters. [2022-02-21 04:21:26,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 39 letters. [2022-02-21 04:21:26,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 65 letters. Loop has 39 letters. [2022-02-21 04:21:26,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 90 letters. Loop has 39 letters. [2022-02-21 04:21:26,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 90 letters. Loop has 39 letters. [2022-02-21 04:21:26,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 90 letters. Loop has 39 letters. [2022-02-21 04:21:26,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 53 letters. Loop has 39 letters. [2022-02-21 04:21:26,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 39 letters. [2022-02-21 04:21:26,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 53 letters. Loop has 39 letters. [2022-02-21 04:21:26,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 65 letters. Loop has 40 letters. [2022-02-21 04:21:26,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 40 letters. [2022-02-21 04:21:26,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 65 letters. Loop has 40 letters. [2022-02-21 04:21:26,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 58 letters. Loop has 39 letters. [2022-02-21 04:21:26,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 39 letters. [2022-02-21 04:21:26,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 58 letters. Loop has 39 letters. [2022-02-21 04:21:26,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 58 letters. Loop has 42 letters. [2022-02-21 04:21:26,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 42 letters. [2022-02-21 04:21:26,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 58 letters. Loop has 42 letters. [2022-02-21 04:21:26,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 58 letters. Loop has 42 letters. [2022-02-21 04:21:26,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 42 letters. [2022-02-21 04:21:26,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 58 letters. Loop has 42 letters. [2022-02-21 04:21:26,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 74 letters. Loop has 39 letters. [2022-02-21 04:21:26,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 39 letters. [2022-02-21 04:21:26,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 74 letters. Loop has 39 letters. [2022-02-21 04:21:26,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 91 letters. Loop has 8 letters. [2022-02-21 04:21:26,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 91 letters. Loop has 8 letters. [2022-02-21 04:21:26,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 91 letters. Loop has 8 letters. [2022-02-21 04:21:26,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 91 letters. Loop has 39 letters. [2022-02-21 04:21:26,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 91 letters. Loop has 39 letters. [2022-02-21 04:21:26,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 91 letters. Loop has 39 letters. [2022-02-21 04:21:26,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 66 letters. Loop has 39 letters. [2022-02-21 04:21:26,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 39 letters. [2022-02-21 04:21:26,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 66 letters. Loop has 39 letters. [2022-02-21 04:21:26,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 75 letters. Loop has 39 letters. [2022-02-21 04:21:26,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 75 letters. Loop has 39 letters. [2022-02-21 04:21:26,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 75 letters. Loop has 39 letters. [2022-02-21 04:21:26,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 66 letters. Loop has 40 letters. [2022-02-21 04:21:26,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 40 letters. [2022-02-21 04:21:26,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 66 letters. Loop has 40 letters. [2022-02-21 04:21:26,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 92 letters. Loop has 15 letters. [2022-02-21 04:21:26,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 92 letters. Loop has 15 letters. [2022-02-21 04:21:26,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 92 letters. Loop has 15 letters. [2022-02-21 04:21:26,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 66 letters. Loop has 41 letters. [2022-02-21 04:21:26,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 41 letters. [2022-02-21 04:21:26,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 66 letters. Loop has 41 letters. [2022-02-21 04:21:26,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 92 letters. Loop has 42 letters. [2022-02-21 04:21:26,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 92 letters. Loop has 42 letters. [2022-02-21 04:21:26,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 92 letters. Loop has 42 letters. [2022-02-21 04:21:26,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 59 letters. Loop has 39 letters. [2022-02-21 04:21:26,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 39 letters. [2022-02-21 04:21:26,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 59 letters. Loop has 39 letters. [2022-02-21 04:21:26,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 76 letters. Loop has 39 letters. [2022-02-21 04:21:26,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 76 letters. Loop has 39 letters. [2022-02-21 04:21:26,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 76 letters. Loop has 39 letters. [2022-02-21 04:21:26,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 59 letters. Loop has 39 letters. [2022-02-21 04:21:26,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 39 letters. [2022-02-21 04:21:26,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 59 letters. Loop has 39 letters. [2022-02-21 04:21:26,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 59 letters. Loop has 42 letters. [2022-02-21 04:21:26,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 42 letters. [2022-02-21 04:21:26,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 59 letters. Loop has 42 letters. [2022-02-21 04:21:26,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 54 letters. Loop has 39 letters. [2022-02-21 04:21:26,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 39 letters. [2022-02-21 04:21:26,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 54 letters. Loop has 39 letters. [2022-02-21 04:21:26,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 93 letters. Loop has 16 letters. [2022-02-21 04:21:26,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 93 letters. Loop has 16 letters. [2022-02-21 04:21:26,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 93 letters. Loop has 16 letters. [2022-02-21 04:21:26,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 54 letters. Loop has 42 letters. [2022-02-21 04:21:26,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 42 letters. [2022-02-21 04:21:26,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 54 letters. Loop has 42 letters. [2022-02-21 04:21:26,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 93 letters. Loop has 15 letters. [2022-02-21 04:21:26,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 93 letters. Loop has 15 letters. [2022-02-21 04:21:26,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 93 letters. Loop has 15 letters. [2022-02-21 04:21:26,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 77 letters. Loop has 39 letters. [2022-02-21 04:21:26,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 77 letters. Loop has 39 letters. [2022-02-21 04:21:26,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 77 letters. Loop has 39 letters. [2022-02-21 04:21:26,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 67 letters. Loop has 39 letters. [2022-02-21 04:21:26,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 39 letters. [2022-02-21 04:21:26,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 67 letters. Loop has 39 letters. [2022-02-21 04:21:26,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 67 letters. Loop has 40 letters. [2022-02-21 04:21:26,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 40 letters. [2022-02-21 04:21:26,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 67 letters. Loop has 40 letters. [2022-02-21 04:21:26,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 67 letters. Loop has 42 letters. [2022-02-21 04:21:26,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 42 letters. [2022-02-21 04:21:26,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 67 letters. Loop has 42 letters. [2022-02-21 04:21:26,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 60 letters. Loop has 39 letters. [2022-02-21 04:21:26,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 39 letters. [2022-02-21 04:21:26,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 60 letters. Loop has 39 letters. [2022-02-21 04:21:26,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 60 letters. Loop has 39 letters. [2022-02-21 04:21:26,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 39 letters. [2022-02-21 04:21:26,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 60 letters. Loop has 39 letters. [2022-02-21 04:21:26,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 78 letters. Loop has 39 letters. [2022-02-21 04:21:26,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 78 letters. Loop has 39 letters. [2022-02-21 04:21:26,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 78 letters. Loop has 39 letters. [2022-02-21 04:21:26,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 94 letters. Loop has 16 letters. [2022-02-21 04:21:26,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 94 letters. Loop has 16 letters. [2022-02-21 04:21:26,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 94 letters. Loop has 16 letters. [2022-02-21 04:21:26,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 94 letters. Loop has 15 letters. [2022-02-21 04:21:26,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 94 letters. Loop has 15 letters. [2022-02-21 04:21:26,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 94 letters. Loop has 15 letters. [2022-02-21 04:21:26,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 79 letters. Loop has 39 letters. [2022-02-21 04:21:26,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 79 letters. Loop has 39 letters. [2022-02-21 04:21:26,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 79 letters. Loop has 39 letters. [2022-02-21 04:21:26,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 68 letters. Loop has 39 letters. [2022-02-21 04:21:26,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 39 letters. [2022-02-21 04:21:26,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 68 letters. Loop has 39 letters. [2022-02-21 04:21:26,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 68 letters. Loop has 40 letters. [2022-02-21 04:21:26,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 40 letters. [2022-02-21 04:21:26,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 68 letters. Loop has 40 letters. [2022-02-21 04:21:26,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 61 letters. Loop has 39 letters. [2022-02-21 04:21:26,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 39 letters. [2022-02-21 04:21:26,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 61 letters. Loop has 39 letters. [2022-02-21 04:21:26,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 61 letters. Loop has 39 letters. [2022-02-21 04:21:26,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 39 letters. [2022-02-21 04:21:26,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 61 letters. Loop has 39 letters. [2022-02-21 04:21:26,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 55 letters. Loop has 39 letters. [2022-02-21 04:21:26,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 39 letters. [2022-02-21 04:21:26,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 55 letters. Loop has 39 letters. [2022-02-21 04:21:26,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 80 letters. Loop has 39 letters. [2022-02-21 04:21:26,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 80 letters. Loop has 39 letters. [2022-02-21 04:21:26,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 80 letters. Loop has 39 letters. [2022-02-21 04:21:26,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 55 letters. Loop has 42 letters. [2022-02-21 04:21:26,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 42 letters. [2022-02-21 04:21:26,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 55 letters. Loop has 42 letters. [2022-02-21 04:21:26,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 55 letters. Loop has 42 letters. [2022-02-21 04:21:26,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 42 letters. [2022-02-21 04:21:26,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 55 letters. Loop has 42 letters. [2022-02-21 04:21:26,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 95 letters. Loop has 16 letters. [2022-02-21 04:21:26,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 95 letters. Loop has 16 letters. [2022-02-21 04:21:26,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 95 letters. Loop has 16 letters. [2022-02-21 04:21:26,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 95 letters. Loop has 15 letters. [2022-02-21 04:21:26,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 95 letters. Loop has 15 letters. [2022-02-21 04:21:26,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 95 letters. Loop has 15 letters. [2022-02-21 04:21:26,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 62 letters. Loop has 40 letters. [2022-02-21 04:21:26,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 40 letters. [2022-02-21 04:21:26,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 62 letters. Loop has 40 letters. [2022-02-21 04:21:26,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 51 letters. Loop has 16 letters. [2022-02-21 04:21:26,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 16 letters. [2022-02-21 04:21:26,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 51 letters. Loop has 16 letters. [2022-02-21 04:21:26,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 51 letters. Loop has 15 letters. [2022-02-21 04:21:26,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 15 letters. [2022-02-21 04:21:26,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 51 letters. Loop has 15 letters. [2022-02-21 04:21:26,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 51 letters. Loop has 40 letters. [2022-02-21 04:21:26,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 40 letters. [2022-02-21 04:21:26,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 51 letters. Loop has 40 letters. [2022-02-21 04:21:26,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 51 letters. Loop has 43 letters. [2022-02-21 04:21:26,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 43 letters. [2022-02-21 04:21:26,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 51 letters. Loop has 43 letters. [2022-02-21 04:21:26,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 51 letters. Loop has 43 letters. [2022-02-21 04:21:26,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 43 letters. [2022-02-21 04:21:26,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 51 letters. Loop has 43 letters. [2022-02-21 04:21:26,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 56 letters. Loop has 15 letters. [2022-02-21 04:21:26,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 15 letters. [2022-02-21 04:21:26,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 56 letters. Loop has 15 letters. [2022-02-21 04:21:26,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 69 letters. Loop has 40 letters. [2022-02-21 04:21:26,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 40 letters. [2022-02-21 04:21:26,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 69 letters. Loop has 40 letters. [2022-02-21 04:21:26,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 56 letters. Loop has 40 letters. [2022-02-21 04:21:26,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 40 letters. [2022-02-21 04:21:26,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 56 letters. Loop has 40 letters. [2022-02-21 04:21:26,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 56 letters. Loop has 43 letters. [2022-02-21 04:21:26,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 43 letters. [2022-02-21 04:21:26,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 56 letters. Loop has 43 letters. [2022-02-21 04:21:26,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 63 letters. Loop has 40 letters. [2022-02-21 04:21:26,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 40 letters. [2022-02-21 04:21:26,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 63 letters. Loop has 40 letters. [2022-02-21 04:21:26,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 63 letters. Loop has 41 letters. [2022-02-21 04:21:26,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 41 letters. [2022-02-21 04:21:26,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 63 letters. Loop has 41 letters. [2022-02-21 04:21:26,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 52 letters. Loop has 16 letters. [2022-02-21 04:21:26,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 16 letters. [2022-02-21 04:21:26,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 52 letters. Loop has 16 letters. [2022-02-21 04:21:26,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 52 letters. Loop has 15 letters. [2022-02-21 04:21:26,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 15 letters. [2022-02-21 04:21:26,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 52 letters. Loop has 15 letters. [2022-02-21 04:21:26,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 70 letters. Loop has 40 letters. [2022-02-21 04:21:26,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 40 letters. [2022-02-21 04:21:26,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 70 letters. Loop has 40 letters. [2022-02-21 04:21:26,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 52 letters. Loop has 40 letters. [2022-02-21 04:21:26,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 40 letters. [2022-02-21 04:21:26,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 52 letters. Loop has 40 letters. [2022-02-21 04:21:26,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 52 letters. Loop has 43 letters. [2022-02-21 04:21:26,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 43 letters. [2022-02-21 04:21:26,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 52 letters. Loop has 43 letters. [2022-02-21 04:21:26,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 52 letters. Loop has 43 letters. [2022-02-21 04:21:26,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 43 letters. [2022-02-21 04:21:26,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 52 letters. Loop has 43 letters. [2022-02-21 04:21:26,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 52 letters. Loop has 43 letters. [2022-02-21 04:21:26,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 43 letters. [2022-02-21 04:21:26,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 52 letters. Loop has 43 letters. [2022-02-21 04:21:26,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 57 letters. Loop has 40 letters. [2022-02-21 04:21:26,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 40 letters. [2022-02-21 04:21:26,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 57 letters. Loop has 40 letters. [2022-02-21 04:21:26,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 71 letters. Loop has 40 letters. [2022-02-21 04:21:26,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 40 letters. [2022-02-21 04:21:26,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 71 letters. Loop has 40 letters. [2022-02-21 04:21:26,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 64 letters. Loop has 40 letters. [2022-02-21 04:21:26,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 40 letters. [2022-02-21 04:21:26,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 64 letters. Loop has 40 letters. [2022-02-21 04:21:26,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 64 letters. Loop has 42 letters. [2022-02-21 04:21:26,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 42 letters. [2022-02-21 04:21:26,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 64 letters. Loop has 42 letters. [2022-02-21 04:21:26,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 72 letters. Loop has 40 letters. [2022-02-21 04:21:26,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 40 letters. [2022-02-21 04:21:26,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 72 letters. Loop has 40 letters. [2022-02-21 04:21:26,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 53 letters. Loop has 16 letters. [2022-02-21 04:21:26,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 16 letters. [2022-02-21 04:21:26,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 53 letters. Loop has 16 letters. [2022-02-21 04:21:26,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 53 letters. Loop has 15 letters. [2022-02-21 04:21:26,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 15 letters. [2022-02-21 04:21:26,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 53 letters. Loop has 15 letters. [2022-02-21 04:21:26,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 53 letters. Loop has 40 letters. [2022-02-21 04:21:26,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 40 letters. [2022-02-21 04:21:26,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 53 letters. Loop has 40 letters. [2022-02-21 04:21:26,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 53 letters. Loop has 43 letters. [2022-02-21 04:21:26,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 43 letters. [2022-02-21 04:21:26,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 53 letters. Loop has 43 letters. [2022-02-21 04:21:26,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 65 letters. Loop has 40 letters. [2022-02-21 04:21:26,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 40 letters. [2022-02-21 04:21:26,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 65 letters. Loop has 40 letters. [2022-02-21 04:21:26,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 58 letters. Loop has 40 letters. [2022-02-21 04:21:26,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 40 letters. [2022-02-21 04:21:26,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 58 letters. Loop has 40 letters. [2022-02-21 04:21:26,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 53 letters. Loop has 43 letters. [2022-02-21 04:21:26,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 43 letters. [2022-02-21 04:21:26,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 53 letters. Loop has 43 letters. [2022-02-21 04:21:26,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 53 letters. Loop has 43 letters. [2022-02-21 04:21:26,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 43 letters. [2022-02-21 04:21:26,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 53 letters. Loop has 43 letters. [2022-02-21 04:21:26,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 73 letters. Loop has 40 letters. [2022-02-21 04:21:26,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 40 letters. [2022-02-21 04:21:26,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 73 letters. Loop has 40 letters. [2022-02-21 04:21:26,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 43 letters. Loop has 7 letters. [2022-02-21 04:21:26,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 43 letters. Loop has 7 letters. [2022-02-21 04:21:26,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 43 letters. Loop has 7 letters. [2022-02-21 04:21:26,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 74 letters. Loop has 40 letters. [2022-02-21 04:21:26,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 40 letters. [2022-02-21 04:21:26,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 74 letters. Loop has 40 letters. [2022-02-21 04:21:26,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 44 letters. Loop has 7 letters. [2022-02-21 04:21:26,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 44 letters. Loop has 7 letters. [2022-02-21 04:21:26,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 44 letters. Loop has 7 letters. [2022-02-21 04:21:26,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 66 letters. Loop has 40 letters. [2022-02-21 04:21:26,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 40 letters. [2022-02-21 04:21:26,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 66 letters. Loop has 40 letters. [2022-02-21 04:21:26,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 45 letters. Loop has 7 letters. [2022-02-21 04:21:26,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 45 letters. Loop has 7 letters. [2022-02-21 04:21:26,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 45 letters. Loop has 7 letters. [2022-02-21 04:21:26,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 45 letters. Loop has 7 letters. [2022-02-21 04:21:26,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 45 letters. Loop has 7 letters. [2022-02-21 04:21:26,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 45 letters. Loop has 7 letters. [2022-02-21 04:21:26,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 75 letters. Loop has 40 letters. [2022-02-21 04:21:26,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 75 letters. Loop has 40 letters. [2022-02-21 04:21:26,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 75 letters. Loop has 40 letters. [2022-02-21 04:21:26,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 59 letters. Loop has 40 letters. [2022-02-21 04:21:26,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 40 letters. [2022-02-21 04:21:26,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 59 letters. Loop has 40 letters. [2022-02-21 04:21:26,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 46 letters. Loop has 7 letters. [2022-02-21 04:21:26,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 46 letters. Loop has 7 letters. [2022-02-21 04:21:26,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 46 letters. Loop has 7 letters. [2022-02-21 04:21:26,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 54 letters. Loop has 15 letters. [2022-02-21 04:21:26,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 15 letters. [2022-02-21 04:21:26,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 54 letters. Loop has 15 letters. [2022-02-21 04:21:26,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 54 letters. Loop has 16 letters. [2022-02-21 04:21:26,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 16 letters. [2022-02-21 04:21:26,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 54 letters. Loop has 16 letters. [2022-02-21 04:21:26,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 46 letters. Loop has 7 letters. [2022-02-21 04:21:26,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 46 letters. Loop has 7 letters. [2022-02-21 04:21:26,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 46 letters. Loop has 7 letters. [2022-02-21 04:21:26,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 54 letters. Loop has 40 letters. [2022-02-21 04:21:26,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 40 letters. [2022-02-21 04:21:26,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 54 letters. Loop has 40 letters. [2022-02-21 04:21:26,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 54 letters. Loop has 43 letters. [2022-02-21 04:21:26,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 43 letters. [2022-02-21 04:21:26,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 54 letters. Loop has 43 letters. [2022-02-21 04:21:26,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 54 letters. Loop has 43 letters. [2022-02-21 04:21:26,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 43 letters. [2022-02-21 04:21:26,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 54 letters. Loop has 43 letters. [2022-02-21 04:21:26,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 76 letters. Loop has 40 letters. [2022-02-21 04:21:26,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 76 letters. Loop has 40 letters. [2022-02-21 04:21:26,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 76 letters. Loop has 40 letters. [2022-02-21 04:21:26,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 54 letters. Loop has 43 letters. [2022-02-21 04:21:26,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 43 letters. [2022-02-21 04:21:26,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 54 letters. Loop has 43 letters. [2022-02-21 04:21:26,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 47 letters. Loop has 7 letters. [2022-02-21 04:21:26,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 47 letters. Loop has 7 letters. [2022-02-21 04:21:26,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 47 letters. Loop has 7 letters. [2022-02-21 04:21:26,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 67 letters. Loop has 40 letters. [2022-02-21 04:21:26,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 40 letters. [2022-02-21 04:21:26,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 67 letters. Loop has 40 letters. [2022-02-21 04:21:26,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 47 letters. Loop has 7 letters. [2022-02-21 04:21:26,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 47 letters. Loop has 7 letters. [2022-02-21 04:21:26,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 47 letters. Loop has 7 letters. [2022-02-21 04:21:26,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 60 letters. Loop has 40 letters. [2022-02-21 04:21:26,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 40 letters. [2022-02-21 04:21:26,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 60 letters. Loop has 40 letters. [2022-02-21 04:21:26,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 77 letters. Loop has 40 letters. [2022-02-21 04:21:26,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 77 letters. Loop has 40 letters. [2022-02-21 04:21:26,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 77 letters. Loop has 40 letters. [2022-02-21 04:21:26,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 48 letters. Loop has 7 letters. [2022-02-21 04:21:26,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 7 letters. [2022-02-21 04:21:26,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 48 letters. Loop has 7 letters. [2022-02-21 04:21:26,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 48 letters. Loop has 40 letters. [2022-02-21 04:21:26,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 40 letters. [2022-02-21 04:21:26,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 48 letters. Loop has 40 letters. [2022-02-21 04:21:26,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 78 letters. Loop has 40 letters. [2022-02-21 04:21:26,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 78 letters. Loop has 40 letters. [2022-02-21 04:21:26,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 78 letters. Loop has 40 letters. [2022-02-21 04:21:26,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:21:26,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:21:26,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 49 letters. Loop has 8 letters. [2022-02-21 04:21:26,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 49 letters. Loop has 7 letters. [2022-02-21 04:21:26,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 49 letters. Loop has 7 letters. [2022-02-21 04:21:26,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 49 letters. Loop has 7 letters. [2022-02-21 04:21:26,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 49 letters. Loop has 40 letters. [2022-02-21 04:21:26,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 49 letters. Loop has 40 letters. [2022-02-21 04:21:26,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 49 letters. Loop has 40 letters. [2022-02-21 04:21:26,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 68 letters. Loop has 40 letters. [2022-02-21 04:21:26,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 40 letters. [2022-02-21 04:21:26,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 68 letters. Loop has 40 letters. [2022-02-21 04:21:26,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 61 letters. Loop has 40 letters. [2022-02-21 04:21:26,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 40 letters. [2022-02-21 04:21:26,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 61 letters. Loop has 40 letters. [2022-02-21 04:21:26,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 55 letters. Loop has 15 letters. [2022-02-21 04:21:26,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 15 letters. [2022-02-21 04:21:26,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 55 letters. Loop has 15 letters. [2022-02-21 04:21:26,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 55 letters. Loop has 16 letters. [2022-02-21 04:21:26,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 16 letters. [2022-02-21 04:21:26,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 55 letters. Loop has 16 letters. [2022-02-21 04:21:26,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 79 letters. Loop has 40 letters. [2022-02-21 04:21:26,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 79 letters. Loop has 40 letters. [2022-02-21 04:21:26,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 79 letters. Loop has 40 letters. [2022-02-21 04:21:26,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 55 letters. Loop has 40 letters. [2022-02-21 04:21:26,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 40 letters. [2022-02-21 04:21:26,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 55 letters. Loop has 40 letters. [2022-02-21 04:21:26,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 55 letters. Loop has 43 letters. [2022-02-21 04:21:26,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 43 letters. [2022-02-21 04:21:26,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 55 letters. Loop has 43 letters. [2022-02-21 04:21:26,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 50 letters. Loop has 15 letters. [2022-02-21 04:21:26,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 15 letters. [2022-02-21 04:21:26,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 50 letters. Loop has 15 letters. [2022-02-21 04:21:26,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 55 letters. Loop has 43 letters. [2022-02-21 04:21:26,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 43 letters. [2022-02-21 04:21:26,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 55 letters. Loop has 43 letters. [2022-02-21 04:21:26,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 50 letters. Loop has 40 letters. [2022-02-21 04:21:26,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 40 letters. [2022-02-21 04:21:26,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 50 letters. Loop has 40 letters. [2022-02-21 04:21:26,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 50 letters. Loop has 43 letters. [2022-02-21 04:21:26,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 43 letters. [2022-02-21 04:21:26,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 50 letters. Loop has 43 letters. [2022-02-21 04:21:26,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 68 letters. Loop has 40 letters. [2022-02-21 04:21:26,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 40 letters. [2022-02-21 04:21:26,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 68 letters. Loop has 40 letters. [2022-02-21 04:21:26,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 303 states and 459 transitions. cyclomatic complexity: 159 Stem has 80 letters. Loop has 40 letters. [2022-02-21 04:21:26,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 80 letters. Loop has 40 letters. [2022-02-21 04:21:26,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 810 states and 1251 transitions. cyclomatic complexity: 450 Stem has 80 letters. Loop has 40 letters. [2022-02-21 04:21:26,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,660 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:21:26,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 16.2) internal successors, (81), 5 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:26,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 181 transitions. [2022-02-21 04:21:26,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 181 transitions. Stem has 41 letters. Loop has 40 letters. [2022-02-21 04:21:26,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 181 transitions. Stem has 81 letters. Loop has 40 letters. [2022-02-21 04:21:26,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 181 transitions. Stem has 41 letters. Loop has 80 letters. [2022-02-21 04:21:26,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:21:26,663 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 810 states and 1251 transitions. cyclomatic complexity: 450 [2022-02-21 04:21:26,684 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 318 [2022-02-21 04:21:26,702 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 810 states to 810 states and 1251 transitions. [2022-02-21 04:21:26,702 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 378 [2022-02-21 04:21:26,703 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 384 [2022-02-21 04:21:26,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 810 states and 1251 transitions. [2022-02-21 04:21:26,703 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:21:26,703 INFO L681 BuchiCegarLoop]: Abstraction has 810 states and 1251 transitions. [2022-02-21 04:21:26,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 810 states and 1251 transitions. [2022-02-21 04:21:26,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 810 to 804. [2022-02-21 04:21:26,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:21:26,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 810 states and 1251 transitions. Second operand has 804 states, 804 states have (on average 1.5422885572139304) internal successors, (1240), 803 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:26,713 INFO L74 IsIncluded]: Start isIncluded. First operand 810 states and 1251 transitions. Second operand has 804 states, 804 states have (on average 1.5422885572139304) internal successors, (1240), 803 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:26,714 INFO L87 Difference]: Start difference. First operand 810 states and 1251 transitions. Second operand has 804 states, 804 states have (on average 1.5422885572139304) internal successors, (1240), 803 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:26,714 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:21:26,734 INFO L93 Difference]: Finished difference Result 813 states and 1255 transitions. [2022-02-21 04:21:26,734 INFO L276 IsEmpty]: Start isEmpty. Operand 813 states and 1255 transitions. [2022-02-21 04:21:26,735 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:26,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:26,736 INFO L74 IsIncluded]: Start isIncluded. First operand has 804 states, 804 states have (on average 1.5422885572139304) internal successors, (1240), 803 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 810 states and 1251 transitions. [2022-02-21 04:21:26,737 INFO L87 Difference]: Start difference. First operand has 804 states, 804 states have (on average 1.5422885572139304) internal successors, (1240), 803 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 810 states and 1251 transitions. [2022-02-21 04:21:26,738 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:21:26,758 INFO L93 Difference]: Finished difference Result 825 states and 1276 transitions. [2022-02-21 04:21:26,759 INFO L276 IsEmpty]: Start isEmpty. Operand 825 states and 1276 transitions. [2022-02-21 04:21:26,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:26,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:26,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:21:26,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:21:26,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 804 states, 804 states have (on average 1.5422885572139304) internal successors, (1240), 803 states have internal predecessors, (1240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:26,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 804 states to 804 states and 1240 transitions. [2022-02-21 04:21:26,778 INFO L704 BuchiCegarLoop]: Abstraction has 804 states and 1240 transitions. [2022-02-21 04:21:26,778 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:21:26,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:21:26,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:21:26,779 INFO L87 Difference]: Start difference. First operand 804 states and 1240 transitions. Second operand has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:26,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:26,909 INFO L93 Difference]: Finished difference Result 963 states and 1454 transitions. [2022-02-21 04:21:26,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:21:26,909 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 13.666666666666666) internal successors, (41), 3 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:26,933 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:21:26,933 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 963 states and 1454 transitions. [2022-02-21 04:21:26,958 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 388 [2022-02-21 04:21:26,992 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 963 states to 963 states and 1454 transitions. [2022-02-21 04:21:26,992 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 448 [2022-02-21 04:21:26,993 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 448 [2022-02-21 04:21:26,993 INFO L73 IsDeterministic]: Start isDeterministic. Operand 963 states and 1454 transitions. [2022-02-21 04:21:26,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:21:26,993 INFO L681 BuchiCegarLoop]: Abstraction has 963 states and 1454 transitions. [2022-02-21 04:21:26,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 963 states and 1454 transitions. [2022-02-21 04:21:27,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 963 to 963. [2022-02-21 04:21:27,001 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:21:27,002 INFO L82 GeneralOperation]: Start isEquivalent. First operand 963 states and 1454 transitions. Second operand has 963 states, 963 states have (on average 1.509865005192108) internal successors, (1454), 962 states have internal predecessors, (1454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:27,002 INFO L74 IsIncluded]: Start isIncluded. First operand 963 states and 1454 transitions. Second operand has 963 states, 963 states have (on average 1.509865005192108) internal successors, (1454), 962 states have internal predecessors, (1454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:27,003 INFO L87 Difference]: Start difference. First operand 963 states and 1454 transitions. Second operand has 963 states, 963 states have (on average 1.509865005192108) internal successors, (1454), 962 states have internal predecessors, (1454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:27,004 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:21:27,030 INFO L93 Difference]: Finished difference Result 966 states and 1458 transitions. [2022-02-21 04:21:27,030 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1458 transitions. [2022-02-21 04:21:27,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:27,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:27,033 INFO L74 IsIncluded]: Start isIncluded. First operand has 963 states, 963 states have (on average 1.509865005192108) internal successors, (1454), 962 states have internal predecessors, (1454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 963 states and 1454 transitions. [2022-02-21 04:21:27,033 INFO L87 Difference]: Start difference. First operand has 963 states, 963 states have (on average 1.509865005192108) internal successors, (1454), 962 states have internal predecessors, (1454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 963 states and 1454 transitions. [2022-02-21 04:21:27,034 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:21:27,061 INFO L93 Difference]: Finished difference Result 966 states and 1458 transitions. [2022-02-21 04:21:27,062 INFO L276 IsEmpty]: Start isEmpty. Operand 966 states and 1458 transitions. [2022-02-21 04:21:27,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:27,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:27,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:21:27,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:21:27,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 963 states have (on average 1.509865005192108) internal successors, (1454), 962 states have internal predecessors, (1454), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:27,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1454 transitions. [2022-02-21 04:21:27,087 INFO L704 BuchiCegarLoop]: Abstraction has 963 states and 1454 transitions. [2022-02-21 04:21:27,088 INFO L587 BuchiCegarLoop]: Abstraction has 963 states and 1454 transitions. [2022-02-21 04:21:27,088 INFO L425 BuchiCegarLoop]: ======== Iteration 12============ [2022-02-21 04:21:27,088 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 963 states and 1454 transitions. [2022-02-21 04:21:27,090 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 388 [2022-02-21 04:21:27,090 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:21:27,090 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:21:27,091 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:27,091 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:27,091 INFO L791 eck$LassoCheckResult]: Stem: 14975#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(16, 2);call #Ultimate.allocInit(12, 3);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 14869#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~2#1;havoc main_~__retres1~2#1;assume { :begin_inline_init_model } true;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 14802#L490 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret8#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 14803#L212 assume 1 == ~b0_req_up~0;assume { :begin_inline_update_b0 } true; 14911#L137 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 14912#L137-2 ~b0_req_up~0 := 0; 14901#L145 assume { :end_inline_update_b0 } true; 14902#L212-2 assume 1 == ~b1_req_up~0;assume { :begin_inline_update_b1 } true; 14833#L152 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 14834#L152-2 ~b1_req_up~0 := 0; 14947#L160 assume { :end_inline_update_b1 } true; 14945#L219-1 assume 1 == ~d0_req_up~0;assume { :begin_inline_update_d0 } true; 14807#L167 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 14808#L167-2 ~d0_req_up~0 := 0; 14770#L175 assume { :end_inline_update_d0 } true; 14771#L226-1 assume 1 == ~d1_req_up~0;assume { :begin_inline_update_d1 } true; 14873#L182 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 14818#L182-2 ~d1_req_up~0 := 0; 14819#L190 assume { :end_inline_update_d1 } true; 14910#L233-1 assume !(1 == ~z_req_up~0); 14918#L240-1 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 14800#L255 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 14801#L255-2 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 14919#L321 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 14920#L321-2 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 14991#L326-1 assume !(0 == ~d0_ev~0); 14828#L331-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 14780#L336-1 assume !(0 == ~z_ev~0); 14781#L341-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; 14981#L107 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; 14969#L129 is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; 14898#L130 activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; 14899#L390 assume !(0 != activate_threads_~tmp~1#1); 14948#L390-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 14893#L354 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 14865#L354-2 assume !(1 == ~b1_ev~0); 14866#L359-1 assume !(1 == ~d0_ev~0); 14867#L364-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 14868#L369-1 assume !(1 == ~z_ev~0); 14878#L374-1 assume { :end_inline_reset_delta_events } true; 14955#L432-2 assume !false; 15199#L433 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1; 15200#L295 [2022-02-21 04:21:27,091 INFO L793 eck$LassoCheckResult]: Loop: 15200#L295 assume !false; 15425#L286 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; 15422#L268 assume !(0 == ~comp_m1_st~0);exists_runnable_thread_~__retres1~1#1 := 0; 15416#L275 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; 15406#L276 eval_#t~ret4#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___0~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; 15401#L290 assume 0 != eval_~tmp___0~0#1; 15402#L290-1 assume !(0 == ~comp_m1_st~0); 15200#L295 [2022-02-21 04:21:27,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:27,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1995676522, now seen corresponding path program 1 times [2022-02-21 04:21:27,092 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:27,092 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492061644] [2022-02-21 04:21:27,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:27,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:27,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:27,106 INFO L290 TraceCheckUtils]: 0: Hoare triple {18738#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(16, 2);call #Ultimate.allocInit(12, 3);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; {18738#true} is VALID [2022-02-21 04:21:27,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {18738#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~2#1;havoc main_~__retres1~2#1;assume { :begin_inline_init_model } true;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; {18738#true} is VALID [2022-02-21 04:21:27,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {18738#true} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret8#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; {18738#true} is VALID [2022-02-21 04:21:27,106 INFO L290 TraceCheckUtils]: 3: Hoare triple {18738#true} assume 1 == ~b0_req_up~0;assume { :begin_inline_update_b0 } true; {18738#true} is VALID [2022-02-21 04:21:27,106 INFO L290 TraceCheckUtils]: 4: Hoare triple {18738#true} assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; {18738#true} is VALID [2022-02-21 04:21:27,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {18738#true} ~b0_req_up~0 := 0; {18738#true} is VALID [2022-02-21 04:21:27,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {18738#true} assume { :end_inline_update_b0 } true; {18738#true} is VALID [2022-02-21 04:21:27,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {18738#true} assume 1 == ~b1_req_up~0;assume { :begin_inline_update_b1 } true; {18738#true} is VALID [2022-02-21 04:21:27,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {18738#true} assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; {18738#true} is VALID [2022-02-21 04:21:27,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {18738#true} ~b1_req_up~0 := 0; {18738#true} is VALID [2022-02-21 04:21:27,107 INFO L290 TraceCheckUtils]: 10: Hoare triple {18738#true} assume { :end_inline_update_b1 } true; {18738#true} is VALID [2022-02-21 04:21:27,107 INFO L290 TraceCheckUtils]: 11: Hoare triple {18738#true} assume 1 == ~d0_req_up~0;assume { :begin_inline_update_d0 } true; {18738#true} is VALID [2022-02-21 04:21:27,107 INFO L290 TraceCheckUtils]: 12: Hoare triple {18738#true} assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; {18740#(= ~d0_ev~0 0)} is VALID [2022-02-21 04:21:27,108 INFO L290 TraceCheckUtils]: 13: Hoare triple {18740#(= ~d0_ev~0 0)} ~d0_req_up~0 := 0; {18740#(= ~d0_ev~0 0)} is VALID [2022-02-21 04:21:27,108 INFO L290 TraceCheckUtils]: 14: Hoare triple {18740#(= ~d0_ev~0 0)} assume { :end_inline_update_d0 } true; {18740#(= ~d0_ev~0 0)} is VALID [2022-02-21 04:21:27,108 INFO L290 TraceCheckUtils]: 15: Hoare triple {18740#(= ~d0_ev~0 0)} assume 1 == ~d1_req_up~0;assume { :begin_inline_update_d1 } true; {18740#(= ~d0_ev~0 0)} is VALID [2022-02-21 04:21:27,108 INFO L290 TraceCheckUtils]: 16: Hoare triple {18740#(= ~d0_ev~0 0)} assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; {18740#(= ~d0_ev~0 0)} is VALID [2022-02-21 04:21:27,109 INFO L290 TraceCheckUtils]: 17: Hoare triple {18740#(= ~d0_ev~0 0)} ~d1_req_up~0 := 0; {18740#(= ~d0_ev~0 0)} is VALID [2022-02-21 04:21:27,109 INFO L290 TraceCheckUtils]: 18: Hoare triple {18740#(= ~d0_ev~0 0)} assume { :end_inline_update_d1 } true; {18740#(= ~d0_ev~0 0)} is VALID [2022-02-21 04:21:27,109 INFO L290 TraceCheckUtils]: 19: Hoare triple {18740#(= ~d0_ev~0 0)} assume !(1 == ~z_req_up~0); {18740#(= ~d0_ev~0 0)} is VALID [2022-02-21 04:21:27,109 INFO L290 TraceCheckUtils]: 20: Hoare triple {18740#(= ~d0_ev~0 0)} assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; {18740#(= ~d0_ev~0 0)} is VALID [2022-02-21 04:21:27,109 INFO L290 TraceCheckUtils]: 21: Hoare triple {18740#(= ~d0_ev~0 0)} assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; {18740#(= ~d0_ev~0 0)} is VALID [2022-02-21 04:21:27,110 INFO L290 TraceCheckUtils]: 22: Hoare triple {18740#(= ~d0_ev~0 0)} assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; {18740#(= ~d0_ev~0 0)} is VALID [2022-02-21 04:21:27,110 INFO L290 TraceCheckUtils]: 23: Hoare triple {18740#(= ~d0_ev~0 0)} assume 0 == ~b0_ev~0;~b0_ev~0 := 1; {18740#(= ~d0_ev~0 0)} is VALID [2022-02-21 04:21:27,110 INFO L290 TraceCheckUtils]: 24: Hoare triple {18740#(= ~d0_ev~0 0)} assume 0 == ~b1_ev~0;~b1_ev~0 := 1; {18740#(= ~d0_ev~0 0)} is VALID [2022-02-21 04:21:27,110 INFO L290 TraceCheckUtils]: 25: Hoare triple {18740#(= ~d0_ev~0 0)} assume !(0 == ~d0_ev~0); {18739#false} is VALID [2022-02-21 04:21:27,111 INFO L290 TraceCheckUtils]: 26: Hoare triple {18739#false} assume 0 == ~d1_ev~0;~d1_ev~0 := 1; {18739#false} is VALID [2022-02-21 04:21:27,111 INFO L290 TraceCheckUtils]: 27: Hoare triple {18739#false} assume !(0 == ~z_ev~0); {18739#false} is VALID [2022-02-21 04:21:27,111 INFO L290 TraceCheckUtils]: 28: Hoare triple {18739#false} assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; {18739#false} is VALID [2022-02-21 04:21:27,111 INFO L290 TraceCheckUtils]: 29: Hoare triple {18739#false} assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; {18739#false} is VALID [2022-02-21 04:21:27,111 INFO L290 TraceCheckUtils]: 30: Hoare triple {18739#false} is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; {18739#false} is VALID [2022-02-21 04:21:27,111 INFO L290 TraceCheckUtils]: 31: Hoare triple {18739#false} activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; {18739#false} is VALID [2022-02-21 04:21:27,111 INFO L290 TraceCheckUtils]: 32: Hoare triple {18739#false} assume !(0 != activate_threads_~tmp~1#1); {18739#false} is VALID [2022-02-21 04:21:27,111 INFO L290 TraceCheckUtils]: 33: Hoare triple {18739#false} assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; {18739#false} is VALID [2022-02-21 04:21:27,111 INFO L290 TraceCheckUtils]: 34: Hoare triple {18739#false} assume 1 == ~b0_ev~0;~b0_ev~0 := 2; {18739#false} is VALID [2022-02-21 04:21:27,112 INFO L290 TraceCheckUtils]: 35: Hoare triple {18739#false} assume !(1 == ~b1_ev~0); {18739#false} is VALID [2022-02-21 04:21:27,112 INFO L290 TraceCheckUtils]: 36: Hoare triple {18739#false} assume !(1 == ~d0_ev~0); {18739#false} is VALID [2022-02-21 04:21:27,112 INFO L290 TraceCheckUtils]: 37: Hoare triple {18739#false} assume 1 == ~d1_ev~0;~d1_ev~0 := 2; {18739#false} is VALID [2022-02-21 04:21:27,112 INFO L290 TraceCheckUtils]: 38: Hoare triple {18739#false} assume !(1 == ~z_ev~0); {18739#false} is VALID [2022-02-21 04:21:27,112 INFO L290 TraceCheckUtils]: 39: Hoare triple {18739#false} assume { :end_inline_reset_delta_events } true; {18739#false} is VALID [2022-02-21 04:21:27,112 INFO L290 TraceCheckUtils]: 40: Hoare triple {18739#false} assume !false; {18739#false} is VALID [2022-02-21 04:21:27,112 INFO L290 TraceCheckUtils]: 41: Hoare triple {18739#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1; {18739#false} is VALID [2022-02-21 04:21:27,112 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:21:27,113 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:27,113 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492061644] [2022-02-21 04:21:27,113 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492061644] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:27,113 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:27,113 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:21:27,113 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521497346] [2022-02-21 04:21:27,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:27,114 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:21:27,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:27,114 INFO L85 PathProgramCache]: Analyzing trace with hash 831114558, now seen corresponding path program 1 times [2022-02-21 04:21:27,114 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:27,114 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1809580025] [2022-02-21 04:21:27,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:27,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:27,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:27,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {18741#true} assume !false; {18741#true} is VALID [2022-02-21 04:21:27,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {18741#true} assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; {18741#true} is VALID [2022-02-21 04:21:27,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {18741#true} assume !(0 == ~comp_m1_st~0);exists_runnable_thread_~__retres1~1#1 := 0; {18743#(and (<= 0 |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1|) (<= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 0))} is VALID [2022-02-21 04:21:27,150 INFO L290 TraceCheckUtils]: 3: Hoare triple {18743#(and (<= 0 |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1|) (<= |ULTIMATE.start_exists_runnable_thread_~__retres1~1#1| 0))} exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; {18744#(and (<= |ULTIMATE.start_exists_runnable_thread_#res#1| 0) (<= 0 |ULTIMATE.start_exists_runnable_thread_#res#1|))} is VALID [2022-02-21 04:21:27,150 INFO L290 TraceCheckUtils]: 4: Hoare triple {18744#(and (<= |ULTIMATE.start_exists_runnable_thread_#res#1| 0) (<= 0 |ULTIMATE.start_exists_runnable_thread_#res#1|))} eval_#t~ret4#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___0~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; {18745#(and (<= |ULTIMATE.start_eval_~tmp___0~0#1| 0) (< 0 (+ |ULTIMATE.start_eval_~tmp___0~0#1| 1)))} is VALID [2022-02-21 04:21:27,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {18745#(and (<= |ULTIMATE.start_eval_~tmp___0~0#1| 0) (< 0 (+ |ULTIMATE.start_eval_~tmp___0~0#1| 1)))} assume 0 != eval_~tmp___0~0#1; {18742#false} is VALID [2022-02-21 04:21:27,151 INFO L290 TraceCheckUtils]: 6: Hoare triple {18742#false} assume !(0 == ~comp_m1_st~0); {18742#false} is VALID [2022-02-21 04:21:27,151 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:21:27,151 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:27,151 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1809580025] [2022-02-21 04:21:27,151 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1809580025] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:27,151 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:27,152 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:21:27,152 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087846184] [2022-02-21 04:21:27,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:27,152 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:21:27,152 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:21:27,152 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:21:27,153 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:21:27,153 INFO L87 Difference]: Start difference. First operand 963 states and 1454 transitions. cyclomatic complexity: 500 Second operand has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:27,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:27,440 INFO L93 Difference]: Finished difference Result 1053 states and 1544 transitions. [2022-02-21 04:21:27,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 04:21:27,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:27,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:21:27,445 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1053 states and 1544 transitions. [2022-02-21 04:21:27,473 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 428 [2022-02-21 04:21:27,501 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1053 states to 1053 states and 1544 transitions. [2022-02-21 04:21:27,501 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 488 [2022-02-21 04:21:27,502 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 488 [2022-02-21 04:21:27,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1053 states and 1544 transitions. [2022-02-21 04:21:27,502 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:21:27,502 INFO L681 BuchiCegarLoop]: Abstraction has 1053 states and 1544 transitions. [2022-02-21 04:21:27,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1053 states and 1544 transitions. [2022-02-21 04:21:27,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1053 to 963. [2022-02-21 04:21:27,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:21:27,512 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1053 states and 1544 transitions. Second operand has 963 states, 963 states have (on average 1.5005192107995846) internal successors, (1445), 962 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:27,512 INFO L74 IsIncluded]: Start isIncluded. First operand 1053 states and 1544 transitions. Second operand has 963 states, 963 states have (on average 1.5005192107995846) internal successors, (1445), 962 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:27,513 INFO L87 Difference]: Start difference. First operand 1053 states and 1544 transitions. Second operand has 963 states, 963 states have (on average 1.5005192107995846) internal successors, (1445), 962 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:27,514 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:21:27,544 INFO L93 Difference]: Finished difference Result 1056 states and 1548 transitions. [2022-02-21 04:21:27,544 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1548 transitions. [2022-02-21 04:21:27,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:27,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:27,547 INFO L74 IsIncluded]: Start isIncluded. First operand has 963 states, 963 states have (on average 1.5005192107995846) internal successors, (1445), 962 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1053 states and 1544 transitions. [2022-02-21 04:21:27,548 INFO L87 Difference]: Start difference. First operand has 963 states, 963 states have (on average 1.5005192107995846) internal successors, (1445), 962 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1053 states and 1544 transitions. [2022-02-21 04:21:27,549 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:21:27,579 INFO L93 Difference]: Finished difference Result 1056 states and 1548 transitions. [2022-02-21 04:21:27,580 INFO L276 IsEmpty]: Start isEmpty. Operand 1056 states and 1548 transitions. [2022-02-21 04:21:27,581 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:27,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:27,581 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:21:27,581 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:21:27,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 963 states, 963 states have (on average 1.5005192107995846) internal successors, (1445), 962 states have internal predecessors, (1445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:27,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 963 states to 963 states and 1445 transitions. [2022-02-21 04:21:27,606 INFO L704 BuchiCegarLoop]: Abstraction has 963 states and 1445 transitions. [2022-02-21 04:21:27,606 INFO L587 BuchiCegarLoop]: Abstraction has 963 states and 1445 transitions. [2022-02-21 04:21:27,606 INFO L425 BuchiCegarLoop]: ======== Iteration 13============ [2022-02-21 04:21:27,606 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 963 states and 1445 transitions. [2022-02-21 04:21:27,608 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 388 [2022-02-21 04:21:27,608 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:21:27,609 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:21:27,609 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:27,609 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:27,609 INFO L791 eck$LassoCheckResult]: Stem: 20040#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(16, 2);call #Ultimate.allocInit(12, 3);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 19918#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~2#1;havoc main_~__retres1~2#1;assume { :begin_inline_init_model } true;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 19849#L490 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret8#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 19850#L212 assume 1 == ~b0_req_up~0;assume { :begin_inline_update_b0 } true; 19962#L137 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 19963#L137-2 ~b0_req_up~0 := 0; 19952#L145 assume { :end_inline_update_b0 } true; 19953#L212-2 assume 1 == ~b1_req_up~0;assume { :begin_inline_update_b1 } true; 19882#L152 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 19883#L152-2 ~b1_req_up~0 := 0; 20002#L160 assume { :end_inline_update_b1 } true; 19998#L219-1 assume 1 == ~d0_req_up~0;assume { :begin_inline_update_d0 } true; 19853#L167 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 19854#L167-2 ~d0_req_up~0 := 0; 19816#L175 assume { :end_inline_update_d0 } true; 19817#L226-1 assume 1 == ~d1_req_up~0;assume { :begin_inline_update_d1 } true; 19919#L182 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 19858#L182-2 ~d1_req_up~0 := 0; 19859#L190 assume { :end_inline_update_d1 } true; 19961#L233-1 assume !(1 == ~z_req_up~0); 19969#L240-1 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 19843#L255 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 19844#L255-2 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 19970#L321 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 19971#L321-2 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 19870#L326-1 assume !(0 == ~d0_ev~0); 19871#L331-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 19822#L336-1 assume !(0 == ~z_ev~0); 19823#L341-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; 20046#L107 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; 20034#L129 is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; 19944#L130 activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; 19945#L390 assume !(0 != activate_threads_~tmp~1#1); 20056#L390-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 19943#L354 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 19910#L354-2 assume !(1 == ~b1_ev~0); 19911#L359-1 assume !(1 == ~d0_ev~0); 19916#L364-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 19917#L369-1 assume !(1 == ~z_ev~0); 19922#L374-1 assume { :end_inline_reset_delta_events } true; 20010#L432-2 assume !false; 20334#L433 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1; 20335#L295 [2022-02-21 04:21:27,609 INFO L793 eck$LassoCheckResult]: Loop: 20335#L295 assume !false; 20191#L286 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; 20188#L268 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; 20025#L275 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; 20026#L276 eval_#t~ret4#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___0~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; 20444#L290 assume 0 != eval_~tmp___0~0#1; 20442#L290-1 assume !(0 == ~comp_m1_st~0); 20335#L295 [2022-02-21 04:21:27,610 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:27,610 INFO L85 PathProgramCache]: Analyzing trace with hash 1995676522, now seen corresponding path program 2 times [2022-02-21 04:21:27,610 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:27,610 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765805363] [2022-02-21 04:21:27,610 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:27,610 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:27,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:27,622 INFO L290 TraceCheckUtils]: 0: Hoare triple {24004#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(16, 2);call #Ultimate.allocInit(12, 3);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; {24004#true} is VALID [2022-02-21 04:21:27,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {24004#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~2#1;havoc main_~__retres1~2#1;assume { :begin_inline_init_model } true;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; {24004#true} is VALID [2022-02-21 04:21:27,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {24004#true} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret8#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; {24004#true} is VALID [2022-02-21 04:21:27,623 INFO L290 TraceCheckUtils]: 3: Hoare triple {24004#true} assume 1 == ~b0_req_up~0;assume { :begin_inline_update_b0 } true; {24004#true} is VALID [2022-02-21 04:21:27,623 INFO L290 TraceCheckUtils]: 4: Hoare triple {24004#true} assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; {24004#true} is VALID [2022-02-21 04:21:27,623 INFO L290 TraceCheckUtils]: 5: Hoare triple {24004#true} ~b0_req_up~0 := 0; {24004#true} is VALID [2022-02-21 04:21:27,623 INFO L290 TraceCheckUtils]: 6: Hoare triple {24004#true} assume { :end_inline_update_b0 } true; {24004#true} is VALID [2022-02-21 04:21:27,623 INFO L290 TraceCheckUtils]: 7: Hoare triple {24004#true} assume 1 == ~b1_req_up~0;assume { :begin_inline_update_b1 } true; {24004#true} is VALID [2022-02-21 04:21:27,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {24004#true} assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; {24004#true} is VALID [2022-02-21 04:21:27,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {24004#true} ~b1_req_up~0 := 0; {24004#true} is VALID [2022-02-21 04:21:27,623 INFO L290 TraceCheckUtils]: 10: Hoare triple {24004#true} assume { :end_inline_update_b1 } true; {24004#true} is VALID [2022-02-21 04:21:27,624 INFO L290 TraceCheckUtils]: 11: Hoare triple {24004#true} assume 1 == ~d0_req_up~0;assume { :begin_inline_update_d0 } true; {24004#true} is VALID [2022-02-21 04:21:27,624 INFO L290 TraceCheckUtils]: 12: Hoare triple {24004#true} assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; {24006#(= ~d0_ev~0 0)} is VALID [2022-02-21 04:21:27,624 INFO L290 TraceCheckUtils]: 13: Hoare triple {24006#(= ~d0_ev~0 0)} ~d0_req_up~0 := 0; {24006#(= ~d0_ev~0 0)} is VALID [2022-02-21 04:21:27,624 INFO L290 TraceCheckUtils]: 14: Hoare triple {24006#(= ~d0_ev~0 0)} assume { :end_inline_update_d0 } true; {24006#(= ~d0_ev~0 0)} is VALID [2022-02-21 04:21:27,625 INFO L290 TraceCheckUtils]: 15: Hoare triple {24006#(= ~d0_ev~0 0)} assume 1 == ~d1_req_up~0;assume { :begin_inline_update_d1 } true; {24006#(= ~d0_ev~0 0)} is VALID [2022-02-21 04:21:27,625 INFO L290 TraceCheckUtils]: 16: Hoare triple {24006#(= ~d0_ev~0 0)} assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; {24006#(= ~d0_ev~0 0)} is VALID [2022-02-21 04:21:27,625 INFO L290 TraceCheckUtils]: 17: Hoare triple {24006#(= ~d0_ev~0 0)} ~d1_req_up~0 := 0; {24006#(= ~d0_ev~0 0)} is VALID [2022-02-21 04:21:27,625 INFO L290 TraceCheckUtils]: 18: Hoare triple {24006#(= ~d0_ev~0 0)} assume { :end_inline_update_d1 } true; {24006#(= ~d0_ev~0 0)} is VALID [2022-02-21 04:21:27,626 INFO L290 TraceCheckUtils]: 19: Hoare triple {24006#(= ~d0_ev~0 0)} assume !(1 == ~z_req_up~0); {24006#(= ~d0_ev~0 0)} is VALID [2022-02-21 04:21:27,626 INFO L290 TraceCheckUtils]: 20: Hoare triple {24006#(= ~d0_ev~0 0)} assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; {24006#(= ~d0_ev~0 0)} is VALID [2022-02-21 04:21:27,626 INFO L290 TraceCheckUtils]: 21: Hoare triple {24006#(= ~d0_ev~0 0)} assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; {24006#(= ~d0_ev~0 0)} is VALID [2022-02-21 04:21:27,626 INFO L290 TraceCheckUtils]: 22: Hoare triple {24006#(= ~d0_ev~0 0)} assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; {24006#(= ~d0_ev~0 0)} is VALID [2022-02-21 04:21:27,627 INFO L290 TraceCheckUtils]: 23: Hoare triple {24006#(= ~d0_ev~0 0)} assume 0 == ~b0_ev~0;~b0_ev~0 := 1; {24006#(= ~d0_ev~0 0)} is VALID [2022-02-21 04:21:27,627 INFO L290 TraceCheckUtils]: 24: Hoare triple {24006#(= ~d0_ev~0 0)} assume 0 == ~b1_ev~0;~b1_ev~0 := 1; {24006#(= ~d0_ev~0 0)} is VALID [2022-02-21 04:21:27,627 INFO L290 TraceCheckUtils]: 25: Hoare triple {24006#(= ~d0_ev~0 0)} assume !(0 == ~d0_ev~0); {24005#false} is VALID [2022-02-21 04:21:27,627 INFO L290 TraceCheckUtils]: 26: Hoare triple {24005#false} assume 0 == ~d1_ev~0;~d1_ev~0 := 1; {24005#false} is VALID [2022-02-21 04:21:27,627 INFO L290 TraceCheckUtils]: 27: Hoare triple {24005#false} assume !(0 == ~z_ev~0); {24005#false} is VALID [2022-02-21 04:21:27,628 INFO L290 TraceCheckUtils]: 28: Hoare triple {24005#false} assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; {24005#false} is VALID [2022-02-21 04:21:27,628 INFO L290 TraceCheckUtils]: 29: Hoare triple {24005#false} assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; {24005#false} is VALID [2022-02-21 04:21:27,628 INFO L290 TraceCheckUtils]: 30: Hoare triple {24005#false} is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; {24005#false} is VALID [2022-02-21 04:21:27,628 INFO L290 TraceCheckUtils]: 31: Hoare triple {24005#false} activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; {24005#false} is VALID [2022-02-21 04:21:27,628 INFO L290 TraceCheckUtils]: 32: Hoare triple {24005#false} assume !(0 != activate_threads_~tmp~1#1); {24005#false} is VALID [2022-02-21 04:21:27,628 INFO L290 TraceCheckUtils]: 33: Hoare triple {24005#false} assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; {24005#false} is VALID [2022-02-21 04:21:27,628 INFO L290 TraceCheckUtils]: 34: Hoare triple {24005#false} assume 1 == ~b0_ev~0;~b0_ev~0 := 2; {24005#false} is VALID [2022-02-21 04:21:27,628 INFO L290 TraceCheckUtils]: 35: Hoare triple {24005#false} assume !(1 == ~b1_ev~0); {24005#false} is VALID [2022-02-21 04:21:27,628 INFO L290 TraceCheckUtils]: 36: Hoare triple {24005#false} assume !(1 == ~d0_ev~0); {24005#false} is VALID [2022-02-21 04:21:27,629 INFO L290 TraceCheckUtils]: 37: Hoare triple {24005#false} assume 1 == ~d1_ev~0;~d1_ev~0 := 2; {24005#false} is VALID [2022-02-21 04:21:27,629 INFO L290 TraceCheckUtils]: 38: Hoare triple {24005#false} assume !(1 == ~z_ev~0); {24005#false} is VALID [2022-02-21 04:21:27,629 INFO L290 TraceCheckUtils]: 39: Hoare triple {24005#false} assume { :end_inline_reset_delta_events } true; {24005#false} is VALID [2022-02-21 04:21:27,629 INFO L290 TraceCheckUtils]: 40: Hoare triple {24005#false} assume !false; {24005#false} is VALID [2022-02-21 04:21:27,629 INFO L290 TraceCheckUtils]: 41: Hoare triple {24005#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1; {24005#false} is VALID [2022-02-21 04:21:27,629 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:21:27,629 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:27,629 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765805363] [2022-02-21 04:21:27,630 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765805363] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:27,630 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:27,630 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:21:27,630 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1835860681] [2022-02-21 04:21:27,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:27,630 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:21:27,630 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:27,631 INFO L85 PathProgramCache]: Analyzing trace with hash 829267516, now seen corresponding path program 1 times [2022-02-21 04:21:27,631 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:27,631 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [547883344] [2022-02-21 04:21:27,631 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:27,631 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:27,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:27,637 INFO L290 TraceCheckUtils]: 0: Hoare triple {24007#true} assume !false; {24007#true} is VALID [2022-02-21 04:21:27,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {24007#true} assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; {24007#true} is VALID [2022-02-21 04:21:27,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {24007#true} assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; {24009#(= ~comp_m1_st~0 0)} is VALID [2022-02-21 04:21:27,637 INFO L290 TraceCheckUtils]: 3: Hoare triple {24009#(= ~comp_m1_st~0 0)} exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; {24009#(= ~comp_m1_st~0 0)} is VALID [2022-02-21 04:21:27,638 INFO L290 TraceCheckUtils]: 4: Hoare triple {24009#(= ~comp_m1_st~0 0)} eval_#t~ret4#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___0~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; {24009#(= ~comp_m1_st~0 0)} is VALID [2022-02-21 04:21:27,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {24009#(= ~comp_m1_st~0 0)} assume 0 != eval_~tmp___0~0#1; {24009#(= ~comp_m1_st~0 0)} is VALID [2022-02-21 04:21:27,638 INFO L290 TraceCheckUtils]: 6: Hoare triple {24009#(= ~comp_m1_st~0 0)} assume !(0 == ~comp_m1_st~0); {24008#false} is VALID [2022-02-21 04:21:27,638 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:21:27,638 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:27,639 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [547883344] [2022-02-21 04:21:27,639 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [547883344] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:27,639 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:27,639 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 04:21:27,639 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1995737591] [2022-02-21 04:21:27,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:27,639 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:21:27,639 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:21:27,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:21:27,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:21:27,640 INFO L87 Difference]: Start difference. First operand 963 states and 1445 transitions. cyclomatic complexity: 491 Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:27,775 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:27,775 INFO L93 Difference]: Finished difference Result 1188 states and 1749 transitions. [2022-02-21 04:21:27,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:21:27,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:27,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:21:27,780 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1188 states and 1749 transitions. [2022-02-21 04:21:27,822 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 468 [2022-02-21 04:21:27,854 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1188 states to 1188 states and 1749 transitions. [2022-02-21 04:21:27,854 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 563 [2022-02-21 04:21:27,854 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 563 [2022-02-21 04:21:27,854 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1188 states and 1749 transitions. [2022-02-21 04:21:27,855 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:21:27,855 INFO L681 BuchiCegarLoop]: Abstraction has 1188 states and 1749 transitions. [2022-02-21 04:21:27,855 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1188 states and 1749 transitions. [2022-02-21 04:21:27,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1188 to 1188. [2022-02-21 04:21:27,863 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:21:27,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1188 states and 1749 transitions. Second operand has 1188 states, 1188 states have (on average 1.4722222222222223) internal successors, (1749), 1187 states have internal predecessors, (1749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:27,865 INFO L74 IsIncluded]: Start isIncluded. First operand 1188 states and 1749 transitions. Second operand has 1188 states, 1188 states have (on average 1.4722222222222223) internal successors, (1749), 1187 states have internal predecessors, (1749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:27,866 INFO L87 Difference]: Start difference. First operand 1188 states and 1749 transitions. Second operand has 1188 states, 1188 states have (on average 1.4722222222222223) internal successors, (1749), 1187 states have internal predecessors, (1749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:27,867 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:21:27,901 INFO L93 Difference]: Finished difference Result 1194 states and 1757 transitions. [2022-02-21 04:21:27,901 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1757 transitions. [2022-02-21 04:21:27,903 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:27,903 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:27,904 INFO L74 IsIncluded]: Start isIncluded. First operand has 1188 states, 1188 states have (on average 1.4722222222222223) internal successors, (1749), 1187 states have internal predecessors, (1749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1188 states and 1749 transitions. [2022-02-21 04:21:27,905 INFO L87 Difference]: Start difference. First operand has 1188 states, 1188 states have (on average 1.4722222222222223) internal successors, (1749), 1187 states have internal predecessors, (1749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1188 states and 1749 transitions. [2022-02-21 04:21:27,906 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:21:27,940 INFO L93 Difference]: Finished difference Result 1194 states and 1757 transitions. [2022-02-21 04:21:27,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1194 states and 1757 transitions. [2022-02-21 04:21:27,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:27,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:27,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:21:27,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:21:27,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1188 states, 1188 states have (on average 1.4722222222222223) internal successors, (1749), 1187 states have internal predecessors, (1749), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:27,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1188 states to 1188 states and 1749 transitions. [2022-02-21 04:21:27,974 INFO L704 BuchiCegarLoop]: Abstraction has 1188 states and 1749 transitions. [2022-02-21 04:21:27,974 INFO L587 BuchiCegarLoop]: Abstraction has 1188 states and 1749 transitions. [2022-02-21 04:21:27,974 INFO L425 BuchiCegarLoop]: ======== Iteration 14============ [2022-02-21 04:21:27,974 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1188 states and 1749 transitions. [2022-02-21 04:21:27,977 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 468 [2022-02-21 04:21:27,977 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:21:27,977 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:21:27,978 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:27,978 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:27,978 INFO L791 eck$LassoCheckResult]: Stem: 25416#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(16, 2);call #Ultimate.allocInit(12, 3);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 25307#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~2#1;havoc main_~__retres1~2#1;assume { :begin_inline_init_model } true;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 25243#L490 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret8#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 25244#L212 assume 1 == ~b0_req_up~0;assume { :begin_inline_update_b0 } true; 25349#L137 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 25350#L137-2 ~b0_req_up~0 := 0; 25340#L145 assume { :end_inline_update_b0 } true; 25341#L212-2 assume 1 == ~b1_req_up~0;assume { :begin_inline_update_b1 } true; 25272#L152 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 25273#L152-2 ~b1_req_up~0 := 0; 25386#L160 assume { :end_inline_update_b1 } true; 25383#L219-1 assume 1 == ~d0_req_up~0;assume { :begin_inline_update_d0 } true; 25248#L167 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 25249#L167-2 ~d0_req_up~0 := 0; 25208#L175 assume { :end_inline_update_d0 } true; 25209#L226-1 assume 1 == ~d1_req_up~0;assume { :begin_inline_update_d1 } true; 25310#L182 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 25257#L182-2 ~d1_req_up~0 := 0; 25258#L190 assume { :end_inline_update_d1 } true; 25348#L233-1 assume !(1 == ~z_req_up~0); 25356#L240-1 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 25240#L255 assume 1 == ~comp_m1_i~0;~comp_m1_st~0 := 0; 25241#L255-2 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 25357#L321 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 25358#L321-2 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 25266#L326-1 assume !(0 == ~d0_ev~0); 25267#L331-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 25220#L336-1 assume !(0 == ~z_ev~0); 25221#L341-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; 25423#L107 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; 25424#L129 is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; 25433#L130 activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; 25387#L390 assume !(0 != activate_threads_~tmp~1#1); 25388#L390-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 25331#L354 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 25303#L354-2 assume !(1 == ~b1_ev~0); 25304#L359-1 assume !(1 == ~d0_ev~0); 25305#L364-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 25306#L369-1 assume !(1 == ~z_ev~0); 25315#L374-1 assume { :end_inline_reset_delta_events } true; 25396#L432-2 assume !false; 25912#L433 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1; 25296#L295 [2022-02-21 04:21:27,978 INFO L793 eck$LassoCheckResult]: Loop: 25296#L295 assume !false; 25456#L286 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; 26022#L268 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; 25405#L275 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; 25198#L276 eval_#t~ret4#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___0~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; 25199#L290 assume 0 != eval_~tmp___0~0#1; 25414#L290-1 assume 0 == ~comp_m1_st~0;eval_~tmp~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 25295#L299 assume !(0 != eval_~tmp~0#1); 25296#L295 [2022-02-21 04:21:27,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:27,979 INFO L85 PathProgramCache]: Analyzing trace with hash 1572974696, now seen corresponding path program 1 times [2022-02-21 04:21:27,979 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:27,979 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [513336460] [2022-02-21 04:21:27,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:27,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:27,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:28,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {30169#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(16, 2);call #Ultimate.allocInit(12, 3);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; {30169#true} is VALID [2022-02-21 04:21:28,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {30169#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~2#1;havoc main_~__retres1~2#1;assume { :begin_inline_init_model } true;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; {30171#(and (= ~comp_m1_i~0 ~b0_val~0) (= ~b0_val_t~0 1))} is VALID [2022-02-21 04:21:28,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {30171#(and (= ~comp_m1_i~0 ~b0_val~0) (= ~b0_val_t~0 1))} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret8#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; {30171#(and (= ~comp_m1_i~0 ~b0_val~0) (= ~b0_val_t~0 1))} is VALID [2022-02-21 04:21:28,001 INFO L290 TraceCheckUtils]: 3: Hoare triple {30171#(and (= ~comp_m1_i~0 ~b0_val~0) (= ~b0_val_t~0 1))} assume 1 == ~b0_req_up~0;assume { :begin_inline_update_b0 } true; {30171#(and (= ~comp_m1_i~0 ~b0_val~0) (= ~b0_val_t~0 1))} is VALID [2022-02-21 04:21:28,001 INFO L290 TraceCheckUtils]: 4: Hoare triple {30171#(and (= ~comp_m1_i~0 ~b0_val~0) (= ~b0_val_t~0 1))} assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; {30172#(not (= ~comp_m1_i~0 1))} is VALID [2022-02-21 04:21:28,002 INFO L290 TraceCheckUtils]: 5: Hoare triple {30172#(not (= ~comp_m1_i~0 1))} ~b0_req_up~0 := 0; {30172#(not (= ~comp_m1_i~0 1))} is VALID [2022-02-21 04:21:28,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {30172#(not (= ~comp_m1_i~0 1))} assume { :end_inline_update_b0 } true; {30172#(not (= ~comp_m1_i~0 1))} is VALID [2022-02-21 04:21:28,002 INFO L290 TraceCheckUtils]: 7: Hoare triple {30172#(not (= ~comp_m1_i~0 1))} assume 1 == ~b1_req_up~0;assume { :begin_inline_update_b1 } true; {30172#(not (= ~comp_m1_i~0 1))} is VALID [2022-02-21 04:21:28,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {30172#(not (= ~comp_m1_i~0 1))} assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; {30172#(not (= ~comp_m1_i~0 1))} is VALID [2022-02-21 04:21:28,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {30172#(not (= ~comp_m1_i~0 1))} ~b1_req_up~0 := 0; {30172#(not (= ~comp_m1_i~0 1))} is VALID [2022-02-21 04:21:28,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {30172#(not (= ~comp_m1_i~0 1))} assume { :end_inline_update_b1 } true; {30172#(not (= ~comp_m1_i~0 1))} is VALID [2022-02-21 04:21:28,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {30172#(not (= ~comp_m1_i~0 1))} assume 1 == ~d0_req_up~0;assume { :begin_inline_update_d0 } true; {30172#(not (= ~comp_m1_i~0 1))} is VALID [2022-02-21 04:21:28,004 INFO L290 TraceCheckUtils]: 12: Hoare triple {30172#(not (= ~comp_m1_i~0 1))} assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; {30172#(not (= ~comp_m1_i~0 1))} is VALID [2022-02-21 04:21:28,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {30172#(not (= ~comp_m1_i~0 1))} ~d0_req_up~0 := 0; {30172#(not (= ~comp_m1_i~0 1))} is VALID [2022-02-21 04:21:28,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {30172#(not (= ~comp_m1_i~0 1))} assume { :end_inline_update_d0 } true; {30172#(not (= ~comp_m1_i~0 1))} is VALID [2022-02-21 04:21:28,004 INFO L290 TraceCheckUtils]: 15: Hoare triple {30172#(not (= ~comp_m1_i~0 1))} assume 1 == ~d1_req_up~0;assume { :begin_inline_update_d1 } true; {30172#(not (= ~comp_m1_i~0 1))} is VALID [2022-02-21 04:21:28,005 INFO L290 TraceCheckUtils]: 16: Hoare triple {30172#(not (= ~comp_m1_i~0 1))} assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; {30172#(not (= ~comp_m1_i~0 1))} is VALID [2022-02-21 04:21:28,005 INFO L290 TraceCheckUtils]: 17: Hoare triple {30172#(not (= ~comp_m1_i~0 1))} ~d1_req_up~0 := 0; {30172#(not (= ~comp_m1_i~0 1))} is VALID [2022-02-21 04:21:28,005 INFO L290 TraceCheckUtils]: 18: Hoare triple {30172#(not (= ~comp_m1_i~0 1))} assume { :end_inline_update_d1 } true; {30172#(not (= ~comp_m1_i~0 1))} is VALID [2022-02-21 04:21:28,005 INFO L290 TraceCheckUtils]: 19: Hoare triple {30172#(not (= ~comp_m1_i~0 1))} assume !(1 == ~z_req_up~0); {30172#(not (= ~comp_m1_i~0 1))} is VALID [2022-02-21 04:21:28,006 INFO L290 TraceCheckUtils]: 20: Hoare triple {30172#(not (= ~comp_m1_i~0 1))} assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; {30172#(not (= ~comp_m1_i~0 1))} is VALID [2022-02-21 04:21:28,006 INFO L290 TraceCheckUtils]: 21: Hoare triple {30172#(not (= ~comp_m1_i~0 1))} assume 1 == ~comp_m1_i~0;~comp_m1_st~0 := 0; {30170#false} is VALID [2022-02-21 04:21:28,006 INFO L290 TraceCheckUtils]: 22: Hoare triple {30170#false} assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; {30170#false} is VALID [2022-02-21 04:21:28,006 INFO L290 TraceCheckUtils]: 23: Hoare triple {30170#false} assume 0 == ~b0_ev~0;~b0_ev~0 := 1; {30170#false} is VALID [2022-02-21 04:21:28,006 INFO L290 TraceCheckUtils]: 24: Hoare triple {30170#false} assume 0 == ~b1_ev~0;~b1_ev~0 := 1; {30170#false} is VALID [2022-02-21 04:21:28,006 INFO L290 TraceCheckUtils]: 25: Hoare triple {30170#false} assume !(0 == ~d0_ev~0); {30170#false} is VALID [2022-02-21 04:21:28,006 INFO L290 TraceCheckUtils]: 26: Hoare triple {30170#false} assume 0 == ~d1_ev~0;~d1_ev~0 := 1; {30170#false} is VALID [2022-02-21 04:21:28,007 INFO L290 TraceCheckUtils]: 27: Hoare triple {30170#false} assume !(0 == ~z_ev~0); {30170#false} is VALID [2022-02-21 04:21:28,007 INFO L290 TraceCheckUtils]: 28: Hoare triple {30170#false} assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; {30170#false} is VALID [2022-02-21 04:21:28,007 INFO L290 TraceCheckUtils]: 29: Hoare triple {30170#false} assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; {30170#false} is VALID [2022-02-21 04:21:28,007 INFO L290 TraceCheckUtils]: 30: Hoare triple {30170#false} is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; {30170#false} is VALID [2022-02-21 04:21:28,007 INFO L290 TraceCheckUtils]: 31: Hoare triple {30170#false} activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; {30170#false} is VALID [2022-02-21 04:21:28,007 INFO L290 TraceCheckUtils]: 32: Hoare triple {30170#false} assume !(0 != activate_threads_~tmp~1#1); {30170#false} is VALID [2022-02-21 04:21:28,007 INFO L290 TraceCheckUtils]: 33: Hoare triple {30170#false} assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; {30170#false} is VALID [2022-02-21 04:21:28,007 INFO L290 TraceCheckUtils]: 34: Hoare triple {30170#false} assume 1 == ~b0_ev~0;~b0_ev~0 := 2; {30170#false} is VALID [2022-02-21 04:21:28,007 INFO L290 TraceCheckUtils]: 35: Hoare triple {30170#false} assume !(1 == ~b1_ev~0); {30170#false} is VALID [2022-02-21 04:21:28,008 INFO L290 TraceCheckUtils]: 36: Hoare triple {30170#false} assume !(1 == ~d0_ev~0); {30170#false} is VALID [2022-02-21 04:21:28,008 INFO L290 TraceCheckUtils]: 37: Hoare triple {30170#false} assume 1 == ~d1_ev~0;~d1_ev~0 := 2; {30170#false} is VALID [2022-02-21 04:21:28,008 INFO L290 TraceCheckUtils]: 38: Hoare triple {30170#false} assume !(1 == ~z_ev~0); {30170#false} is VALID [2022-02-21 04:21:28,008 INFO L290 TraceCheckUtils]: 39: Hoare triple {30170#false} assume { :end_inline_reset_delta_events } true; {30170#false} is VALID [2022-02-21 04:21:28,008 INFO L290 TraceCheckUtils]: 40: Hoare triple {30170#false} assume !false; {30170#false} is VALID [2022-02-21 04:21:28,008 INFO L290 TraceCheckUtils]: 41: Hoare triple {30170#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1; {30170#false} is VALID [2022-02-21 04:21:28,008 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:21:28,008 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:28,009 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [513336460] [2022-02-21 04:21:28,009 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [513336460] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:28,009 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:28,009 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 04:21:28,009 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [756517855] [2022-02-21 04:21:28,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:28,009 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:21:28,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:28,010 INFO L85 PathProgramCache]: Analyzing trace with hash -62512628, now seen corresponding path program 1 times [2022-02-21 04:21:28,010 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:28,010 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140061006] [2022-02-21 04:21:28,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:28,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:28,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:21:28,012 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:21:28,013 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:21:28,014 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:21:28,042 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:21:28,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 04:21:28,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-21 04:21:28,043 INFO L87 Difference]: Start difference. First operand 1188 states and 1749 transitions. cyclomatic complexity: 570 Second operand has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:28,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:28,211 INFO L93 Difference]: Finished difference Result 1165 states and 1712 transitions. [2022-02-21 04:21:28,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-21 04:21:28,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 10.5) internal successors, (42), 4 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:28,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:21:28,234 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1165 states and 1712 transitions. [2022-02-21 04:21:28,266 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 468 [2022-02-21 04:21:28,296 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1165 states to 1165 states and 1712 transitions. [2022-02-21 04:21:28,296 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 540 [2022-02-21 04:21:28,297 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 540 [2022-02-21 04:21:28,297 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1165 states and 1712 transitions. [2022-02-21 04:21:28,297 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:21:28,297 INFO L681 BuchiCegarLoop]: Abstraction has 1165 states and 1712 transitions. [2022-02-21 04:21:28,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1165 states and 1712 transitions. [2022-02-21 04:21:28,306 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1165 to 1165. [2022-02-21 04:21:28,306 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:21:28,307 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1165 states and 1712 transitions. Second operand has 1165 states, 1165 states have (on average 1.4695278969957082) internal successors, (1712), 1164 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:28,308 INFO L74 IsIncluded]: Start isIncluded. First operand 1165 states and 1712 transitions. Second operand has 1165 states, 1165 states have (on average 1.4695278969957082) internal successors, (1712), 1164 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:28,309 INFO L87 Difference]: Start difference. First operand 1165 states and 1712 transitions. Second operand has 1165 states, 1165 states have (on average 1.4695278969957082) internal successors, (1712), 1164 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:28,309 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:21:28,341 INFO L93 Difference]: Finished difference Result 1171 states and 1720 transitions. [2022-02-21 04:21:28,342 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1720 transitions. [2022-02-21 04:21:28,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:28,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:28,345 INFO L74 IsIncluded]: Start isIncluded. First operand has 1165 states, 1165 states have (on average 1.4695278969957082) internal successors, (1712), 1164 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1165 states and 1712 transitions. [2022-02-21 04:21:28,346 INFO L87 Difference]: Start difference. First operand has 1165 states, 1165 states have (on average 1.4695278969957082) internal successors, (1712), 1164 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1165 states and 1712 transitions. [2022-02-21 04:21:28,346 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:21:28,380 INFO L93 Difference]: Finished difference Result 1171 states and 1720 transitions. [2022-02-21 04:21:28,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1171 states and 1720 transitions. [2022-02-21 04:21:28,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:28,381 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:28,381 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:21:28,381 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:21:28,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1165 states, 1165 states have (on average 1.4695278969957082) internal successors, (1712), 1164 states have internal predecessors, (1712), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:28,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1165 states to 1165 states and 1712 transitions. [2022-02-21 04:21:28,412 INFO L704 BuchiCegarLoop]: Abstraction has 1165 states and 1712 transitions. [2022-02-21 04:21:28,412 INFO L587 BuchiCegarLoop]: Abstraction has 1165 states and 1712 transitions. [2022-02-21 04:21:28,412 INFO L425 BuchiCegarLoop]: ======== Iteration 15============ [2022-02-21 04:21:28,412 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1165 states and 1712 transitions. [2022-02-21 04:21:28,415 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 468 [2022-02-21 04:21:28,415 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:21:28,415 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:21:28,415 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:28,415 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:28,416 INFO L791 eck$LassoCheckResult]: Stem: 31575#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(16, 2);call #Ultimate.allocInit(12, 3);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 31451#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~2#1;havoc main_~__retres1~2#1;assume { :begin_inline_init_model } true;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 31386#L490 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret8#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 31387#L212 assume 1 == ~b0_req_up~0;assume { :begin_inline_update_b0 } true; 31496#L137 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 31497#L137-2 ~b0_req_up~0 := 0; 31486#L145 assume { :end_inline_update_b0 } true; 31487#L212-2 assume 1 == ~b1_req_up~0;assume { :begin_inline_update_b1 } true; 31416#L152 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 31417#L152-2 ~b1_req_up~0 := 0; 31543#L160 assume { :end_inline_update_b1 } true; 31536#L219-1 assume 1 == ~d0_req_up~0;assume { :begin_inline_update_d0 } true; 31390#L167 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 31391#L167-2 ~d0_req_up~0 := 0; 31352#L175 assume { :end_inline_update_d0 } true; 31353#L226-1 assume 1 == ~d1_req_up~0;assume { :begin_inline_update_d1 } true; 31454#L182 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 31399#L182-2 ~d1_req_up~0 := 0; 31400#L190 assume { :end_inline_update_d1 } true; 31495#L233-1 assume !(1 == ~z_req_up~0); 31503#L240-1 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 31384#L255 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 31385#L255-2 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 31504#L321 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 31505#L321-2 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 31535#L326-1 assume !(0 == ~d0_ev~0); 31410#L331-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 31411#L336-1 assume !(0 == ~z_ev~0); 31587#L341-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; 31581#L107 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; 31567#L129 is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; 31568#L130 activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; 31544#L390 assume 0 != activate_threads_~tmp~1#1;~comp_m1_st~0 := 0; 31545#L390-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 31477#L354 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 31447#L354-2 assume !(1 == ~b1_ev~0); 31448#L359-1 assume !(1 == ~d0_ev~0); 31449#L364-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 31450#L369-1 assume !(1 == ~z_ev~0); 31459#L374-1 assume { :end_inline_reset_delta_events } true; 31427#L432-2 assume !false; 31429#L433 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1; 32040#L295 [2022-02-21 04:21:28,416 INFO L793 eck$LassoCheckResult]: Loop: 32040#L295 assume !false; 32045#L286 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; 32044#L268 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; 31764#L275 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; 32043#L276 eval_#t~ret4#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___0~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; 32042#L290 assume 0 != eval_~tmp___0~0#1; 32041#L290-1 assume 0 == ~comp_m1_st~0;eval_~tmp~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 32039#L299 assume !(0 != eval_~tmp~0#1); 32040#L295 [2022-02-21 04:21:28,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:28,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1906263764, now seen corresponding path program 1 times [2022-02-21 04:21:28,417 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:28,417 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229136442] [2022-02-21 04:21:28,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:28,417 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:28,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:28,431 INFO L290 TraceCheckUtils]: 0: Hoare triple {36152#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(16, 2);call #Ultimate.allocInit(12, 3);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; {36152#true} is VALID [2022-02-21 04:21:28,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {36152#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~2#1;havoc main_~__retres1~2#1;assume { :begin_inline_init_model } true;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; {36152#true} is VALID [2022-02-21 04:21:28,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {36152#true} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret8#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; {36152#true} is VALID [2022-02-21 04:21:28,431 INFO L290 TraceCheckUtils]: 3: Hoare triple {36152#true} assume 1 == ~b0_req_up~0;assume { :begin_inline_update_b0 } true; {36152#true} is VALID [2022-02-21 04:21:28,431 INFO L290 TraceCheckUtils]: 4: Hoare triple {36152#true} assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; {36152#true} is VALID [2022-02-21 04:21:28,431 INFO L290 TraceCheckUtils]: 5: Hoare triple {36152#true} ~b0_req_up~0 := 0; {36152#true} is VALID [2022-02-21 04:21:28,431 INFO L290 TraceCheckUtils]: 6: Hoare triple {36152#true} assume { :end_inline_update_b0 } true; {36152#true} is VALID [2022-02-21 04:21:28,432 INFO L290 TraceCheckUtils]: 7: Hoare triple {36152#true} assume 1 == ~b1_req_up~0;assume { :begin_inline_update_b1 } true; {36152#true} is VALID [2022-02-21 04:21:28,432 INFO L290 TraceCheckUtils]: 8: Hoare triple {36152#true} assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; {36152#true} is VALID [2022-02-21 04:21:28,432 INFO L290 TraceCheckUtils]: 9: Hoare triple {36152#true} ~b1_req_up~0 := 0; {36152#true} is VALID [2022-02-21 04:21:28,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {36152#true} assume { :end_inline_update_b1 } true; {36152#true} is VALID [2022-02-21 04:21:28,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {36152#true} assume 1 == ~d0_req_up~0;assume { :begin_inline_update_d0 } true; {36152#true} is VALID [2022-02-21 04:21:28,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {36152#true} assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; {36154#(= ~d0_ev~0 0)} is VALID [2022-02-21 04:21:28,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {36154#(= ~d0_ev~0 0)} ~d0_req_up~0 := 0; {36154#(= ~d0_ev~0 0)} is VALID [2022-02-21 04:21:28,433 INFO L290 TraceCheckUtils]: 14: Hoare triple {36154#(= ~d0_ev~0 0)} assume { :end_inline_update_d0 } true; {36154#(= ~d0_ev~0 0)} is VALID [2022-02-21 04:21:28,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {36154#(= ~d0_ev~0 0)} assume 1 == ~d1_req_up~0;assume { :begin_inline_update_d1 } true; {36154#(= ~d0_ev~0 0)} is VALID [2022-02-21 04:21:28,433 INFO L290 TraceCheckUtils]: 16: Hoare triple {36154#(= ~d0_ev~0 0)} assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; {36154#(= ~d0_ev~0 0)} is VALID [2022-02-21 04:21:28,433 INFO L290 TraceCheckUtils]: 17: Hoare triple {36154#(= ~d0_ev~0 0)} ~d1_req_up~0 := 0; {36154#(= ~d0_ev~0 0)} is VALID [2022-02-21 04:21:28,434 INFO L290 TraceCheckUtils]: 18: Hoare triple {36154#(= ~d0_ev~0 0)} assume { :end_inline_update_d1 } true; {36154#(= ~d0_ev~0 0)} is VALID [2022-02-21 04:21:28,434 INFO L290 TraceCheckUtils]: 19: Hoare triple {36154#(= ~d0_ev~0 0)} assume !(1 == ~z_req_up~0); {36154#(= ~d0_ev~0 0)} is VALID [2022-02-21 04:21:28,434 INFO L290 TraceCheckUtils]: 20: Hoare triple {36154#(= ~d0_ev~0 0)} assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; {36154#(= ~d0_ev~0 0)} is VALID [2022-02-21 04:21:28,434 INFO L290 TraceCheckUtils]: 21: Hoare triple {36154#(= ~d0_ev~0 0)} assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; {36154#(= ~d0_ev~0 0)} is VALID [2022-02-21 04:21:28,435 INFO L290 TraceCheckUtils]: 22: Hoare triple {36154#(= ~d0_ev~0 0)} assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; {36154#(= ~d0_ev~0 0)} is VALID [2022-02-21 04:21:28,435 INFO L290 TraceCheckUtils]: 23: Hoare triple {36154#(= ~d0_ev~0 0)} assume 0 == ~b0_ev~0;~b0_ev~0 := 1; {36154#(= ~d0_ev~0 0)} is VALID [2022-02-21 04:21:28,435 INFO L290 TraceCheckUtils]: 24: Hoare triple {36154#(= ~d0_ev~0 0)} assume 0 == ~b1_ev~0;~b1_ev~0 := 1; {36154#(= ~d0_ev~0 0)} is VALID [2022-02-21 04:21:28,435 INFO L290 TraceCheckUtils]: 25: Hoare triple {36154#(= ~d0_ev~0 0)} assume !(0 == ~d0_ev~0); {36153#false} is VALID [2022-02-21 04:21:28,436 INFO L290 TraceCheckUtils]: 26: Hoare triple {36153#false} assume 0 == ~d1_ev~0;~d1_ev~0 := 1; {36153#false} is VALID [2022-02-21 04:21:28,436 INFO L290 TraceCheckUtils]: 27: Hoare triple {36153#false} assume !(0 == ~z_ev~0); {36153#false} is VALID [2022-02-21 04:21:28,436 INFO L290 TraceCheckUtils]: 28: Hoare triple {36153#false} assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; {36153#false} is VALID [2022-02-21 04:21:28,436 INFO L290 TraceCheckUtils]: 29: Hoare triple {36153#false} assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; {36153#false} is VALID [2022-02-21 04:21:28,436 INFO L290 TraceCheckUtils]: 30: Hoare triple {36153#false} is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; {36153#false} is VALID [2022-02-21 04:21:28,436 INFO L290 TraceCheckUtils]: 31: Hoare triple {36153#false} activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; {36153#false} is VALID [2022-02-21 04:21:28,436 INFO L290 TraceCheckUtils]: 32: Hoare triple {36153#false} assume 0 != activate_threads_~tmp~1#1;~comp_m1_st~0 := 0; {36153#false} is VALID [2022-02-21 04:21:28,436 INFO L290 TraceCheckUtils]: 33: Hoare triple {36153#false} assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; {36153#false} is VALID [2022-02-21 04:21:28,436 INFO L290 TraceCheckUtils]: 34: Hoare triple {36153#false} assume 1 == ~b0_ev~0;~b0_ev~0 := 2; {36153#false} is VALID [2022-02-21 04:21:28,437 INFO L290 TraceCheckUtils]: 35: Hoare triple {36153#false} assume !(1 == ~b1_ev~0); {36153#false} is VALID [2022-02-21 04:21:28,437 INFO L290 TraceCheckUtils]: 36: Hoare triple {36153#false} assume !(1 == ~d0_ev~0); {36153#false} is VALID [2022-02-21 04:21:28,437 INFO L290 TraceCheckUtils]: 37: Hoare triple {36153#false} assume 1 == ~d1_ev~0;~d1_ev~0 := 2; {36153#false} is VALID [2022-02-21 04:21:28,437 INFO L290 TraceCheckUtils]: 38: Hoare triple {36153#false} assume !(1 == ~z_ev~0); {36153#false} is VALID [2022-02-21 04:21:28,437 INFO L290 TraceCheckUtils]: 39: Hoare triple {36153#false} assume { :end_inline_reset_delta_events } true; {36153#false} is VALID [2022-02-21 04:21:28,437 INFO L290 TraceCheckUtils]: 40: Hoare triple {36153#false} assume !false; {36153#false} is VALID [2022-02-21 04:21:28,437 INFO L290 TraceCheckUtils]: 41: Hoare triple {36153#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1; {36153#false} is VALID [2022-02-21 04:21:28,438 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:21:28,438 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:28,438 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229136442] [2022-02-21 04:21:28,438 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229136442] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:28,438 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:28,438 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:21:28,438 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1413062659] [2022-02-21 04:21:28,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:28,439 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:21:28,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:28,439 INFO L85 PathProgramCache]: Analyzing trace with hash -62512628, now seen corresponding path program 2 times [2022-02-21 04:21:28,439 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:28,439 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [409979615] [2022-02-21 04:21:28,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:28,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:28,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:21:28,443 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:21:28,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:21:28,450 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:21:28,474 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:21:28,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:21:28,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:21:28,475 INFO L87 Difference]: Start difference. First operand 1165 states and 1712 transitions. cyclomatic complexity: 556 Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:28,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:28,628 INFO L93 Difference]: Finished difference Result 1252 states and 1830 transitions. [2022-02-21 04:21:28,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:21:28,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:28,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:21:28,648 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1252 states and 1830 transitions. [2022-02-21 04:21:28,683 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 525 [2022-02-21 04:21:28,717 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1252 states to 1252 states and 1830 transitions. [2022-02-21 04:21:28,718 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 597 [2022-02-21 04:21:28,718 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 597 [2022-02-21 04:21:28,718 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1252 states and 1830 transitions. [2022-02-21 04:21:28,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:21:28,718 INFO L681 BuchiCegarLoop]: Abstraction has 1252 states and 1830 transitions. [2022-02-21 04:21:28,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1252 states and 1830 transitions. [2022-02-21 04:21:28,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1252 to 1252. [2022-02-21 04:21:28,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:21:28,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1252 states and 1830 transitions. Second operand has 1252 states, 1252 states have (on average 1.461661341853035) internal successors, (1830), 1251 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:28,729 INFO L74 IsIncluded]: Start isIncluded. First operand 1252 states and 1830 transitions. Second operand has 1252 states, 1252 states have (on average 1.461661341853035) internal successors, (1830), 1251 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:28,730 INFO L87 Difference]: Start difference. First operand 1252 states and 1830 transitions. Second operand has 1252 states, 1252 states have (on average 1.461661341853035) internal successors, (1830), 1251 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:28,731 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:21:28,768 INFO L93 Difference]: Finished difference Result 1258 states and 1838 transitions. [2022-02-21 04:21:28,769 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1838 transitions. [2022-02-21 04:21:28,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:28,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:28,772 INFO L74 IsIncluded]: Start isIncluded. First operand has 1252 states, 1252 states have (on average 1.461661341853035) internal successors, (1830), 1251 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1252 states and 1830 transitions. [2022-02-21 04:21:28,773 INFO L87 Difference]: Start difference. First operand has 1252 states, 1252 states have (on average 1.461661341853035) internal successors, (1830), 1251 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1252 states and 1830 transitions. [2022-02-21 04:21:28,773 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:21:28,812 INFO L93 Difference]: Finished difference Result 1258 states and 1838 transitions. [2022-02-21 04:21:28,812 INFO L276 IsEmpty]: Start isEmpty. Operand 1258 states and 1838 transitions. [2022-02-21 04:21:28,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:28,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:28,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:21:28,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:21:28,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1252 states, 1252 states have (on average 1.461661341853035) internal successors, (1830), 1251 states have internal predecessors, (1830), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:28,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1252 states to 1252 states and 1830 transitions. [2022-02-21 04:21:28,853 INFO L704 BuchiCegarLoop]: Abstraction has 1252 states and 1830 transitions. [2022-02-21 04:21:28,853 INFO L587 BuchiCegarLoop]: Abstraction has 1252 states and 1830 transitions. [2022-02-21 04:21:28,853 INFO L425 BuchiCegarLoop]: ======== Iteration 16============ [2022-02-21 04:21:28,853 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1252 states and 1830 transitions. [2022-02-21 04:21:28,856 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 525 [2022-02-21 04:21:28,856 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:21:28,856 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:21:28,857 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:28,857 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:28,857 INFO L791 eck$LassoCheckResult]: Stem: 37636#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(16, 2);call #Ultimate.allocInit(12, 3);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 37515#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~2#1;havoc main_~__retres1~2#1;assume { :begin_inline_init_model } true;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 37453#L490 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret8#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 37454#L212 assume 1 == ~b0_req_up~0;assume { :begin_inline_update_b0 } true; 37564#L137 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 37565#L137-2 ~b0_req_up~0 := 0; 37554#L145 assume { :end_inline_update_b0 } true; 37555#L212-2 assume 1 == ~b1_req_up~0;assume { :begin_inline_update_b1 } true; 37482#L152 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 37483#L152-2 ~b1_req_up~0 := 0; 37601#L160 assume { :end_inline_update_b1 } true; 37600#L219-1 assume 1 == ~d0_req_up~0;assume { :begin_inline_update_d0 } true; 37457#L167 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 37458#L167-2 ~d0_req_up~0 := 0; 37419#L175 assume { :end_inline_update_d0 } true; 37420#L226-1 assume 1 == ~d1_req_up~0;assume { :begin_inline_update_d1 } true; 37519#L182 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 37466#L182-2 ~d1_req_up~0 := 0; 37467#L190 assume { :end_inline_update_d1 } true; 37563#L233-1 assume !(1 == ~z_req_up~0); 37571#L240-1 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 37451#L255 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 37452#L255-2 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 37572#L321 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 37573#L321-2 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 37599#L326-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 37476#L331-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 37477#L336-1 assume !(0 == ~z_ev~0); 37643#L341-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; 37640#L107 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; 37627#L129 is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; 37628#L130 activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; 37603#L390 assume 0 != activate_threads_~tmp~1#1;~comp_m1_st~0 := 0; 37604#L390-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 37544#L354 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 37545#L354-2 assume !(1 == ~b1_ev~0); 37602#L359-1 assume !(1 == ~d0_ev~0); 37513#L364-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 37514#L369-1 assume !(1 == ~z_ev~0); 37610#L374-1 assume { :end_inline_reset_delta_events } true; 37611#L432-2 assume !false; 38635#L433 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1; 37421#L295 [2022-02-21 04:21:28,857 INFO L793 eck$LassoCheckResult]: Loop: 37421#L295 assume !false; 37422#L286 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; 37462#L268 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; 37463#L275 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; 37622#L276 eval_#t~ret4#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___0~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; 38206#L290 assume 0 != eval_~tmp___0~0#1; 37633#L290-1 assume 0 == ~comp_m1_st~0;eval_~tmp~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 37503#L299 assume !(0 != eval_~tmp~0#1); 37421#L295 [2022-02-21 04:21:28,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:28,858 INFO L85 PathProgramCache]: Analyzing trace with hash -317915862, now seen corresponding path program 1 times [2022-02-21 04:21:28,858 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:28,858 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2074720670] [2022-02-21 04:21:28,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:28,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:28,866 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:28,881 INFO L290 TraceCheckUtils]: 0: Hoare triple {42600#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(16, 2);call #Ultimate.allocInit(12, 3);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; {42600#true} is VALID [2022-02-21 04:21:28,882 INFO L290 TraceCheckUtils]: 1: Hoare triple {42600#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~2#1;havoc main_~__retres1~2#1;assume { :begin_inline_init_model } true;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; {42600#true} is VALID [2022-02-21 04:21:28,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {42600#true} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret8#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; {42600#true} is VALID [2022-02-21 04:21:28,882 INFO L290 TraceCheckUtils]: 3: Hoare triple {42600#true} assume 1 == ~b0_req_up~0;assume { :begin_inline_update_b0 } true; {42600#true} is VALID [2022-02-21 04:21:28,882 INFO L290 TraceCheckUtils]: 4: Hoare triple {42600#true} assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; {42600#true} is VALID [2022-02-21 04:21:28,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {42600#true} ~b0_req_up~0 := 0; {42600#true} is VALID [2022-02-21 04:21:28,882 INFO L290 TraceCheckUtils]: 6: Hoare triple {42600#true} assume { :end_inline_update_b0 } true; {42600#true} is VALID [2022-02-21 04:21:28,882 INFO L290 TraceCheckUtils]: 7: Hoare triple {42600#true} assume 1 == ~b1_req_up~0;assume { :begin_inline_update_b1 } true; {42600#true} is VALID [2022-02-21 04:21:28,882 INFO L290 TraceCheckUtils]: 8: Hoare triple {42600#true} assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; {42600#true} is VALID [2022-02-21 04:21:28,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {42600#true} ~b1_req_up~0 := 0; {42600#true} is VALID [2022-02-21 04:21:28,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {42600#true} assume { :end_inline_update_b1 } true; {42600#true} is VALID [2022-02-21 04:21:28,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {42600#true} assume 1 == ~d0_req_up~0;assume { :begin_inline_update_d0 } true; {42600#true} is VALID [2022-02-21 04:21:28,883 INFO L290 TraceCheckUtils]: 12: Hoare triple {42600#true} assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; {42600#true} is VALID [2022-02-21 04:21:28,883 INFO L290 TraceCheckUtils]: 13: Hoare triple {42600#true} ~d0_req_up~0 := 0; {42600#true} is VALID [2022-02-21 04:21:28,883 INFO L290 TraceCheckUtils]: 14: Hoare triple {42600#true} assume { :end_inline_update_d0 } true; {42600#true} is VALID [2022-02-21 04:21:28,883 INFO L290 TraceCheckUtils]: 15: Hoare triple {42600#true} assume 1 == ~d1_req_up~0;assume { :begin_inline_update_d1 } true; {42600#true} is VALID [2022-02-21 04:21:28,883 INFO L290 TraceCheckUtils]: 16: Hoare triple {42600#true} assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; {42600#true} is VALID [2022-02-21 04:21:28,883 INFO L290 TraceCheckUtils]: 17: Hoare triple {42600#true} ~d1_req_up~0 := 0; {42600#true} is VALID [2022-02-21 04:21:28,883 INFO L290 TraceCheckUtils]: 18: Hoare triple {42600#true} assume { :end_inline_update_d1 } true; {42600#true} is VALID [2022-02-21 04:21:28,884 INFO L290 TraceCheckUtils]: 19: Hoare triple {42600#true} assume !(1 == ~z_req_up~0); {42600#true} is VALID [2022-02-21 04:21:28,884 INFO L290 TraceCheckUtils]: 20: Hoare triple {42600#true} assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; {42600#true} is VALID [2022-02-21 04:21:28,884 INFO L290 TraceCheckUtils]: 21: Hoare triple {42600#true} assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; {42600#true} is VALID [2022-02-21 04:21:28,884 INFO L290 TraceCheckUtils]: 22: Hoare triple {42600#true} assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; {42600#true} is VALID [2022-02-21 04:21:28,884 INFO L290 TraceCheckUtils]: 23: Hoare triple {42600#true} assume 0 == ~b0_ev~0;~b0_ev~0 := 1; {42600#true} is VALID [2022-02-21 04:21:28,884 INFO L290 TraceCheckUtils]: 24: Hoare triple {42600#true} assume 0 == ~b1_ev~0;~b1_ev~0 := 1; {42602#(= ~b1_ev~0 1)} is VALID [2022-02-21 04:21:28,885 INFO L290 TraceCheckUtils]: 25: Hoare triple {42602#(= ~b1_ev~0 1)} assume 0 == ~d0_ev~0;~d0_ev~0 := 1; {42602#(= ~b1_ev~0 1)} is VALID [2022-02-21 04:21:28,885 INFO L290 TraceCheckUtils]: 26: Hoare triple {42602#(= ~b1_ev~0 1)} assume 0 == ~d1_ev~0;~d1_ev~0 := 1; {42602#(= ~b1_ev~0 1)} is VALID [2022-02-21 04:21:28,885 INFO L290 TraceCheckUtils]: 27: Hoare triple {42602#(= ~b1_ev~0 1)} assume !(0 == ~z_ev~0); {42602#(= ~b1_ev~0 1)} is VALID [2022-02-21 04:21:28,885 INFO L290 TraceCheckUtils]: 28: Hoare triple {42602#(= ~b1_ev~0 1)} assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; {42602#(= ~b1_ev~0 1)} is VALID [2022-02-21 04:21:28,886 INFO L290 TraceCheckUtils]: 29: Hoare triple {42602#(= ~b1_ev~0 1)} assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; {42602#(= ~b1_ev~0 1)} is VALID [2022-02-21 04:21:28,886 INFO L290 TraceCheckUtils]: 30: Hoare triple {42602#(= ~b1_ev~0 1)} is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; {42602#(= ~b1_ev~0 1)} is VALID [2022-02-21 04:21:28,886 INFO L290 TraceCheckUtils]: 31: Hoare triple {42602#(= ~b1_ev~0 1)} activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; {42602#(= ~b1_ev~0 1)} is VALID [2022-02-21 04:21:28,886 INFO L290 TraceCheckUtils]: 32: Hoare triple {42602#(= ~b1_ev~0 1)} assume 0 != activate_threads_~tmp~1#1;~comp_m1_st~0 := 0; {42602#(= ~b1_ev~0 1)} is VALID [2022-02-21 04:21:28,887 INFO L290 TraceCheckUtils]: 33: Hoare triple {42602#(= ~b1_ev~0 1)} assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; {42602#(= ~b1_ev~0 1)} is VALID [2022-02-21 04:21:28,887 INFO L290 TraceCheckUtils]: 34: Hoare triple {42602#(= ~b1_ev~0 1)} assume 1 == ~b0_ev~0;~b0_ev~0 := 2; {42602#(= ~b1_ev~0 1)} is VALID [2022-02-21 04:21:28,887 INFO L290 TraceCheckUtils]: 35: Hoare triple {42602#(= ~b1_ev~0 1)} assume !(1 == ~b1_ev~0); {42601#false} is VALID [2022-02-21 04:21:28,887 INFO L290 TraceCheckUtils]: 36: Hoare triple {42601#false} assume !(1 == ~d0_ev~0); {42601#false} is VALID [2022-02-21 04:21:28,887 INFO L290 TraceCheckUtils]: 37: Hoare triple {42601#false} assume 1 == ~d1_ev~0;~d1_ev~0 := 2; {42601#false} is VALID [2022-02-21 04:21:28,887 INFO L290 TraceCheckUtils]: 38: Hoare triple {42601#false} assume !(1 == ~z_ev~0); {42601#false} is VALID [2022-02-21 04:21:28,887 INFO L290 TraceCheckUtils]: 39: Hoare triple {42601#false} assume { :end_inline_reset_delta_events } true; {42601#false} is VALID [2022-02-21 04:21:28,888 INFO L290 TraceCheckUtils]: 40: Hoare triple {42601#false} assume !false; {42601#false} is VALID [2022-02-21 04:21:28,888 INFO L290 TraceCheckUtils]: 41: Hoare triple {42601#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1; {42601#false} is VALID [2022-02-21 04:21:28,888 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:21:28,888 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:28,888 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2074720670] [2022-02-21 04:21:28,888 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2074720670] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:28,888 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:28,889 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:21:28,889 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1159770657] [2022-02-21 04:21:28,889 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:28,889 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:21:28,889 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:28,889 INFO L85 PathProgramCache]: Analyzing trace with hash -62512628, now seen corresponding path program 3 times [2022-02-21 04:21:28,889 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:28,890 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1790911583] [2022-02-21 04:21:28,890 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:28,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:28,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:21:28,893 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:21:28,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:21:28,897 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:21:28,923 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:21:28,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:21:28,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:21:28,924 INFO L87 Difference]: Start difference. First operand 1252 states and 1830 transitions. cyclomatic complexity: 587 Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:29,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:29,069 INFO L93 Difference]: Finished difference Result 1473 states and 2140 transitions. [2022-02-21 04:21:29,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:21:29,069 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:29,094 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:21:29,095 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1473 states and 2140 transitions. [2022-02-21 04:21:29,143 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 612 [2022-02-21 04:21:29,191 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1473 states to 1473 states and 2140 transitions. [2022-02-21 04:21:29,191 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 682 [2022-02-21 04:21:29,191 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 682 [2022-02-21 04:21:29,191 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1473 states and 2140 transitions. [2022-02-21 04:21:29,192 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:21:29,192 INFO L681 BuchiCegarLoop]: Abstraction has 1473 states and 2140 transitions. [2022-02-21 04:21:29,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1473 states and 2140 transitions. [2022-02-21 04:21:29,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1473 to 1473. [2022-02-21 04:21:29,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:21:29,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1473 states and 2140 transitions. Second operand has 1473 states, 1473 states have (on average 1.4528173794976238) internal successors, (2140), 1472 states have internal predecessors, (2140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:29,206 INFO L74 IsIncluded]: Start isIncluded. First operand 1473 states and 2140 transitions. Second operand has 1473 states, 1473 states have (on average 1.4528173794976238) internal successors, (2140), 1472 states have internal predecessors, (2140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:29,207 INFO L87 Difference]: Start difference. First operand 1473 states and 2140 transitions. Second operand has 1473 states, 1473 states have (on average 1.4528173794976238) internal successors, (2140), 1472 states have internal predecessors, (2140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:29,208 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:21:29,259 INFO L93 Difference]: Finished difference Result 1479 states and 2148 transitions. [2022-02-21 04:21:29,259 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 2148 transitions. [2022-02-21 04:21:29,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:29,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:29,263 INFO L74 IsIncluded]: Start isIncluded. First operand has 1473 states, 1473 states have (on average 1.4528173794976238) internal successors, (2140), 1472 states have internal predecessors, (2140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1473 states and 2140 transitions. [2022-02-21 04:21:29,264 INFO L87 Difference]: Start difference. First operand has 1473 states, 1473 states have (on average 1.4528173794976238) internal successors, (2140), 1472 states have internal predecessors, (2140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1473 states and 2140 transitions. [2022-02-21 04:21:29,264 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:21:29,317 INFO L93 Difference]: Finished difference Result 1479 states and 2148 transitions. [2022-02-21 04:21:29,318 INFO L276 IsEmpty]: Start isEmpty. Operand 1479 states and 2148 transitions. [2022-02-21 04:21:29,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:29,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:29,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:21:29,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:21:29,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1473 states, 1473 states have (on average 1.4528173794976238) internal successors, (2140), 1472 states have internal predecessors, (2140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:29,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1473 states to 1473 states and 2140 transitions. [2022-02-21 04:21:29,366 INFO L704 BuchiCegarLoop]: Abstraction has 1473 states and 2140 transitions. [2022-02-21 04:21:29,366 INFO L587 BuchiCegarLoop]: Abstraction has 1473 states and 2140 transitions. [2022-02-21 04:21:29,366 INFO L425 BuchiCegarLoop]: ======== Iteration 17============ [2022-02-21 04:21:29,366 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1473 states and 2140 transitions. [2022-02-21 04:21:29,369 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 612 [2022-02-21 04:21:29,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:21:29,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:21:29,370 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:29,370 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:29,370 INFO L791 eck$LassoCheckResult]: Stem: 44321#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(16, 2);call #Ultimate.allocInit(12, 3);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 44188#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~2#1;havoc main_~__retres1~2#1;assume { :begin_inline_init_model } true;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 44123#L490 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret8#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 44124#L212 assume 1 == ~b0_req_up~0;assume { :begin_inline_update_b0 } true; 44236#L137 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 44237#L137-2 ~b0_req_up~0 := 0; 44227#L145 assume { :end_inline_update_b0 } true; 44228#L212-2 assume 1 == ~b1_req_up~0;assume { :begin_inline_update_b1 } true; 44153#L152 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 44154#L152-2 ~b1_req_up~0 := 0; 44281#L160 assume { :end_inline_update_b1 } true; 44275#L219-1 assume 1 == ~d0_req_up~0;assume { :begin_inline_update_d0 } true; 44127#L167 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 44128#L167-2 ~d0_req_up~0 := 0; 44088#L175 assume { :end_inline_update_d0 } true; 44089#L226-1 assume 1 == ~d1_req_up~0;assume { :begin_inline_update_d1 } true; 44192#L182 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 44135#L182-2 ~d1_req_up~0 := 0; 44136#L190 assume { :end_inline_update_d1 } true; 44235#L233-1 assume !(1 == ~z_req_up~0); 44243#L240-1 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 44121#L255 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 44122#L255-2 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 44244#L321 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 44245#L321-2 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 44145#L326-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 44146#L331-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 44100#L336-1 assume !(0 == ~z_ev~0); 44101#L341-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; 44325#L107 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; 44313#L129 is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; 44314#L130 activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; 44284#L390 assume 0 != activate_threads_~tmp~1#1;~comp_m1_st~0 := 0; 44285#L390-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 44320#L354 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 44184#L354-2 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 44185#L359-1 assume !(1 == ~d0_ev~0); 44186#L364-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 44187#L369-1 assume !(1 == ~z_ev~0); 44294#L374-1 assume { :end_inline_reset_delta_events } true; 44295#L432-2 assume !false; 44475#L433 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1; 44476#L295 [2022-02-21 04:21:29,370 INFO L793 eck$LassoCheckResult]: Loop: 44476#L295 assume !false; 45331#L286 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; 45330#L268 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; 45145#L275 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; 45329#L276 eval_#t~ret4#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___0~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; 45328#L290 assume 0 != eval_~tmp___0~0#1; 45327#L290-1 assume 0 == ~comp_m1_st~0;eval_~tmp~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 45326#L299 assume !(0 != eval_~tmp~0#1); 44476#L295 [2022-02-21 04:21:29,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:29,371 INFO L85 PathProgramCache]: Analyzing trace with hash -2092923224, now seen corresponding path program 1 times [2022-02-21 04:21:29,371 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:29,371 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1549328548] [2022-02-21 04:21:29,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:29,371 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:29,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:21:29,383 INFO L290 TraceCheckUtils]: 0: Hoare triple {50164#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(16, 2);call #Ultimate.allocInit(12, 3);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; {50164#true} is VALID [2022-02-21 04:21:29,384 INFO L290 TraceCheckUtils]: 1: Hoare triple {50164#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~2#1;havoc main_~__retres1~2#1;assume { :begin_inline_init_model } true;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; {50164#true} is VALID [2022-02-21 04:21:29,384 INFO L290 TraceCheckUtils]: 2: Hoare triple {50164#true} assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret8#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; {50164#true} is VALID [2022-02-21 04:21:29,384 INFO L290 TraceCheckUtils]: 3: Hoare triple {50164#true} assume 1 == ~b0_req_up~0;assume { :begin_inline_update_b0 } true; {50164#true} is VALID [2022-02-21 04:21:29,384 INFO L290 TraceCheckUtils]: 4: Hoare triple {50164#true} assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; {50164#true} is VALID [2022-02-21 04:21:29,384 INFO L290 TraceCheckUtils]: 5: Hoare triple {50164#true} ~b0_req_up~0 := 0; {50164#true} is VALID [2022-02-21 04:21:29,384 INFO L290 TraceCheckUtils]: 6: Hoare triple {50164#true} assume { :end_inline_update_b0 } true; {50164#true} is VALID [2022-02-21 04:21:29,384 INFO L290 TraceCheckUtils]: 7: Hoare triple {50164#true} assume 1 == ~b1_req_up~0;assume { :begin_inline_update_b1 } true; {50164#true} is VALID [2022-02-21 04:21:29,384 INFO L290 TraceCheckUtils]: 8: Hoare triple {50164#true} assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; {50164#true} is VALID [2022-02-21 04:21:29,385 INFO L290 TraceCheckUtils]: 9: Hoare triple {50164#true} ~b1_req_up~0 := 0; {50164#true} is VALID [2022-02-21 04:21:29,385 INFO L290 TraceCheckUtils]: 10: Hoare triple {50164#true} assume { :end_inline_update_b1 } true; {50164#true} is VALID [2022-02-21 04:21:29,385 INFO L290 TraceCheckUtils]: 11: Hoare triple {50164#true} assume 1 == ~d0_req_up~0;assume { :begin_inline_update_d0 } true; {50164#true} is VALID [2022-02-21 04:21:29,385 INFO L290 TraceCheckUtils]: 12: Hoare triple {50164#true} assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; {50164#true} is VALID [2022-02-21 04:21:29,385 INFO L290 TraceCheckUtils]: 13: Hoare triple {50164#true} ~d0_req_up~0 := 0; {50164#true} is VALID [2022-02-21 04:21:29,385 INFO L290 TraceCheckUtils]: 14: Hoare triple {50164#true} assume { :end_inline_update_d0 } true; {50164#true} is VALID [2022-02-21 04:21:29,385 INFO L290 TraceCheckUtils]: 15: Hoare triple {50164#true} assume 1 == ~d1_req_up~0;assume { :begin_inline_update_d1 } true; {50164#true} is VALID [2022-02-21 04:21:29,385 INFO L290 TraceCheckUtils]: 16: Hoare triple {50164#true} assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; {50164#true} is VALID [2022-02-21 04:21:29,385 INFO L290 TraceCheckUtils]: 17: Hoare triple {50164#true} ~d1_req_up~0 := 0; {50164#true} is VALID [2022-02-21 04:21:29,386 INFO L290 TraceCheckUtils]: 18: Hoare triple {50164#true} assume { :end_inline_update_d1 } true; {50164#true} is VALID [2022-02-21 04:21:29,386 INFO L290 TraceCheckUtils]: 19: Hoare triple {50164#true} assume !(1 == ~z_req_up~0); {50164#true} is VALID [2022-02-21 04:21:29,386 INFO L290 TraceCheckUtils]: 20: Hoare triple {50164#true} assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; {50164#true} is VALID [2022-02-21 04:21:29,386 INFO L290 TraceCheckUtils]: 21: Hoare triple {50164#true} assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; {50164#true} is VALID [2022-02-21 04:21:29,386 INFO L290 TraceCheckUtils]: 22: Hoare triple {50164#true} assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; {50164#true} is VALID [2022-02-21 04:21:29,386 INFO L290 TraceCheckUtils]: 23: Hoare triple {50164#true} assume 0 == ~b0_ev~0;~b0_ev~0 := 1; {50164#true} is VALID [2022-02-21 04:21:29,386 INFO L290 TraceCheckUtils]: 24: Hoare triple {50164#true} assume 0 == ~b1_ev~0;~b1_ev~0 := 1; {50164#true} is VALID [2022-02-21 04:21:29,387 INFO L290 TraceCheckUtils]: 25: Hoare triple {50164#true} assume 0 == ~d0_ev~0;~d0_ev~0 := 1; {50166#(= ~d0_ev~0 1)} is VALID [2022-02-21 04:21:29,387 INFO L290 TraceCheckUtils]: 26: Hoare triple {50166#(= ~d0_ev~0 1)} assume 0 == ~d1_ev~0;~d1_ev~0 := 1; {50166#(= ~d0_ev~0 1)} is VALID [2022-02-21 04:21:29,387 INFO L290 TraceCheckUtils]: 27: Hoare triple {50166#(= ~d0_ev~0 1)} assume !(0 == ~z_ev~0); {50166#(= ~d0_ev~0 1)} is VALID [2022-02-21 04:21:29,387 INFO L290 TraceCheckUtils]: 28: Hoare triple {50166#(= ~d0_ev~0 1)} assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; {50166#(= ~d0_ev~0 1)} is VALID [2022-02-21 04:21:29,388 INFO L290 TraceCheckUtils]: 29: Hoare triple {50166#(= ~d0_ev~0 1)} assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; {50166#(= ~d0_ev~0 1)} is VALID [2022-02-21 04:21:29,388 INFO L290 TraceCheckUtils]: 30: Hoare triple {50166#(= ~d0_ev~0 1)} is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; {50166#(= ~d0_ev~0 1)} is VALID [2022-02-21 04:21:29,388 INFO L290 TraceCheckUtils]: 31: Hoare triple {50166#(= ~d0_ev~0 1)} activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; {50166#(= ~d0_ev~0 1)} is VALID [2022-02-21 04:21:29,388 INFO L290 TraceCheckUtils]: 32: Hoare triple {50166#(= ~d0_ev~0 1)} assume 0 != activate_threads_~tmp~1#1;~comp_m1_st~0 := 0; {50166#(= ~d0_ev~0 1)} is VALID [2022-02-21 04:21:29,389 INFO L290 TraceCheckUtils]: 33: Hoare triple {50166#(= ~d0_ev~0 1)} assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; {50166#(= ~d0_ev~0 1)} is VALID [2022-02-21 04:21:29,389 INFO L290 TraceCheckUtils]: 34: Hoare triple {50166#(= ~d0_ev~0 1)} assume 1 == ~b0_ev~0;~b0_ev~0 := 2; {50166#(= ~d0_ev~0 1)} is VALID [2022-02-21 04:21:29,389 INFO L290 TraceCheckUtils]: 35: Hoare triple {50166#(= ~d0_ev~0 1)} assume 1 == ~b1_ev~0;~b1_ev~0 := 2; {50166#(= ~d0_ev~0 1)} is VALID [2022-02-21 04:21:29,389 INFO L290 TraceCheckUtils]: 36: Hoare triple {50166#(= ~d0_ev~0 1)} assume !(1 == ~d0_ev~0); {50165#false} is VALID [2022-02-21 04:21:29,390 INFO L290 TraceCheckUtils]: 37: Hoare triple {50165#false} assume 1 == ~d1_ev~0;~d1_ev~0 := 2; {50165#false} is VALID [2022-02-21 04:21:29,390 INFO L290 TraceCheckUtils]: 38: Hoare triple {50165#false} assume !(1 == ~z_ev~0); {50165#false} is VALID [2022-02-21 04:21:29,390 INFO L290 TraceCheckUtils]: 39: Hoare triple {50165#false} assume { :end_inline_reset_delta_events } true; {50165#false} is VALID [2022-02-21 04:21:29,390 INFO L290 TraceCheckUtils]: 40: Hoare triple {50165#false} assume !false; {50165#false} is VALID [2022-02-21 04:21:29,390 INFO L290 TraceCheckUtils]: 41: Hoare triple {50165#false} start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1; {50165#false} is VALID [2022-02-21 04:21:29,390 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:21:29,390 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:21:29,390 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1549328548] [2022-02-21 04:21:29,391 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1549328548] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:21:29,391 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:21:29,391 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:21:29,391 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [475379217] [2022-02-21 04:21:29,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:21:29,391 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:21:29,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:29,392 INFO L85 PathProgramCache]: Analyzing trace with hash -62512628, now seen corresponding path program 4 times [2022-02-21 04:21:29,392 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:29,392 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777956426] [2022-02-21 04:21:29,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:29,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:29,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:21:29,394 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:21:29,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:21:29,396 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:21:29,421 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:21:29,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:21:29,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:21:29,422 INFO L87 Difference]: Start difference. First operand 1473 states and 2140 transitions. cyclomatic complexity: 676 Second operand has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:29,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:21:29,604 INFO L93 Difference]: Finished difference Result 1878 states and 2694 transitions. [2022-02-21 04:21:29,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:21:29,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 14.0) internal successors, (42), 3 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:29,625 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:21:29,625 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1878 states and 2694 transitions. [2022-02-21 04:21:29,702 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 696 [2022-02-21 04:21:29,772 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1878 states to 1747 states and 2497 transitions. [2022-02-21 04:21:29,772 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 768 [2022-02-21 04:21:29,772 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 768 [2022-02-21 04:21:29,773 INFO L73 IsDeterministic]: Start isDeterministic. Operand 1747 states and 2497 transitions. [2022-02-21 04:21:29,773 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 04:21:29,773 INFO L681 BuchiCegarLoop]: Abstraction has 1747 states and 2497 transitions. [2022-02-21 04:21:29,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1747 states and 2497 transitions. [2022-02-21 04:21:29,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1747 to 1747. [2022-02-21 04:21:29,786 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:21:29,788 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1747 states and 2497 transitions. Second operand has 1747 states, 1747 states have (on average 1.4293073840870063) internal successors, (2497), 1746 states have internal predecessors, (2497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:29,789 INFO L74 IsIncluded]: Start isIncluded. First operand 1747 states and 2497 transitions. Second operand has 1747 states, 1747 states have (on average 1.4293073840870063) internal successors, (2497), 1746 states have internal predecessors, (2497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:29,790 INFO L87 Difference]: Start difference. First operand 1747 states and 2497 transitions. Second operand has 1747 states, 1747 states have (on average 1.4293073840870063) internal successors, (2497), 1746 states have internal predecessors, (2497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:29,791 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:21:29,863 INFO L93 Difference]: Finished difference Result 1755 states and 2507 transitions. [2022-02-21 04:21:29,863 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2507 transitions. [2022-02-21 04:21:29,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:29,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:29,867 INFO L74 IsIncluded]: Start isIncluded. First operand has 1747 states, 1747 states have (on average 1.4293073840870063) internal successors, (2497), 1746 states have internal predecessors, (2497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1747 states and 2497 transitions. [2022-02-21 04:21:29,868 INFO L87 Difference]: Start difference. First operand has 1747 states, 1747 states have (on average 1.4293073840870063) internal successors, (2497), 1746 states have internal predecessors, (2497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 1747 states and 2497 transitions. [2022-02-21 04:21:29,868 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 04:21:29,939 INFO L93 Difference]: Finished difference Result 1755 states and 2507 transitions. [2022-02-21 04:21:29,940 INFO L276 IsEmpty]: Start isEmpty. Operand 1755 states and 2507 transitions. [2022-02-21 04:21:29,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:21:29,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:21:29,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:21:29,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:21:29,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1747 states, 1747 states have (on average 1.4293073840870063) internal successors, (2497), 1746 states have internal predecessors, (2497), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:21:30,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1747 states to 1747 states and 2497 transitions. [2022-02-21 04:21:30,010 INFO L704 BuchiCegarLoop]: Abstraction has 1747 states and 2497 transitions. [2022-02-21 04:21:30,010 INFO L587 BuchiCegarLoop]: Abstraction has 1747 states and 2497 transitions. [2022-02-21 04:21:30,010 INFO L425 BuchiCegarLoop]: ======== Iteration 18============ [2022-02-21 04:21:30,011 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1747 states and 2497 transitions. [2022-02-21 04:21:30,015 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 696 [2022-02-21 04:21:30,015 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:21:30,015 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:21:30,016 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:30,016 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:21:30,016 INFO L791 eck$LassoCheckResult]: Stem: 52288#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(16, 2);call #Ultimate.allocInit(12, 3);~b0_val~0 := 0;~b0_val_t~0 := 0;~b0_ev~0 := 0;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_val_t~0 := 0;~b1_ev~0 := 0;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_val_t~0 := 0;~d0_ev~0 := 0;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_val_t~0 := 0;~d1_ev~0 := 0;~d1_req_up~0 := 0;~z_val~0 := 0;~z_val_t~0 := 0;~z_ev~0 := 0;~z_req_up~0 := 0;~comp_m1_st~0 := 0;~comp_m1_i~0 := 0; 52158#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_~__retres1~2#1;havoc main_~__retres1~2#1;assume { :begin_inline_init_model } true;~b0_val~0 := 0;~b0_ev~0 := 2;~b0_req_up~0 := 0;~b1_val~0 := 0;~b1_ev~0 := 2;~b1_req_up~0 := 0;~d0_val~0 := 0;~d0_ev~0 := 2;~d0_req_up~0 := 0;~d1_val~0 := 0;~d1_ev~0 := 2;~d1_req_up~0 := 0;~z_val~0 := 0;~z_ev~0 := 2;~z_req_up~0 := 0;~b0_val_t~0 := 1;~b0_req_up~0 := 1;~b1_val_t~0 := 1;~b1_req_up~0 := 1;~d0_val_t~0 := 1;~d0_req_up~0 := 1;~d1_val_t~0 := 1;~d1_req_up~0 := 1;~comp_m1_i~0 := 0; 52092#L490 assume { :end_inline_init_model } true;assume { :begin_inline_start_simulation } true;havoc start_simulation_#t~ret8#1, start_simulation_~kernel_st~0#1, start_simulation_~tmp~3#1;havoc start_simulation_~kernel_st~0#1;havoc start_simulation_~tmp~3#1;start_simulation_~kernel_st~0#1 := 0;assume { :begin_inline_update_channels } true; 52093#L212 assume 1 == ~b0_req_up~0;assume { :begin_inline_update_b0 } true; 52206#L137 assume ~b0_val~0 != ~b0_val_t~0;~b0_val~0 := ~b0_val_t~0;~b0_ev~0 := 0; 52207#L137-2 ~b0_req_up~0 := 0; 52194#L145 assume { :end_inline_update_b0 } true; 52195#L212-2 assume 1 == ~b1_req_up~0;assume { :begin_inline_update_b1 } true; 52122#L152 assume ~b1_val~0 != ~b1_val_t~0;~b1_val~0 := ~b1_val_t~0;~b1_ev~0 := 0; 52123#L152-2 ~b1_req_up~0 := 0; 52247#L160 assume { :end_inline_update_b1 } true; 52242#L219-1 assume 1 == ~d0_req_up~0;assume { :begin_inline_update_d0 } true; 52096#L167 assume ~d0_val~0 != ~d0_val_t~0;~d0_val~0 := ~d0_val_t~0;~d0_ev~0 := 0; 52097#L167-2 ~d0_req_up~0 := 0; 52057#L175 assume { :end_inline_update_d0 } true; 52058#L226-1 assume 1 == ~d1_req_up~0;assume { :begin_inline_update_d1 } true; 52159#L182 assume ~d1_val~0 != ~d1_val_t~0;~d1_val~0 := ~d1_val_t~0;~d1_ev~0 := 0; 52100#L182-2 ~d1_req_up~0 := 0; 52101#L190 assume { :end_inline_update_d1 } true; 52205#L233-1 assume !(1 == ~z_req_up~0); 52213#L240-1 assume { :end_inline_update_channels } true;assume { :begin_inline_init_threads } true; 52086#L255 assume !(1 == ~comp_m1_i~0);~comp_m1_st~0 := 2; 52087#L255-2 assume { :end_inline_init_threads } true;assume { :begin_inline_fire_delta_events } true; 52214#L321 assume 0 == ~b0_ev~0;~b0_ev~0 := 1; 52215#L321-2 assume 0 == ~b1_ev~0;~b1_ev~0 := 1; 52110#L326-1 assume 0 == ~d0_ev~0;~d0_ev~0 := 1; 52111#L331-1 assume 0 == ~d1_ev~0;~d1_ev~0 := 1; 52063#L336-1 assume !(0 == ~z_ev~0); 52064#L341-1 assume { :end_inline_fire_delta_events } true;assume { :begin_inline_activate_threads } true;havoc activate_threads_#t~ret6#1, activate_threads_~tmp~1#1;havoc activate_threads_~tmp~1#1;assume { :begin_inline_is_method1_triggered } true;havoc is_method1_triggered_#res#1;havoc is_method1_triggered_~__retres1~0#1;havoc is_method1_triggered_~__retres1~0#1; 52293#L107 assume 1 == ~b0_ev~0;is_method1_triggered_~__retres1~0#1 := 1; 52279#L129 is_method1_triggered_#res#1 := is_method1_triggered_~__retres1~0#1; 52280#L130 activate_threads_#t~ret6#1 := is_method1_triggered_#res#1;assume { :end_inline_is_method1_triggered } true;activate_threads_~tmp~1#1 := activate_threads_#t~ret6#1;havoc activate_threads_#t~ret6#1; 52251#L390 assume 0 != activate_threads_~tmp~1#1;~comp_m1_st~0 := 0; 52252#L390-2 assume { :end_inline_activate_threads } true;assume { :begin_inline_reset_delta_events } true; 52287#L354 assume 1 == ~b0_ev~0;~b0_ev~0 := 2; 52152#L354-2 assume 1 == ~b1_ev~0;~b1_ev~0 := 2; 52153#L359-1 assume 1 == ~d0_ev~0;~d0_ev~0 := 2; 52156#L364-1 assume 1 == ~d1_ev~0;~d1_ev~0 := 2; 52157#L369-1 assume !(1 == ~z_ev~0); 52258#L374-1 assume { :end_inline_reset_delta_events } true; 52259#L432-2 assume !false; 53464#L433 start_simulation_~kernel_st~0#1 := 1;assume { :begin_inline_eval } true;havoc eval_#t~ret4#1, eval_#t~nondet5#1, eval_~tmp~0#1, eval_~tmp___0~0#1;havoc eval_~tmp~0#1;havoc eval_~tmp___0~0#1; 52453#L295 [2022-02-21 04:21:30,016 INFO L793 eck$LassoCheckResult]: Loop: 52453#L295 assume !false; 52480#L286 assume { :begin_inline_exists_runnable_thread } true;havoc exists_runnable_thread_#res#1;havoc exists_runnable_thread_~__retres1~1#1;havoc exists_runnable_thread_~__retres1~1#1; 52102#L268 assume 0 == ~comp_m1_st~0;exists_runnable_thread_~__retres1~1#1 := 1; 52103#L275 exists_runnable_thread_#res#1 := exists_runnable_thread_~__retres1~1#1; 52271#L276 eval_#t~ret4#1 := exists_runnable_thread_#res#1;assume { :end_inline_exists_runnable_thread } true;eval_~tmp___0~0#1 := eval_#t~ret4#1;havoc eval_#t~ret4#1; 52294#L290 assume 0 != eval_~tmp___0~0#1; 52295#L290-1 assume 0 == ~comp_m1_st~0;eval_~tmp~0#1 := eval_#t~nondet5#1;havoc eval_#t~nondet5#1; 52452#L299 assume !(0 != eval_~tmp~0#1); 52453#L295 [2022-02-21 04:21:30,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:30,017 INFO L85 PathProgramCache]: Analyzing trace with hash 2144785770, now seen corresponding path program 1 times [2022-02-21 04:21:30,017 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:30,017 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [197184743] [2022-02-21 04:21:30,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:30,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:30,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:21:30,022 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:21:30,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:21:30,030 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:21:30,030 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:30,030 INFO L85 PathProgramCache]: Analyzing trace with hash -62512628, now seen corresponding path program 5 times [2022-02-21 04:21:30,030 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:30,030 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785059675] [2022-02-21 04:21:30,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:30,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:30,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:21:30,034 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:21:30,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:21:30,037 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:21:30,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:21:30,038 INFO L85 PathProgramCache]: Analyzing trace with hash 109674101, now seen corresponding path program 1 times [2022-02-21 04:21:30,038 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:21:30,038 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598382165] [2022-02-21 04:21:30,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:21:30,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:21:30,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:21:30,044 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:21:30,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:21:30,051 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:21:30,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:21:30 BoogieIcfgContainer [2022-02-21 04:21:30,901 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:21:30,902 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:21:30,902 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:21:30,902 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:21:30,902 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:21:18" (3/4) ... [2022-02-21 04:21:30,903 INFO L134 WitnessPrinter]: Generating witness for non-termination counterexample [2022-02-21 04:21:30,943 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-21 04:21:30,943 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:21:30,944 INFO L158 Benchmark]: Toolchain (without parser) took 13146.80ms. Allocated memory was 127.9MB in the beginning and 287.3MB in the end (delta: 159.4MB). Free memory was 96.6MB in the beginning and 182.5MB in the end (delta: -85.9MB). Peak memory consumption was 74.3MB. Max. memory is 16.1GB. [2022-02-21 04:21:30,944 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 88.1MB. Free memory was 45.3MB in the beginning and 45.2MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:21:30,944 INFO L158 Benchmark]: CACSL2BoogieTranslator took 254.11ms. Allocated memory is still 127.9MB. Free memory was 96.6MB in the beginning and 98.4MB in the end (delta: -1.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 04:21:30,944 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.31ms. Allocated memory is still 127.9MB. Free memory was 98.4MB in the beginning and 95.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:21:30,944 INFO L158 Benchmark]: Boogie Preprocessor took 28.69ms. Allocated memory is still 127.9MB. Free memory was 95.5MB in the beginning and 93.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:21:30,945 INFO L158 Benchmark]: RCFGBuilder took 520.80ms. Allocated memory is still 127.9MB. Free memory was 93.4MB in the beginning and 74.3MB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. [2022-02-21 04:21:30,945 INFO L158 Benchmark]: BuchiAutomizer took 12251.63ms. Allocated memory was 127.9MB in the beginning and 287.3MB in the end (delta: 159.4MB). Free memory was 73.8MB in the beginning and 186.7MB in the end (delta: -112.8MB). Peak memory consumption was 117.7MB. Max. memory is 16.1GB. [2022-02-21 04:21:30,945 INFO L158 Benchmark]: Witness Printer took 41.33ms. Allocated memory is still 287.3MB. Free memory was 186.7MB in the beginning and 182.5MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 04:21:30,946 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.10ms. Allocated memory is still 88.1MB. Free memory was 45.3MB in the beginning and 45.2MB in the end (delta: 76.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 254.11ms. Allocated memory is still 127.9MB. Free memory was 96.6MB in the beginning and 98.4MB in the end (delta: -1.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.31ms. Allocated memory is still 127.9MB. Free memory was 98.4MB in the beginning and 95.5MB in the end (delta: 2.9MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.69ms. Allocated memory is still 127.9MB. Free memory was 95.5MB in the beginning and 93.9MB in the end (delta: 1.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 520.80ms. Allocated memory is still 127.9MB. Free memory was 93.4MB in the beginning and 74.3MB in the end (delta: 19.1MB). Peak memory consumption was 18.9MB. Max. memory is 16.1GB. * BuchiAutomizer took 12251.63ms. Allocated memory was 127.9MB in the beginning and 287.3MB in the end (delta: 159.4MB). Free memory was 73.8MB in the beginning and 186.7MB in the end (delta: -112.8MB). Peak memory consumption was 117.7MB. Max. memory is 16.1GB. * Witness Printer took 41.33ms. Allocated memory is still 287.3MB. Free memory was 186.7MB in the beginning and 182.5MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. 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 19 terminating modules (17 trivial, 2 deterministic, 0 nondeterministic) and one nonterminating remainder module.One deterministic module has affine ranking function -1 * b0_ev + 1 and consists of 3 locations. One deterministic module has affine ranking function -1 * d0_ev + 1 and consists of 3 locations. 17 modules have a trivial ranking function, the largest among these consists of 5 locations. The remainder module has 1747 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 12.1s and 18 iterations. TraceHistogramMax:1. Analysis of lassos took 4.8s. Construction of modules took 0.1s. Büchi inclusion checks took 4.9s. Highest rank in rank-based complementation 3. Minimization of det autom 8. Minimization of nondet autom 11. Automata minimization 1.3s AutomataMinimizationTime, 19 MinimizatonAttempts, 130 StatesRemovedByMinimization, 4 NontrivialMinimizations. Non-live state removal took 0.6s Buchi closure took 0.0s. Biggest automaton had 1747 states and ocurred in iteration 17. Nontrivial modules had stage [2, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1130 SdHoareTripleChecker+Valid, 0.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1130 mSDsluCounter, 7424 SdHoareTripleChecker+Invalid, 0.2s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4054 mSDsCounter, 53 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 260 IncrementalHoareTripleChecker+Invalid, 313 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 53 mSolverCounterUnsat, 3370 mSDtfsCounter, 260 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont1 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN4 SILU0 SILI11 SILT2 lasso0 LassoPreprocessingBenchmarks: Lassos: inital95 mio100 ax100 hnf100 lsp11 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq209 hnf86 smp100 dnf189 smp63 tf108 neg92 sie116 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 107ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 2 SupportingInvariants: 0 MotzkinApplications: 4 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 2 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Nontermination possible Buchi Automizer proved that your program is nonterminating for some inputs - FixpointNonTerminationResult [Line: 285]: 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 {b1_val_t=1, NULL=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@2248e596=0, d0_val=1, NULL=1, tmp=1, __retres1=0, z_val=0, b0_val_t=1, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@e998267=0, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@27e90193=0, d1_ev=2, comp_m1_i=0, tmp=0, b1_val=1, d1_req_up=0, z_val_t=0, b1_req_up=0, d0_ev=2, __retres1=1, z_ev=2, b1_ev=2, org.eclipse.cdt.internal.core.dom.parser.c.CASTFunctionCallExpression@3a9b8fc8=0, comp_m1_st=0, tmp=0, b0_req_up=0, tmp___0=1, \result=0, z_req_up=0, d1_val=1, b0_ev=2, NULL=0, d0_val_t=1, kernel_st=1, d1_val_t=1, __retres1=1, b0_val=1, \result=1, d0_req_up=0, \result=1} - StatisticsResult: NonterminationArgumentStatistics Fixpoint - NonterminatingLassoResult [Line: 285]: Nonterminating execution Found a nonterminating execution for the following lasso shaped sequence of statements. Stem: [L24] int b0_val ; [L25] int b0_val_t ; [L26] int b0_ev ; [L27] int b0_req_up ; [L28] int b1_val ; [L29] int b1_val_t ; [L30] int b1_ev ; [L31] int b1_req_up ; [L32] int d0_val ; [L33] int d0_val_t ; [L34] int d0_ev ; [L35] int d0_req_up ; [L36] int d1_val ; [L37] int d1_val_t ; [L38] int d1_ev ; [L39] int d1_req_up ; [L40] int z_val ; [L41] int z_val_t ; [L42] int z_ev ; [L43] int z_req_up ; [L44] int comp_m1_st ; [L45] int comp_m1_i ; [L494] int __retres1 ; [L498] CALL init_model() [L465] b0_val = 0 [L466] b0_ev = 2 [L467] b0_req_up = 0 [L468] b1_val = 0 [L469] b1_ev = 2 [L470] b1_req_up = 0 [L471] d0_val = 0 [L472] d0_ev = 2 [L473] d0_req_up = 0 [L474] d1_val = 0 [L475] d1_ev = 2 [L476] d1_req_up = 0 [L477] z_val = 0 [L478] z_ev = 2 [L479] z_req_up = 0 [L480] b0_val_t = 1 [L481] b0_req_up = 1 [L482] b1_val_t = 1 [L483] b1_req_up = 1 [L484] d0_val_t = 1 [L485] d0_req_up = 1 [L486] d1_val_t = 1 [L487] d1_req_up = 1 [L488] comp_m1_i = 0 [L498] RET init_model() [L499] CALL start_simulation() [L419] int kernel_st ; [L420] int tmp ; [L424] kernel_st = 0 [L425] CALL update_channels() [L212] COND TRUE (int )b0_req_up == 1 [L214] CALL update_b0() [L137] COND TRUE (int )b0_val != (int )b0_val_t [L138] b0_val = b0_val_t [L139] b0_ev = 0 [L143] b0_req_up = 0 [L214] RET update_b0() [L219] COND TRUE (int )b1_req_up == 1 [L221] CALL update_b1() [L152] COND TRUE (int )b1_val != (int )b1_val_t [L153] b1_val = b1_val_t [L154] b1_ev = 0 [L158] b1_req_up = 0 [L221] RET update_b1() [L226] COND TRUE (int )d0_req_up == 1 [L228] CALL update_d0() [L167] COND TRUE (int )d0_val != (int )d0_val_t [L168] d0_val = d0_val_t [L169] d0_ev = 0 [L173] d0_req_up = 0 [L228] RET update_d0() [L233] COND TRUE (int )d1_req_up == 1 [L235] CALL update_d1() [L182] COND TRUE (int )d1_val != (int )d1_val_t [L183] d1_val = d1_val_t [L184] d1_ev = 0 [L188] d1_req_up = 0 [L235] RET update_d1() [L240] COND FALSE !((int )z_req_up == 1) [L425] RET update_channels() [L426] CALL init_threads() [L255] COND FALSE !((int )comp_m1_i == 1) [L258] comp_m1_st = 2 [L426] RET init_threads() [L427] CALL fire_delta_events() [L321] COND TRUE (int )b0_ev == 0 [L322] b0_ev = 1 [L326] COND TRUE (int )b1_ev == 0 [L327] b1_ev = 1 [L331] COND TRUE (int )d0_ev == 0 [L332] d0_ev = 1 [L336] COND TRUE (int )d1_ev == 0 [L337] d1_ev = 1 [L341] COND FALSE !((int )z_ev == 0) [L427] RET fire_delta_events() [L428] CALL activate_threads() [L384] int tmp ; [L388] CALL, EXPR is_method1_triggered() [L104] int __retres1 ; [L107] COND TRUE (int )b0_ev == 1 [L108] __retres1 = 1 [L130] return (__retres1); [L388] RET, EXPR is_method1_triggered() [L388] tmp = is_method1_triggered() [L390] COND TRUE \read(tmp) [L391] comp_m1_st = 0 [L428] RET activate_threads() [L429] CALL reset_delta_events() [L354] COND TRUE (int )b0_ev == 1 [L355] b0_ev = 2 [L359] COND TRUE (int )b1_ev == 1 [L360] b1_ev = 2 [L364] COND TRUE (int )d0_ev == 1 [L365] d0_ev = 2 [L369] COND TRUE (int )d1_ev == 1 [L370] d1_ev = 2 [L374] COND FALSE !((int )z_ev == 1) [L429] RET reset_delta_events() [L432] COND TRUE 1 [L435] kernel_st = 1 [L436] CALL eval() [L280] int tmp ; [L281] int tmp___0 ; Loop: [L285] COND TRUE 1 [L288] CALL, EXPR exists_runnable_thread() [L265] int __retres1 ; [L268] COND TRUE (int )comp_m1_st == 0 [L269] __retres1 = 1 [L276] return (__retres1); [L288] RET, EXPR exists_runnable_thread() [L288] tmp___0 = exists_runnable_thread() [L290] COND TRUE \read(tmp___0) [L295] COND TRUE (int )comp_m1_st == 0 [L297] tmp = __VERIFIER_nondet_int() [L299] COND FALSE !(\read(tmp)) End of lasso representation. RESULT: Ultimate proved your program to be incorrect! [2022-02-21 04:21:30,980 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(TERM)