./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.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/seq-mthreaded/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.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 80f9a5324ebd6f7f9b0f4370bb23b9787fd1aa3c807ea310f755bbaf1b53f47a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:32:03,522 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:32:03,524 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:32:03,570 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:32:03,571 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:32:03,572 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:32:03,573 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:32:03,574 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:32:03,575 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:32:03,576 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:32:03,576 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:32:03,577 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:32:03,578 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:32:03,578 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:32:03,579 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:32:03,580 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:32:03,580 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:32:03,581 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:32:03,582 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:32:03,583 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:32:03,584 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:32:03,585 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:32:03,586 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:32:03,586 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:32:03,590 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:32:03,590 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:32:03,590 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:32:03,591 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:32:03,592 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:32:03,593 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:32:03,593 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:32:03,594 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:32:03,594 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:32:03,595 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:32:03,596 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:32:03,596 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:32:03,597 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:32:03,597 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:32:03,597 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:32:03,598 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:32:03,599 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:32:03,599 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:32:03,621 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:32:03,622 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:32:03,622 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:32:03,622 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:32:03,623 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:32:03,623 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:32:03,623 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:32:03,623 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:32:03,624 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:32:03,624 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:32:03,624 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:32:03,624 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:32:03,624 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:32:03,624 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:32:03,624 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:32:03,625 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:32:03,625 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:32:03,625 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:32:03,625 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:32:03,625 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:32:03,625 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:32:03,626 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:32:03,626 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:32:03,626 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:32:03,626 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:32:03,626 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:32:03,626 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:32:03,626 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:32:03,627 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:32:03,627 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:32:03,627 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:32:03,628 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:32:03,628 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 -> 80f9a5324ebd6f7f9b0f4370bb23b9787fd1aa3c807ea310f755bbaf1b53f47a [2022-02-21 04:32:03,821 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:32:03,844 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:32:03,847 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:32:03,848 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:32:03,848 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:32:03,849 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c [2022-02-21 04:32:03,899 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2baf3643c/b90c33d6ce654407af82c81e47e9a4da/FLAGc252c84e1 [2022-02-21 04:32:04,296 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:32:04,296 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c [2022-02-21 04:32:04,308 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2baf3643c/b90c33d6ce654407af82c81e47e9a4da/FLAGc252c84e1 [2022-02-21 04:32:04,317 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/2baf3643c/b90c33d6ce654407af82c81e47e9a4da [2022-02-21 04:32:04,319 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:32:04,320 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:32:04,322 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:32:04,322 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:32:04,324 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:32:04,325 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:32:04" (1/1) ... [2022-02-21 04:32:04,325 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a3e81fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:32:04, skipping insertion in model container [2022-02-21 04:32:04,326 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:32:04" (1/1) ... [2022-02-21 04:32:04,332 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:32:04,373 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:32:04,618 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/seq-mthreaded/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c[30998,31011] [2022-02-21 04:32:04,619 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:32:04,626 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:32:04,699 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/seq-mthreaded/pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c[30998,31011] [2022-02-21 04:32:04,700 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:32:04,710 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:32:04,711 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:32:04 WrapperNode [2022-02-21 04:32:04,711 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:32:04,712 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:32:04,712 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:32:04,712 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:32:04,716 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:32:04" (1/1) ... [2022-02-21 04:32:04,734 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:32:04" (1/1) ... [2022-02-21 04:32:04,795 INFO L137 Inliner]: procedures = 23, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 981 [2022-02-21 04:32:04,795 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:32:04,796 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:32:04,796 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:32:04,796 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:32:04,802 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:32:04" (1/1) ... [2022-02-21 04:32:04,802 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:32:04" (1/1) ... [2022-02-21 04:32:04,806 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:32:04" (1/1) ... [2022-02-21 04:32:04,806 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:32:04" (1/1) ... [2022-02-21 04:32:04,827 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:32:04" (1/1) ... [2022-02-21 04:32:04,836 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:32:04" (1/1) ... [2022-02-21 04:32:04,839 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:32:04" (1/1) ... [2022-02-21 04:32:04,843 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:32:04,844 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:32:04,844 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:32:04,844 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:32:04,845 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:32:04" (1/1) ... [2022-02-21 04:32:04,866 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:32:04,881 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:32:04,892 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:32:04,910 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:32:04,931 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:32:04,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:32:04,932 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:32:04,932 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:32:05,028 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:32:05,029 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:32:05,850 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:32:05,872 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:32:05,873 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 04:32:05,874 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:32:05 BoogieIcfgContainer [2022-02-21 04:32:05,874 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:32:05,875 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:32:05,875 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:32:05,878 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:32:05,879 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:32:05,879 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:32:04" (1/3) ... [2022-02-21 04:32:05,880 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7da3ffbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:32:05, skipping insertion in model container [2022-02-21 04:32:05,880 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:32:05,880 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:32:04" (2/3) ... [2022-02-21 04:32:05,880 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7da3ffbe and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:32:05, skipping insertion in model container [2022-02-21 04:32:05,880 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:32:05,881 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:32:05" (3/3) ... [2022-02-21 04:32:05,882 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c [2022-02-21 04:32:05,922 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:32:05,922 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:32:05,922 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:32:05,922 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:32:05,922 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:32:05,922 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:32:05,923 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:32:05,923 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:32:05,942 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 323 states, 322 states have (on average 1.8043478260869565) internal successors, (581), 322 states have internal predecessors, (581), 0 states have call successors, (0), 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:32:05,999 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 123 [2022-02-21 04:32:05,999 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:32:05,999 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:32:06,007 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:32:06,007 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] [2022-02-21 04:32:06,008 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:32:06,010 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 323 states, 322 states have (on average 1.8043478260869565) internal successors, (581), 322 states have internal predecessors, (581), 0 states have call successors, (0), 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:32:06,035 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 123 [2022-02-21 04:32:06,036 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:32:06,036 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:32:06,038 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:32:06,039 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] [2022-02-21 04:32:06,047 INFO L791 eck$LassoCheckResult]: Stem: 305#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(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~newmax4~0 := 0; 218#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~nondet55#1, main_#t~nondet56#1, main_#t~nondet57#1, main_#t~nondet58#1, main_#t~nondet59#1, main_#t~ret60#1, main_#t~ret61#1, main_#t~post62#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~ep13~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~ep14~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~ep21~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~ep23~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~ep24~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~ep31~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~ep32~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~ep34~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~ep41~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep42~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep43~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id1~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~r1~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st1~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~nl1~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~m1~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~max1~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode1~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~newmax1~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~r2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~nl2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~m2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~max2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~mode2~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~newmax2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~id3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~r3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~st3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~nl3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~m3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~max3~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~mode3~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~newmax3~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~id4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~r4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~st4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~nl4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;~m4~0 := main_#t~nondet56#1;havoc main_#t~nondet56#1;~max4~0 := main_#t~nondet57#1;havoc main_#t~nondet57#1;~mode4~0 := main_#t~nondet58#1;havoc main_#t~nondet58#1;~newmax4~0 := main_#t~nondet59#1;havoc main_#t~nondet59#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0; 34#L441true assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 253#L452true init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 104#L462true assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 153#L473true init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 285#L483true assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; 256#L494true init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 257#L504true assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; 60#L515true init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 3#L525true assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; 248#L536true init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 54#L546true assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; 321#L557true init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 69#L567true assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; 225#L578true init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); 115#L588true assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; 242#L599true init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); 101#L609true assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; 77#L620true init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); 107#L630true assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; 220#L641true init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); 303#L651true assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; 227#L662true init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); 141#L672true assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; 260#L683true init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); 309#L693true assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; 239#L704true init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); 180#L714true assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; 14#L725true init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); 315#L735true assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; 114#L746true init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); 97#L756true assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; 290#L767true init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); 36#L777true assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; 163#L788true init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); 224#L798true assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; 311#L809true init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); 228#L819true assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; 286#L830true init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); 135#L840true assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; 262#L851true init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); 205#L861true assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; 264#L872true init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); 217#L882true assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; 102#L893true init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); 282#L903true assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; 99#L914true init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); 268#L924true assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; 90#L935true init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); 130#L945true assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; 230#L945-1true init_#res#1 := init_~tmp___23~0#1; 13#L1130true main_#t~ret60#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret60#1;havoc main_#t~ret60#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 125#L21true assume !(0 == assume_abort_if_not_~cond#1); 195#L20true assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 161#L1271-2true [2022-02-21 04:32:06,048 INFO L793 eck$LassoCheckResult]: Loop: 161#L1271-2true assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 74#L114true assume !(0 != ~mode1~0 % 256); 277#L150true assume !(~r1~0 < 2); 181#L150-1true ~mode1~0 := 1; 61#L114-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 41#L178true assume !(0 != ~mode2~0 % 256); 314#L214true assume !(~r2~0 < 3); 105#L214-1true ~mode2~0 := 1; 183#L178-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 322#L242true assume !(0 != ~mode3~0 % 256); 169#L278true assume !(~r3~0 < 3); 129#L278-1true ~mode3~0 := 1; 236#L242-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1, node4_~newmax~3#1;havoc node4_~newmax~3#1;node4_~newmax~3#1 := 0; 156#L306true assume !(0 != ~mode4~0 % 256); 53#L342true assume !(~r4~0 < 3); 18#L342-1true ~mode4~0 := 1; 64#L306-2true assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 171#L1138true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; 199#L1138-1true check_#res#1 := check_~tmp~1#1; 139#L1190true main_#t~ret61#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret61#1;havoc main_#t~ret61#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 201#L1314true assume !(0 == assert_~arg#1 % 256); 289#L1309true assume { :end_inline_assert } true;main_#t~post62#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post62#1;havoc main_#t~post62#1; 161#L1271-2true [2022-02-21 04:32:06,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:32:06,053 INFO L85 PathProgramCache]: Analyzing trace with hash 2064134942, now seen corresponding path program 1 times [2022-02-21 04:32:06,060 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:32:06,061 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [85219462] [2022-02-21 04:32:06,061 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:32:06,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:32:06,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:32:06,367 INFO L290 TraceCheckUtils]: 0: Hoare triple {327#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(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~newmax4~0 := 0; {327#true} is VALID [2022-02-21 04:32:06,367 INFO L290 TraceCheckUtils]: 1: Hoare triple {327#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~nondet55#1, main_#t~nondet56#1, main_#t~nondet57#1, main_#t~nondet58#1, main_#t~nondet59#1, main_#t~ret60#1, main_#t~ret61#1, main_#t~post62#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~ep13~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~ep14~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~ep21~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~ep23~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~ep24~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~ep31~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~ep32~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~ep34~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~ep41~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep42~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep43~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id1~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~r1~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st1~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~nl1~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~m1~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~max1~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode1~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~newmax1~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~r2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~nl2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~m2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~max2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~mode2~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~newmax2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~id3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~r3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~st3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~nl3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~m3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~max3~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~mode3~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~newmax3~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~id4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~r4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~st4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~nl4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;~m4~0 := main_#t~nondet56#1;havoc main_#t~nondet56#1;~max4~0 := main_#t~nondet57#1;havoc main_#t~nondet57#1;~mode4~0 := main_#t~nondet58#1;havoc main_#t~nondet58#1;~newmax4~0 := main_#t~nondet59#1;havoc main_#t~nondet59#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0; {327#true} is VALID [2022-02-21 04:32:06,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {327#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {327#true} is VALID [2022-02-21 04:32:06,368 INFO L290 TraceCheckUtils]: 3: Hoare triple {327#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:32:06,368 INFO L290 TraceCheckUtils]: 4: Hoare triple {327#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {327#true} is VALID [2022-02-21 04:32:06,368 INFO L290 TraceCheckUtils]: 5: Hoare triple {327#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:32:06,368 INFO L290 TraceCheckUtils]: 6: Hoare triple {327#true} assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; {327#true} is VALID [2022-02-21 04:32:06,369 INFO L290 TraceCheckUtils]: 7: Hoare triple {327#true} init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:32:06,369 INFO L290 TraceCheckUtils]: 8: Hoare triple {327#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; {327#true} is VALID [2022-02-21 04:32:06,369 INFO L290 TraceCheckUtils]: 9: Hoare triple {327#true} init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:32:06,369 INFO L290 TraceCheckUtils]: 10: Hoare triple {327#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; {327#true} is VALID [2022-02-21 04:32:06,369 INFO L290 TraceCheckUtils]: 11: Hoare triple {327#true} init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:32:06,370 INFO L290 TraceCheckUtils]: 12: Hoare triple {327#true} assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; {327#true} is VALID [2022-02-21 04:32:06,370 INFO L290 TraceCheckUtils]: 13: Hoare triple {327#true} init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:32:06,370 INFO L290 TraceCheckUtils]: 14: Hoare triple {327#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; {327#true} is VALID [2022-02-21 04:32:06,370 INFO L290 TraceCheckUtils]: 15: Hoare triple {327#true} init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:32:06,370 INFO L290 TraceCheckUtils]: 16: Hoare triple {327#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; {327#true} is VALID [2022-02-21 04:32:06,371 INFO L290 TraceCheckUtils]: 17: Hoare triple {327#true} init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:32:06,371 INFO L290 TraceCheckUtils]: 18: Hoare triple {327#true} assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; {327#true} is VALID [2022-02-21 04:32:06,371 INFO L290 TraceCheckUtils]: 19: Hoare triple {327#true} init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:32:06,371 INFO L290 TraceCheckUtils]: 20: Hoare triple {327#true} assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; {327#true} is VALID [2022-02-21 04:32:06,371 INFO L290 TraceCheckUtils]: 21: Hoare triple {327#true} init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:32:06,371 INFO L290 TraceCheckUtils]: 22: Hoare triple {327#true} assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; {327#true} is VALID [2022-02-21 04:32:06,372 INFO L290 TraceCheckUtils]: 23: Hoare triple {327#true} init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:32:06,372 INFO L290 TraceCheckUtils]: 24: Hoare triple {327#true} assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; {327#true} is VALID [2022-02-21 04:32:06,372 INFO L290 TraceCheckUtils]: 25: Hoare triple {327#true} init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:32:06,372 INFO L290 TraceCheckUtils]: 26: Hoare triple {327#true} assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; {327#true} is VALID [2022-02-21 04:32:06,372 INFO L290 TraceCheckUtils]: 27: Hoare triple {327#true} init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:32:06,373 INFO L290 TraceCheckUtils]: 28: Hoare triple {327#true} assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; {327#true} is VALID [2022-02-21 04:32:06,373 INFO L290 TraceCheckUtils]: 29: Hoare triple {327#true} init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:32:06,373 INFO L290 TraceCheckUtils]: 30: Hoare triple {327#true} assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; {327#true} is VALID [2022-02-21 04:32:06,373 INFO L290 TraceCheckUtils]: 31: Hoare triple {327#true} init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:32:06,373 INFO L290 TraceCheckUtils]: 32: Hoare triple {327#true} assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; {327#true} is VALID [2022-02-21 04:32:06,374 INFO L290 TraceCheckUtils]: 33: Hoare triple {327#true} init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:32:06,374 INFO L290 TraceCheckUtils]: 34: Hoare triple {327#true} assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; {327#true} is VALID [2022-02-21 04:32:06,374 INFO L290 TraceCheckUtils]: 35: Hoare triple {327#true} init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:32:06,374 INFO L290 TraceCheckUtils]: 36: Hoare triple {327#true} assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; {327#true} is VALID [2022-02-21 04:32:06,374 INFO L290 TraceCheckUtils]: 37: Hoare triple {327#true} init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:32:06,375 INFO L290 TraceCheckUtils]: 38: Hoare triple {327#true} assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; {327#true} is VALID [2022-02-21 04:32:06,375 INFO L290 TraceCheckUtils]: 39: Hoare triple {327#true} init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:32:06,375 INFO L290 TraceCheckUtils]: 40: Hoare triple {327#true} assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; {327#true} is VALID [2022-02-21 04:32:06,375 INFO L290 TraceCheckUtils]: 41: Hoare triple {327#true} init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:32:06,375 INFO L290 TraceCheckUtils]: 42: Hoare triple {327#true} assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; {327#true} is VALID [2022-02-21 04:32:06,376 INFO L290 TraceCheckUtils]: 43: Hoare triple {327#true} init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:32:06,376 INFO L290 TraceCheckUtils]: 44: Hoare triple {327#true} assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; {327#true} is VALID [2022-02-21 04:32:06,376 INFO L290 TraceCheckUtils]: 45: Hoare triple {327#true} init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:32:06,376 INFO L290 TraceCheckUtils]: 46: Hoare triple {327#true} assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; {327#true} is VALID [2022-02-21 04:32:06,377 INFO L290 TraceCheckUtils]: 47: Hoare triple {327#true} init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:32:06,377 INFO L290 TraceCheckUtils]: 48: Hoare triple {327#true} assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; {327#true} is VALID [2022-02-21 04:32:06,377 INFO L290 TraceCheckUtils]: 49: Hoare triple {327#true} init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); {327#true} is VALID [2022-02-21 04:32:06,378 INFO L290 TraceCheckUtils]: 50: Hoare triple {327#true} assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; {329#(= |ULTIMATE.start_init_~tmp___23~0#1| 0)} is VALID [2022-02-21 04:32:06,381 INFO L290 TraceCheckUtils]: 51: Hoare triple {329#(= |ULTIMATE.start_init_~tmp___23~0#1| 0)} init_#res#1 := init_~tmp___23~0#1; {330#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:32:06,382 INFO L290 TraceCheckUtils]: 52: Hoare triple {330#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret60#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret60#1;havoc main_#t~ret60#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {331#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:32:06,382 INFO L290 TraceCheckUtils]: 53: Hoare triple {331#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {328#false} is VALID [2022-02-21 04:32:06,382 INFO L290 TraceCheckUtils]: 54: Hoare triple {328#false} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {328#false} is VALID [2022-02-21 04:32:06,383 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:32:06,384 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:32:06,384 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [85219462] [2022-02-21 04:32:06,385 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [85219462] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:32:06,385 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:32:06,385 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:32:06,387 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611646017] [2022-02-21 04:32:06,387 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:32:06,391 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:32:06,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:32:06,392 INFO L85 PathProgramCache]: Analyzing trace with hash -340497803, now seen corresponding path program 1 times [2022-02-21 04:32:06,392 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:32:06,392 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1700878235] [2022-02-21 04:32:06,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:32:06,392 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:32:06,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:32:06,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {332#true} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {332#true} is VALID [2022-02-21 04:32:06,521 INFO L290 TraceCheckUtils]: 1: Hoare triple {332#true} assume !(0 != ~mode1~0 % 256); {332#true} is VALID [2022-02-21 04:32:06,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {332#true} assume !(~r1~0 < 2); {332#true} is VALID [2022-02-21 04:32:06,524 INFO L290 TraceCheckUtils]: 3: Hoare triple {332#true} ~mode1~0 := 1; {332#true} is VALID [2022-02-21 04:32:06,525 INFO L290 TraceCheckUtils]: 4: Hoare triple {332#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {332#true} is VALID [2022-02-21 04:32:06,525 INFO L290 TraceCheckUtils]: 5: Hoare triple {332#true} assume !(0 != ~mode2~0 % 256); {332#true} is VALID [2022-02-21 04:32:06,525 INFO L290 TraceCheckUtils]: 6: Hoare triple {332#true} assume !(~r2~0 < 3); {332#true} is VALID [2022-02-21 04:32:06,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {332#true} ~mode2~0 := 1; {332#true} is VALID [2022-02-21 04:32:06,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {332#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {332#true} is VALID [2022-02-21 04:32:06,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {332#true} assume !(0 != ~mode3~0 % 256); {332#true} is VALID [2022-02-21 04:32:06,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {332#true} assume !(~r3~0 < 3); {332#true} is VALID [2022-02-21 04:32:06,527 INFO L290 TraceCheckUtils]: 11: Hoare triple {332#true} ~mode3~0 := 1; {332#true} is VALID [2022-02-21 04:32:06,527 INFO L290 TraceCheckUtils]: 12: Hoare triple {332#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1, node4_~newmax~3#1;havoc node4_~newmax~3#1;node4_~newmax~3#1 := 0; {332#true} is VALID [2022-02-21 04:32:06,527 INFO L290 TraceCheckUtils]: 13: Hoare triple {332#true} assume !(0 != ~mode4~0 % 256); {332#true} is VALID [2022-02-21 04:32:06,527 INFO L290 TraceCheckUtils]: 14: Hoare triple {332#true} assume !(~r4~0 < 3); {332#true} is VALID [2022-02-21 04:32:06,527 INFO L290 TraceCheckUtils]: 15: Hoare triple {332#true} ~mode4~0 := 1; {332#true} is VALID [2022-02-21 04:32:06,528 INFO L290 TraceCheckUtils]: 16: Hoare triple {332#true} assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {332#true} is VALID [2022-02-21 04:32:06,528 INFO L290 TraceCheckUtils]: 17: Hoare triple {332#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {334#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:32:06,529 INFO L290 TraceCheckUtils]: 18: Hoare triple {334#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {335#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:32:06,530 INFO L290 TraceCheckUtils]: 19: Hoare triple {335#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret61#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret61#1;havoc main_#t~ret61#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {336#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} is VALID [2022-02-21 04:32:06,530 INFO L290 TraceCheckUtils]: 20: Hoare triple {336#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} assume !(0 == assert_~arg#1 % 256); {333#false} is VALID [2022-02-21 04:32:06,530 INFO L290 TraceCheckUtils]: 21: Hoare triple {333#false} assume { :end_inline_assert } true;main_#t~post62#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post62#1;havoc main_#t~post62#1; {333#false} is VALID [2022-02-21 04:32:06,531 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:32:06,532 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:32:06,532 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1700878235] [2022-02-21 04:32:06,532 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1700878235] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:32:06,533 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:32:06,533 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:32:06,533 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1503373353] [2022-02-21 04:32:06,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:32:06,535 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:32:06,537 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:32:06,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:32:06,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:32:06,555 INFO L87 Difference]: Start difference. First operand has 323 states, 322 states have (on average 1.8043478260869565) internal successors, (581), 322 states have internal predecessors, (581), 0 states have call successors, (0), 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 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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:32:07,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:32:07,614 INFO L93 Difference]: Finished difference Result 327 states and 581 transitions. [2022-02-21 04:32:07,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:32:07,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 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:32:07,633 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:32:07,637 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 327 states and 581 transitions. [2022-02-21 04:32:07,648 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 122 [2022-02-21 04:32:07,659 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 327 states to 318 states and 564 transitions. [2022-02-21 04:32:07,660 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 318 [2022-02-21 04:32:07,661 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 318 [2022-02-21 04:32:07,661 INFO L73 IsDeterministic]: Start isDeterministic. Operand 318 states and 564 transitions. [2022-02-21 04:32:07,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:32:07,668 INFO L681 BuchiCegarLoop]: Abstraction has 318 states and 564 transitions. [2022-02-21 04:32:07,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 318 states and 564 transitions. [2022-02-21 04:32:07,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 318 to 318. [2022-02-21 04:32:07,697 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:32:07,698 INFO L82 GeneralOperation]: Start isEquivalent. First operand 318 states and 564 transitions. Second operand has 318 states, 318 states have (on average 1.7735849056603774) internal successors, (564), 317 states have internal predecessors, (564), 0 states have call successors, (0), 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:32:07,700 INFO L74 IsIncluded]: Start isIncluded. First operand 318 states and 564 transitions. Second operand has 318 states, 318 states have (on average 1.7735849056603774) internal successors, (564), 317 states have internal predecessors, (564), 0 states have call successors, (0), 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:32:07,702 INFO L87 Difference]: Start difference. First operand 318 states and 564 transitions. Second operand has 318 states, 318 states have (on average 1.7735849056603774) internal successors, (564), 317 states have internal predecessors, (564), 0 states have call successors, (0), 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:32:07,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:32:07,718 INFO L93 Difference]: Finished difference Result 318 states and 564 transitions. [2022-02-21 04:32:07,718 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 564 transitions. [2022-02-21 04:32:07,720 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:32:07,720 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:32:07,721 INFO L74 IsIncluded]: Start isIncluded. First operand has 318 states, 318 states have (on average 1.7735849056603774) internal successors, (564), 317 states have internal predecessors, (564), 0 states have call successors, (0), 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 318 states and 564 transitions. [2022-02-21 04:32:07,722 INFO L87 Difference]: Start difference. First operand has 318 states, 318 states have (on average 1.7735849056603774) internal successors, (564), 317 states have internal predecessors, (564), 0 states have call successors, (0), 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 318 states and 564 transitions. [2022-02-21 04:32:07,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:32:07,731 INFO L93 Difference]: Finished difference Result 318 states and 564 transitions. [2022-02-21 04:32:07,731 INFO L276 IsEmpty]: Start isEmpty. Operand 318 states and 564 transitions. [2022-02-21 04:32:07,732 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:32:07,732 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:32:07,733 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:32:07,733 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:32:07,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 318 states, 318 states have (on average 1.7735849056603774) internal successors, (564), 317 states have internal predecessors, (564), 0 states have call successors, (0), 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:32:07,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 318 states to 318 states and 564 transitions. [2022-02-21 04:32:07,742 INFO L704 BuchiCegarLoop]: Abstraction has 318 states and 564 transitions. [2022-02-21 04:32:07,742 INFO L587 BuchiCegarLoop]: Abstraction has 318 states and 564 transitions. [2022-02-21 04:32:07,742 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:32:07,742 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 318 states and 564 transitions. [2022-02-21 04:32:07,743 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 122 [2022-02-21 04:32:07,744 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:32:07,744 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:32:07,745 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:32:07,745 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] [2022-02-21 04:32:07,745 INFO L791 eck$LassoCheckResult]: Stem: 984#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(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~newmax4~0 := 0; 965#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~nondet55#1, main_#t~nondet56#1, main_#t~nondet57#1, main_#t~nondet58#1, main_#t~nondet59#1, main_#t~ret60#1, main_#t~ret61#1, main_#t~post62#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~ep13~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~ep14~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~ep21~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~ep23~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~ep24~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~ep31~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~ep32~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~ep34~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~ep41~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep42~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep43~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id1~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~r1~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st1~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~nl1~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~m1~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~max1~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode1~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~newmax1~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~r2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~nl2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~m2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~max2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~mode2~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~newmax2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~id3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~r3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~st3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~nl3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~m3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~max3~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~mode3~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~newmax3~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~id4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~r4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~st4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~nl4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;~m4~0 := main_#t~nondet56#1;havoc main_#t~nondet56#1;~max4~0 := main_#t~nondet57#1;havoc main_#t~nondet57#1;~mode4~0 := main_#t~nondet58#1;havoc main_#t~nondet58#1;~newmax4~0 := main_#t~nondet59#1;havoc main_#t~nondet59#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0; 743#L441 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 744#L452 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 858#L462 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 825#L473 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 911#L483 assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; 950#L494 init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 978#L504 assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; 765#L515 init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 671#L525 assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; 672#L536 init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 780#L546 assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; 781#L557 init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 805#L567 assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; 806#L578 init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); 870#L588 assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; 724#L599 init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); 856#L609 assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; 788#L620 init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); 823#L630 assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; 763#L641 init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); 967#L651 assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; 726#L662 init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); 900#L672 assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; 901#L683 init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); 979#L693 assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; 714#L704 init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); 939#L714 assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; 700#L725 init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); 701#L735 assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; 675#L746 init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); 849#L756 assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; 691#L767 init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); 746#L777 assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; 747#L788 init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); 921#L798 assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; 889#L809 init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); 970#L819 assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; 934#L830 init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); 893#L840 assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; 848#L851 init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); 958#L861 assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; 794#L872 init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); 964#L882 assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; 771#L893 init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); 857#L903 assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; 852#L914 init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); 853#L924 assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; 838#L935 init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); 839#L945 assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; 682#L945-1 init_#res#1 := init_~tmp___23~0#1; 693#L1130 main_#t~ret60#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret60#1;havoc main_#t~ret60#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 694#L21 assume !(0 == assume_abort_if_not_~cond#1); 882#L20 assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 920#L1271-2 [2022-02-21 04:32:07,752 INFO L793 eck$LassoCheckResult]: Loop: 920#L1271-2 assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 814#L114 assume !(0 != ~mode1~0 % 256); 815#L150 assume !(~r1~0 < 2); 810#L150-1 ~mode1~0 := 1; 792#L114-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 754#L178 assume !(0 != ~mode2~0 % 256); 755#L214 assume !(~r2~0 < 3); 711#L214-1 ~mode2~0 := 1; 860#L178-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 941#L242 assume !(0 != ~mode3~0 % 256); 927#L278 assume !(~r3~0 < 3); 829#L278-1 ~mode3~0 := 1; 881#L242-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1, node4_~newmax~3#1;havoc node4_~newmax~3#1;node4_~newmax~3#1 := 0; 914#L306 assume !(0 != ~mode4~0 % 256); 776#L342 assume !(~r4~0 < 3); 704#L342-1 ~mode4~0 := 1; 705#L306-2 assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 797#L1138 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 929#L1139 assume ~st1~0 + ~nl1~0 <= 1; 966#L1140 assume ~st2~0 + ~nl2~0 <= 1; 931#L1141 assume ~st3~0 + ~nl3~0 <= 1; 932#L1142 assume ~st4~0 + ~nl4~0 <= 1; 861#L1143 assume ~r1~0 >= 3; 732#L1147 assume ~r1~0 < 3; 733#L1152 assume ~r1~0 >= 3; 906#L1157 assume ~r1~0 < 3;check_~tmp~1#1 := 1; 908#L1138-1 check_#res#1 := check_~tmp~1#1; 897#L1190 main_#t~ret61#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret61#1;havoc main_#t~ret61#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 898#L1314 assume !(0 == assert_~arg#1 % 256); 953#L1309 assume { :end_inline_assert } true;main_#t~post62#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post62#1;havoc main_#t~post62#1; 920#L1271-2 [2022-02-21 04:32:07,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:32:07,753 INFO L85 PathProgramCache]: Analyzing trace with hash 2064134942, now seen corresponding path program 2 times [2022-02-21 04:32:07,753 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:32:07,753 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2144029914] [2022-02-21 04:32:07,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:32:07,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:32:07,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:32:07,847 INFO L290 TraceCheckUtils]: 0: Hoare triple {1625#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(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~newmax4~0 := 0; {1625#true} is VALID [2022-02-21 04:32:07,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {1625#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~nondet55#1, main_#t~nondet56#1, main_#t~nondet57#1, main_#t~nondet58#1, main_#t~nondet59#1, main_#t~ret60#1, main_#t~ret61#1, main_#t~post62#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~ep13~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~ep14~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~ep21~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~ep23~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~ep24~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~ep31~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~ep32~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~ep34~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~ep41~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep42~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep43~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id1~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~r1~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st1~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~nl1~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~m1~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~max1~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode1~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~newmax1~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~r2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~nl2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~m2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~max2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~mode2~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~newmax2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~id3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~r3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~st3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~nl3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~m3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~max3~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~mode3~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~newmax3~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~id4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~r4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~st4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~nl4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;~m4~0 := main_#t~nondet56#1;havoc main_#t~nondet56#1;~max4~0 := main_#t~nondet57#1;havoc main_#t~nondet57#1;~mode4~0 := main_#t~nondet58#1;havoc main_#t~nondet58#1;~newmax4~0 := main_#t~nondet59#1;havoc main_#t~nondet59#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0; {1625#true} is VALID [2022-02-21 04:32:07,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {1625#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {1625#true} is VALID [2022-02-21 04:32:07,848 INFO L290 TraceCheckUtils]: 3: Hoare triple {1625#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:32:07,848 INFO L290 TraceCheckUtils]: 4: Hoare triple {1625#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {1625#true} is VALID [2022-02-21 04:32:07,848 INFO L290 TraceCheckUtils]: 5: Hoare triple {1625#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:32:07,848 INFO L290 TraceCheckUtils]: 6: Hoare triple {1625#true} assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; {1625#true} is VALID [2022-02-21 04:32:07,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {1625#true} init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:32:07,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {1625#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; {1625#true} is VALID [2022-02-21 04:32:07,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {1625#true} init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:32:07,849 INFO L290 TraceCheckUtils]: 10: Hoare triple {1625#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; {1625#true} is VALID [2022-02-21 04:32:07,849 INFO L290 TraceCheckUtils]: 11: Hoare triple {1625#true} init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:32:07,850 INFO L290 TraceCheckUtils]: 12: Hoare triple {1625#true} assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; {1625#true} is VALID [2022-02-21 04:32:07,850 INFO L290 TraceCheckUtils]: 13: Hoare triple {1625#true} init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:32:07,850 INFO L290 TraceCheckUtils]: 14: Hoare triple {1625#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; {1625#true} is VALID [2022-02-21 04:32:07,850 INFO L290 TraceCheckUtils]: 15: Hoare triple {1625#true} init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:32:07,850 INFO L290 TraceCheckUtils]: 16: Hoare triple {1625#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; {1625#true} is VALID [2022-02-21 04:32:07,850 INFO L290 TraceCheckUtils]: 17: Hoare triple {1625#true} init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:32:07,851 INFO L290 TraceCheckUtils]: 18: Hoare triple {1625#true} assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; {1625#true} is VALID [2022-02-21 04:32:07,851 INFO L290 TraceCheckUtils]: 19: Hoare triple {1625#true} init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:32:07,851 INFO L290 TraceCheckUtils]: 20: Hoare triple {1625#true} assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; {1625#true} is VALID [2022-02-21 04:32:07,851 INFO L290 TraceCheckUtils]: 21: Hoare triple {1625#true} init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:32:07,851 INFO L290 TraceCheckUtils]: 22: Hoare triple {1625#true} assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; {1625#true} is VALID [2022-02-21 04:32:07,851 INFO L290 TraceCheckUtils]: 23: Hoare triple {1625#true} init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:32:07,852 INFO L290 TraceCheckUtils]: 24: Hoare triple {1625#true} assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; {1625#true} is VALID [2022-02-21 04:32:07,852 INFO L290 TraceCheckUtils]: 25: Hoare triple {1625#true} init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:32:07,852 INFO L290 TraceCheckUtils]: 26: Hoare triple {1625#true} assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; {1625#true} is VALID [2022-02-21 04:32:07,852 INFO L290 TraceCheckUtils]: 27: Hoare triple {1625#true} init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:32:07,852 INFO L290 TraceCheckUtils]: 28: Hoare triple {1625#true} assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; {1625#true} is VALID [2022-02-21 04:32:07,852 INFO L290 TraceCheckUtils]: 29: Hoare triple {1625#true} init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:32:07,853 INFO L290 TraceCheckUtils]: 30: Hoare triple {1625#true} assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; {1625#true} is VALID [2022-02-21 04:32:07,853 INFO L290 TraceCheckUtils]: 31: Hoare triple {1625#true} init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:32:07,853 INFO L290 TraceCheckUtils]: 32: Hoare triple {1625#true} assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; {1625#true} is VALID [2022-02-21 04:32:07,853 INFO L290 TraceCheckUtils]: 33: Hoare triple {1625#true} init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:32:07,853 INFO L290 TraceCheckUtils]: 34: Hoare triple {1625#true} assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; {1625#true} is VALID [2022-02-21 04:32:07,853 INFO L290 TraceCheckUtils]: 35: Hoare triple {1625#true} init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:32:07,854 INFO L290 TraceCheckUtils]: 36: Hoare triple {1625#true} assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; {1625#true} is VALID [2022-02-21 04:32:07,854 INFO L290 TraceCheckUtils]: 37: Hoare triple {1625#true} init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:32:07,854 INFO L290 TraceCheckUtils]: 38: Hoare triple {1625#true} assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; {1625#true} is VALID [2022-02-21 04:32:07,854 INFO L290 TraceCheckUtils]: 39: Hoare triple {1625#true} init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:32:07,854 INFO L290 TraceCheckUtils]: 40: Hoare triple {1625#true} assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; {1625#true} is VALID [2022-02-21 04:32:07,855 INFO L290 TraceCheckUtils]: 41: Hoare triple {1625#true} init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:32:07,855 INFO L290 TraceCheckUtils]: 42: Hoare triple {1625#true} assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; {1625#true} is VALID [2022-02-21 04:32:07,855 INFO L290 TraceCheckUtils]: 43: Hoare triple {1625#true} init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:32:07,855 INFO L290 TraceCheckUtils]: 44: Hoare triple {1625#true} assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; {1625#true} is VALID [2022-02-21 04:32:07,855 INFO L290 TraceCheckUtils]: 45: Hoare triple {1625#true} init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:32:07,855 INFO L290 TraceCheckUtils]: 46: Hoare triple {1625#true} assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; {1625#true} is VALID [2022-02-21 04:32:07,856 INFO L290 TraceCheckUtils]: 47: Hoare triple {1625#true} init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:32:07,856 INFO L290 TraceCheckUtils]: 48: Hoare triple {1625#true} assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; {1625#true} is VALID [2022-02-21 04:32:07,856 INFO L290 TraceCheckUtils]: 49: Hoare triple {1625#true} init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); {1625#true} is VALID [2022-02-21 04:32:07,856 INFO L290 TraceCheckUtils]: 50: Hoare triple {1625#true} assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; {1627#(= |ULTIMATE.start_init_~tmp___23~0#1| 0)} is VALID [2022-02-21 04:32:07,857 INFO L290 TraceCheckUtils]: 51: Hoare triple {1627#(= |ULTIMATE.start_init_~tmp___23~0#1| 0)} init_#res#1 := init_~tmp___23~0#1; {1628#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:32:07,857 INFO L290 TraceCheckUtils]: 52: Hoare triple {1628#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret60#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret60#1;havoc main_#t~ret60#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1629#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:32:07,857 INFO L290 TraceCheckUtils]: 53: Hoare triple {1629#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {1626#false} is VALID [2022-02-21 04:32:07,858 INFO L290 TraceCheckUtils]: 54: Hoare triple {1626#false} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1626#false} is VALID [2022-02-21 04:32:07,858 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:32:07,858 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:32:07,858 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2144029914] [2022-02-21 04:32:07,859 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2144029914] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:32:07,859 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:32:07,859 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:32:07,859 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255793714] [2022-02-21 04:32:07,859 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:32:07,859 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:32:07,860 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:32:07,860 INFO L85 PathProgramCache]: Analyzing trace with hash 1528981060, now seen corresponding path program 1 times [2022-02-21 04:32:07,860 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:32:07,860 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912607080] [2022-02-21 04:32:07,860 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:32:07,861 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:32:07,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:32:07,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {1630#true} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {1630#true} is VALID [2022-02-21 04:32:07,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {1630#true} assume !(0 != ~mode1~0 % 256); {1630#true} is VALID [2022-02-21 04:32:07,884 INFO L290 TraceCheckUtils]: 2: Hoare triple {1630#true} assume !(~r1~0 < 2); {1630#true} is VALID [2022-02-21 04:32:07,884 INFO L290 TraceCheckUtils]: 3: Hoare triple {1630#true} ~mode1~0 := 1; {1630#true} is VALID [2022-02-21 04:32:07,884 INFO L290 TraceCheckUtils]: 4: Hoare triple {1630#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {1630#true} is VALID [2022-02-21 04:32:07,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {1630#true} assume !(0 != ~mode2~0 % 256); {1630#true} is VALID [2022-02-21 04:32:07,885 INFO L290 TraceCheckUtils]: 6: Hoare triple {1630#true} assume !(~r2~0 < 3); {1630#true} is VALID [2022-02-21 04:32:07,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {1630#true} ~mode2~0 := 1; {1630#true} is VALID [2022-02-21 04:32:07,885 INFO L290 TraceCheckUtils]: 8: Hoare triple {1630#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {1630#true} is VALID [2022-02-21 04:32:07,885 INFO L290 TraceCheckUtils]: 9: Hoare triple {1630#true} assume !(0 != ~mode3~0 % 256); {1630#true} is VALID [2022-02-21 04:32:07,885 INFO L290 TraceCheckUtils]: 10: Hoare triple {1630#true} assume !(~r3~0 < 3); {1630#true} is VALID [2022-02-21 04:32:07,885 INFO L290 TraceCheckUtils]: 11: Hoare triple {1630#true} ~mode3~0 := 1; {1630#true} is VALID [2022-02-21 04:32:07,886 INFO L290 TraceCheckUtils]: 12: Hoare triple {1630#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1, node4_~newmax~3#1;havoc node4_~newmax~3#1;node4_~newmax~3#1 := 0; {1630#true} is VALID [2022-02-21 04:32:07,886 INFO L290 TraceCheckUtils]: 13: Hoare triple {1630#true} assume !(0 != ~mode4~0 % 256); {1630#true} is VALID [2022-02-21 04:32:07,886 INFO L290 TraceCheckUtils]: 14: Hoare triple {1630#true} assume !(~r4~0 < 3); {1630#true} is VALID [2022-02-21 04:32:07,886 INFO L290 TraceCheckUtils]: 15: Hoare triple {1630#true} ~mode4~0 := 1; {1630#true} is VALID [2022-02-21 04:32:07,886 INFO L290 TraceCheckUtils]: 16: Hoare triple {1630#true} assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1630#true} is VALID [2022-02-21 04:32:07,886 INFO L290 TraceCheckUtils]: 17: Hoare triple {1630#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {1630#true} is VALID [2022-02-21 04:32:07,886 INFO L290 TraceCheckUtils]: 18: Hoare triple {1630#true} assume ~st1~0 + ~nl1~0 <= 1; {1630#true} is VALID [2022-02-21 04:32:07,887 INFO L290 TraceCheckUtils]: 19: Hoare triple {1630#true} assume ~st2~0 + ~nl2~0 <= 1; {1630#true} is VALID [2022-02-21 04:32:07,887 INFO L290 TraceCheckUtils]: 20: Hoare triple {1630#true} assume ~st3~0 + ~nl3~0 <= 1; {1630#true} is VALID [2022-02-21 04:32:07,887 INFO L290 TraceCheckUtils]: 21: Hoare triple {1630#true} assume ~st4~0 + ~nl4~0 <= 1; {1630#true} is VALID [2022-02-21 04:32:07,887 INFO L290 TraceCheckUtils]: 22: Hoare triple {1630#true} assume ~r1~0 >= 3; {1632#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:32:07,888 INFO L290 TraceCheckUtils]: 23: Hoare triple {1632#(not (<= ~r1~0 2))} assume ~r1~0 < 3; {1631#false} is VALID [2022-02-21 04:32:07,888 INFO L290 TraceCheckUtils]: 24: Hoare triple {1631#false} assume ~r1~0 >= 3; {1631#false} is VALID [2022-02-21 04:32:07,888 INFO L290 TraceCheckUtils]: 25: Hoare triple {1631#false} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {1631#false} is VALID [2022-02-21 04:32:07,888 INFO L290 TraceCheckUtils]: 26: Hoare triple {1631#false} check_#res#1 := check_~tmp~1#1; {1631#false} is VALID [2022-02-21 04:32:07,888 INFO L290 TraceCheckUtils]: 27: Hoare triple {1631#false} main_#t~ret61#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret61#1;havoc main_#t~ret61#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1631#false} is VALID [2022-02-21 04:32:07,888 INFO L290 TraceCheckUtils]: 28: Hoare triple {1631#false} assume !(0 == assert_~arg#1 % 256); {1631#false} is VALID [2022-02-21 04:32:07,888 INFO L290 TraceCheckUtils]: 29: Hoare triple {1631#false} assume { :end_inline_assert } true;main_#t~post62#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post62#1;havoc main_#t~post62#1; {1631#false} is VALID [2022-02-21 04:32:07,889 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:32:07,889 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:32:07,889 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912607080] [2022-02-21 04:32:07,889 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912607080] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:32:07,889 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:32:07,889 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:32:07,890 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469089996] [2022-02-21 04:32:07,890 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:32:07,890 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:32:07,890 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:32:07,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:32:07,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:32:07,891 INFO L87 Difference]: Start difference. First operand 318 states and 564 transitions. cyclomatic complexity: 247 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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:32:08,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:32:08,382 INFO L93 Difference]: Finished difference Result 415 states and 719 transitions. [2022-02-21 04:32:08,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:32:08,382 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 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:32:08,401 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:32:08,402 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 415 states and 719 transitions. [2022-02-21 04:32:08,413 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 219 [2022-02-21 04:32:08,423 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 415 states to 415 states and 719 transitions. [2022-02-21 04:32:08,423 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 415 [2022-02-21 04:32:08,424 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 415 [2022-02-21 04:32:08,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 415 states and 719 transitions. [2022-02-21 04:32:08,425 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:32:08,425 INFO L681 BuchiCegarLoop]: Abstraction has 415 states and 719 transitions. [2022-02-21 04:32:08,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 415 states and 719 transitions. [2022-02-21 04:32:08,434 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 415 to 415. [2022-02-21 04:32:08,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:32:08,437 INFO L82 GeneralOperation]: Start isEquivalent. First operand 415 states and 719 transitions. Second operand has 415 states, 415 states have (on average 1.7325301204819277) internal successors, (719), 414 states have internal predecessors, (719), 0 states have call successors, (0), 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:32:08,438 INFO L74 IsIncluded]: Start isIncluded. First operand 415 states and 719 transitions. Second operand has 415 states, 415 states have (on average 1.7325301204819277) internal successors, (719), 414 states have internal predecessors, (719), 0 states have call successors, (0), 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:32:08,439 INFO L87 Difference]: Start difference. First operand 415 states and 719 transitions. Second operand has 415 states, 415 states have (on average 1.7325301204819277) internal successors, (719), 414 states have internal predecessors, (719), 0 states have call successors, (0), 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:32:08,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:32:08,454 INFO L93 Difference]: Finished difference Result 415 states and 719 transitions. [2022-02-21 04:32:08,454 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 719 transitions. [2022-02-21 04:32:08,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:32:08,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:32:08,458 INFO L74 IsIncluded]: Start isIncluded. First operand has 415 states, 415 states have (on average 1.7325301204819277) internal successors, (719), 414 states have internal predecessors, (719), 0 states have call successors, (0), 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 415 states and 719 transitions. [2022-02-21 04:32:08,459 INFO L87 Difference]: Start difference. First operand has 415 states, 415 states have (on average 1.7325301204819277) internal successors, (719), 414 states have internal predecessors, (719), 0 states have call successors, (0), 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 415 states and 719 transitions. [2022-02-21 04:32:08,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:32:08,467 INFO L93 Difference]: Finished difference Result 415 states and 719 transitions. [2022-02-21 04:32:08,467 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 719 transitions. [2022-02-21 04:32:08,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:32:08,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:32:08,468 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:32:08,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:32:08,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 415 states have (on average 1.7325301204819277) internal successors, (719), 414 states have internal predecessors, (719), 0 states have call successors, (0), 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:32:08,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 719 transitions. [2022-02-21 04:32:08,477 INFO L704 BuchiCegarLoop]: Abstraction has 415 states and 719 transitions. [2022-02-21 04:32:08,477 INFO L587 BuchiCegarLoop]: Abstraction has 415 states and 719 transitions. [2022-02-21 04:32:08,477 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:32:08,477 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 415 states and 719 transitions. [2022-02-21 04:32:08,479 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 219 [2022-02-21 04:32:08,479 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:32:08,479 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:32:08,482 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:32:08,482 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] [2022-02-21 04:32:08,482 INFO L791 eck$LassoCheckResult]: Stem: 2371#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(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~newmax4~0 := 0; 2348#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~nondet55#1, main_#t~nondet56#1, main_#t~nondet57#1, main_#t~nondet58#1, main_#t~nondet59#1, main_#t~ret60#1, main_#t~ret61#1, main_#t~post62#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~ep13~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~ep14~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~ep21~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~ep23~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~ep24~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~ep31~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~ep32~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~ep34~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~ep41~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep42~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep43~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id1~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~r1~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st1~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~nl1~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~m1~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~max1~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode1~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~newmax1~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~r2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~nl2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~m2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~max2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~mode2~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~newmax2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~id3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~r3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~st3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~nl3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~m3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~max3~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~mode3~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~newmax3~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~id4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~r4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~st4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~nl4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;~m4~0 := main_#t~nondet56#1;havoc main_#t~nondet56#1;~max4~0 := main_#t~nondet57#1;havoc main_#t~nondet57#1;~mode4~0 := main_#t~nondet58#1;havoc main_#t~nondet58#1;~newmax4~0 := main_#t~nondet59#1;havoc main_#t~nondet59#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0; 2120#L441 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 2121#L452 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 2238#L462 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 2205#L473 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 2290#L483 assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; 2332#L494 init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 2361#L504 assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; 2144#L515 init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 2048#L525 assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; 2049#L536 init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 2160#L546 assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; 2161#L557 init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 2185#L567 assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; 2186#L578 init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); 2249#L588 assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; 2102#L599 init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); 2235#L609 assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; 2165#L620 init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); 2203#L630 assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; 2137#L641 init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); 2349#L651 assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; 2104#L662 init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); 2280#L672 assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; 2281#L683 init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); 2362#L693 assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; 2094#L704 init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); 2320#L714 assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; 2075#L725 init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); 2076#L735 assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; 2052#L746 init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); 2229#L756 assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; 2068#L767 init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); 2125#L777 assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; 2126#L788 init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); 2302#L798 assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; 2269#L809 init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); 2353#L819 assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; 2315#L830 init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); 2273#L840 assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; 2228#L851 init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); 2342#L861 assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; 2174#L872 init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); 2347#L882 assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; 2150#L893 init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); 2236#L903 assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; 2232#L914 init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); 2233#L924 assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; 2218#L935 init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); 2219#L945 assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; 2061#L945-1 init_#res#1 := init_~tmp___23~0#1; 2073#L1130 main_#t~ret60#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret60#1;havoc main_#t~ret60#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 2074#L21 assume !(0 == assume_abort_if_not_~cond#1); 2260#L20 assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 2333#L1271-2 [2022-02-21 04:32:08,482 INFO L793 eck$LassoCheckResult]: Loop: 2333#L1271-2 assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 2436#L114 assume !(0 != ~mode1~0 % 256); 2435#L150 assume !(~r1~0 < 2); 2190#L150-1 ~mode1~0 := 1; 2429#L114-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 2426#L178 assume !(0 != ~mode2~0 % 256); 2422#L214 assume !(~r2~0 < 3); 2417#L214-1 ~mode2~0 := 1; 2415#L178-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 2412#L242 assume !(0 != ~mode3~0 % 256); 2401#L278 assume !(~r3~0 < 3); 2398#L278-1 ~mode3~0 := 1; 2394#L242-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1, node4_~newmax~3#1;havoc node4_~newmax~3#1;node4_~newmax~3#1 := 0; 2391#L306 assume !(0 != ~mode4~0 % 256); 2387#L342 assume !(~r4~0 < 3); 2382#L342-1 ~mode4~0 := 1; 2380#L306-2 assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 2379#L1138 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 2378#L1139 assume ~st1~0 + ~nl1~0 <= 1; 2377#L1140 assume ~st2~0 + ~nl2~0 <= 1; 2376#L1141 assume ~st3~0 + ~nl3~0 <= 1; 2375#L1142 assume ~st4~0 + ~nl4~0 <= 1; 2374#L1143 assume !(~r1~0 >= 3); 2299#L1146 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; 2300#L1147 assume ~r1~0 < 3; 2373#L1152 assume !(~r1~0 >= 3); 2368#L1156 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0; 2369#L1157 assume ~r1~0 < 3;check_~tmp~1#1 := 1; 2444#L1138-1 check_#res#1 := check_~tmp~1#1; 2443#L1190 main_#t~ret61#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret61#1;havoc main_#t~ret61#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 2442#L1314 assume !(0 == assert_~arg#1 % 256); 2441#L1309 assume { :end_inline_assert } true;main_#t~post62#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post62#1;havoc main_#t~post62#1; 2333#L1271-2 [2022-02-21 04:32:08,483 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:32:08,483 INFO L85 PathProgramCache]: Analyzing trace with hash 2064134942, now seen corresponding path program 3 times [2022-02-21 04:32:08,484 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:32:08,485 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253050968] [2022-02-21 04:32:08,485 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:32:08,485 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:32:08,526 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:32:08,572 INFO L290 TraceCheckUtils]: 0: Hoare triple {3296#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(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~newmax4~0 := 0; {3296#true} is VALID [2022-02-21 04:32:08,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {3296#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~nondet55#1, main_#t~nondet56#1, main_#t~nondet57#1, main_#t~nondet58#1, main_#t~nondet59#1, main_#t~ret60#1, main_#t~ret61#1, main_#t~post62#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~ep13~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~ep14~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~ep21~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~ep23~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~ep24~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~ep31~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~ep32~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~ep34~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~ep41~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep42~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep43~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id1~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~r1~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st1~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~nl1~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~m1~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~max1~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode1~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~newmax1~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~r2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~nl2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~m2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~max2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~mode2~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~newmax2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~id3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~r3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~st3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~nl3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~m3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~max3~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~mode3~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~newmax3~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~id4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~r4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~st4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~nl4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;~m4~0 := main_#t~nondet56#1;havoc main_#t~nondet56#1;~max4~0 := main_#t~nondet57#1;havoc main_#t~nondet57#1;~mode4~0 := main_#t~nondet58#1;havoc main_#t~nondet58#1;~newmax4~0 := main_#t~nondet59#1;havoc main_#t~nondet59#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0; {3296#true} is VALID [2022-02-21 04:32:08,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {3296#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {3296#true} is VALID [2022-02-21 04:32:08,573 INFO L290 TraceCheckUtils]: 3: Hoare triple {3296#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {3296#true} is VALID [2022-02-21 04:32:08,574 INFO L290 TraceCheckUtils]: 4: Hoare triple {3296#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {3296#true} is VALID [2022-02-21 04:32:08,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {3296#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {3296#true} is VALID [2022-02-21 04:32:08,574 INFO L290 TraceCheckUtils]: 6: Hoare triple {3296#true} assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; {3296#true} is VALID [2022-02-21 04:32:08,574 INFO L290 TraceCheckUtils]: 7: Hoare triple {3296#true} init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {3296#true} is VALID [2022-02-21 04:32:08,575 INFO L290 TraceCheckUtils]: 8: Hoare triple {3296#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; {3296#true} is VALID [2022-02-21 04:32:08,575 INFO L290 TraceCheckUtils]: 9: Hoare triple {3296#true} init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {3296#true} is VALID [2022-02-21 04:32:08,575 INFO L290 TraceCheckUtils]: 10: Hoare triple {3296#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; {3296#true} is VALID [2022-02-21 04:32:08,575 INFO L290 TraceCheckUtils]: 11: Hoare triple {3296#true} init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {3296#true} is VALID [2022-02-21 04:32:08,575 INFO L290 TraceCheckUtils]: 12: Hoare triple {3296#true} assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; {3296#true} is VALID [2022-02-21 04:32:08,575 INFO L290 TraceCheckUtils]: 13: Hoare triple {3296#true} init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {3296#true} is VALID [2022-02-21 04:32:08,575 INFO L290 TraceCheckUtils]: 14: Hoare triple {3296#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; {3296#true} is VALID [2022-02-21 04:32:08,575 INFO L290 TraceCheckUtils]: 15: Hoare triple {3296#true} init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); {3296#true} is VALID [2022-02-21 04:32:08,576 INFO L290 TraceCheckUtils]: 16: Hoare triple {3296#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; {3296#true} is VALID [2022-02-21 04:32:08,577 INFO L290 TraceCheckUtils]: 17: Hoare triple {3296#true} init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); {3296#true} is VALID [2022-02-21 04:32:08,577 INFO L290 TraceCheckUtils]: 18: Hoare triple {3296#true} assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; {3296#true} is VALID [2022-02-21 04:32:08,578 INFO L290 TraceCheckUtils]: 19: Hoare triple {3296#true} init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); {3296#true} is VALID [2022-02-21 04:32:08,578 INFO L290 TraceCheckUtils]: 20: Hoare triple {3296#true} assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; {3296#true} is VALID [2022-02-21 04:32:08,578 INFO L290 TraceCheckUtils]: 21: Hoare triple {3296#true} init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); {3296#true} is VALID [2022-02-21 04:32:08,579 INFO L290 TraceCheckUtils]: 22: Hoare triple {3296#true} assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; {3296#true} is VALID [2022-02-21 04:32:08,580 INFO L290 TraceCheckUtils]: 23: Hoare triple {3296#true} init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); {3296#true} is VALID [2022-02-21 04:32:08,580 INFO L290 TraceCheckUtils]: 24: Hoare triple {3296#true} assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; {3296#true} is VALID [2022-02-21 04:32:08,580 INFO L290 TraceCheckUtils]: 25: Hoare triple {3296#true} init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); {3296#true} is VALID [2022-02-21 04:32:08,580 INFO L290 TraceCheckUtils]: 26: Hoare triple {3296#true} assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; {3296#true} is VALID [2022-02-21 04:32:08,580 INFO L290 TraceCheckUtils]: 27: Hoare triple {3296#true} init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); {3296#true} is VALID [2022-02-21 04:32:08,580 INFO L290 TraceCheckUtils]: 28: Hoare triple {3296#true} assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; {3296#true} is VALID [2022-02-21 04:32:08,580 INFO L290 TraceCheckUtils]: 29: Hoare triple {3296#true} init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); {3296#true} is VALID [2022-02-21 04:32:08,580 INFO L290 TraceCheckUtils]: 30: Hoare triple {3296#true} assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; {3296#true} is VALID [2022-02-21 04:32:08,581 INFO L290 TraceCheckUtils]: 31: Hoare triple {3296#true} init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); {3296#true} is VALID [2022-02-21 04:32:08,581 INFO L290 TraceCheckUtils]: 32: Hoare triple {3296#true} assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; {3296#true} is VALID [2022-02-21 04:32:08,582 INFO L290 TraceCheckUtils]: 33: Hoare triple {3296#true} init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); {3296#true} is VALID [2022-02-21 04:32:08,582 INFO L290 TraceCheckUtils]: 34: Hoare triple {3296#true} assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; {3296#true} is VALID [2022-02-21 04:32:08,582 INFO L290 TraceCheckUtils]: 35: Hoare triple {3296#true} init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); {3296#true} is VALID [2022-02-21 04:32:08,582 INFO L290 TraceCheckUtils]: 36: Hoare triple {3296#true} assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; {3296#true} is VALID [2022-02-21 04:32:08,582 INFO L290 TraceCheckUtils]: 37: Hoare triple {3296#true} init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); {3296#true} is VALID [2022-02-21 04:32:08,582 INFO L290 TraceCheckUtils]: 38: Hoare triple {3296#true} assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; {3296#true} is VALID [2022-02-21 04:32:08,582 INFO L290 TraceCheckUtils]: 39: Hoare triple {3296#true} init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); {3296#true} is VALID [2022-02-21 04:32:08,582 INFO L290 TraceCheckUtils]: 40: Hoare triple {3296#true} assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; {3296#true} is VALID [2022-02-21 04:32:08,583 INFO L290 TraceCheckUtils]: 41: Hoare triple {3296#true} init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); {3296#true} is VALID [2022-02-21 04:32:08,585 INFO L290 TraceCheckUtils]: 42: Hoare triple {3296#true} assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; {3296#true} is VALID [2022-02-21 04:32:08,585 INFO L290 TraceCheckUtils]: 43: Hoare triple {3296#true} init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); {3296#true} is VALID [2022-02-21 04:32:08,585 INFO L290 TraceCheckUtils]: 44: Hoare triple {3296#true} assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; {3296#true} is VALID [2022-02-21 04:32:08,585 INFO L290 TraceCheckUtils]: 45: Hoare triple {3296#true} init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); {3296#true} is VALID [2022-02-21 04:32:08,586 INFO L290 TraceCheckUtils]: 46: Hoare triple {3296#true} assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; {3296#true} is VALID [2022-02-21 04:32:08,586 INFO L290 TraceCheckUtils]: 47: Hoare triple {3296#true} init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); {3296#true} is VALID [2022-02-21 04:32:08,586 INFO L290 TraceCheckUtils]: 48: Hoare triple {3296#true} assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; {3296#true} is VALID [2022-02-21 04:32:08,586 INFO L290 TraceCheckUtils]: 49: Hoare triple {3296#true} init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); {3296#true} is VALID [2022-02-21 04:32:08,586 INFO L290 TraceCheckUtils]: 50: Hoare triple {3296#true} assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; {3298#(= |ULTIMATE.start_init_~tmp___23~0#1| 0)} is VALID [2022-02-21 04:32:08,587 INFO L290 TraceCheckUtils]: 51: Hoare triple {3298#(= |ULTIMATE.start_init_~tmp___23~0#1| 0)} init_#res#1 := init_~tmp___23~0#1; {3299#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:32:08,587 INFO L290 TraceCheckUtils]: 52: Hoare triple {3299#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret60#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret60#1;havoc main_#t~ret60#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3300#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:32:08,587 INFO L290 TraceCheckUtils]: 53: Hoare triple {3300#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {3297#false} is VALID [2022-02-21 04:32:08,588 INFO L290 TraceCheckUtils]: 54: Hoare triple {3297#false} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {3297#false} is VALID [2022-02-21 04:32:08,588 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:32:08,589 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:32:08,589 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253050968] [2022-02-21 04:32:08,589 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253050968] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:32:08,589 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:32:08,589 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:32:08,589 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1177730691] [2022-02-21 04:32:08,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:32:08,590 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:32:08,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:32:08,590 INFO L85 PathProgramCache]: Analyzing trace with hash 1498997028, now seen corresponding path program 1 times [2022-02-21 04:32:08,590 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:32:08,590 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [342555599] [2022-02-21 04:32:08,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:32:08,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:32:08,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:32:08,615 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:32:08,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:32:08,648 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:32:09,525 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:32:09,538 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:32:09,538 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:32:09,538 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:32:09,538 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:32:09,538 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:32:09,538 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:32:09,538 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:32:09,539 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2022-02-21 04:32:09,539 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:32:09,539 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:32:09,553 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:32:09,559 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:32:09,561 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:32:09,563 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:32:09,564 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:32:09,566 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:32:09,568 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:32:09,571 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:32:09,574 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:32:09,580 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:32:09,582 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:32:09,584 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:32:09,589 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:32:09,591 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:32:09,592 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:32:09,594 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:32:09,596 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:32:09,600 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:32:09,626 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:32:09,628 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:32:09,629 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:32:09,631 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:32:09,636 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:32:09,676 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:32:09,678 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:32:09,679 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:32:09,684 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:32:09,687 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:32:09,689 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:32:09,692 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:32:09,694 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:32:10,366 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:32:10,367 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:32:10,368 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:32:10,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:32:10,370 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:32:10,373 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:32:10,374 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:32:10,374 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:32:10,420 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:32:10,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:32:10,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:32:10,422 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:32:10,425 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:32:10,425 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:32:10,426 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:32:10,562 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:32:10,568 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:32:10,568 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:32:10,568 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:32:10,568 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:32:10,568 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:32:10,568 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:32:10,568 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:32:10,568 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:32:10,568 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:32:10,568 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.4.4.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2022-02-21 04:32:10,568 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:32:10,568 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:32:10,572 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:32:10,580 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:32:10,585 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:32:10,586 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:32:10,588 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:32:10,589 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:32:10,591 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:32:10,593 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:32:10,597 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:32:10,599 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:32:10,601 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:32:10,602 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:32:10,639 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:32:10,642 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:32:10,644 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:32:10,646 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:32:10,648 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:32:10,649 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:32:10,651 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:32:10,654 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:32:10,662 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:32:10,665 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:32:10,667 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:32:10,668 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:32:10,670 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:32:10,674 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:32:10,676 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:32:10,679 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:32:10,682 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:32:10,690 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:32:10,691 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:32:11,346 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:32:11,349 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:32:11,350 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:32:11,350 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:32:11,351 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:32:11,360 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:32:11,367 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:32:11,367 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:32:11,367 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:32:11,367 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:32:11,367 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:32:11,369 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:32:11,369 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:32:11,371 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:32:11,385 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:32:11,403 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:32:11,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:32:11,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:32:11,405 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:32:11,406 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:32:11,408 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:32:11,415 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:32:11,415 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:32:11,415 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:32:11,415 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:32:11,415 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:32:11,417 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:32:11,417 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:32:11,431 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:32:11,450 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:32:11,451 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:32:11,451 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:32:11,460 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:32:11,475 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:32:11,482 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:32:11,482 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:32:11,482 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:32:11,482 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:32:11,482 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:32:11,484 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:32:11,484 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:32:11,487 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:32:11,494 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:32:11,509 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:32:11,510 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:32:11,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:32:11,510 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:32:11,511 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:32:11,512 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:32:11,518 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:32:11,518 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:32:11,518 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:32:11,518 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:32:11,518 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:32:11,519 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:32:11,519 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:32:11,520 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:32:11,537 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:32:11,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:32:11,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:32:11,538 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:32:11,539 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:32:11,543 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:32:11,550 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:32:11,550 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:32:11,550 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:32:11,550 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:32:11,550 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:32:11,551 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:32:11,551 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:32:11,559 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:32:11,575 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:32:11,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:32:11,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:32:11,576 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:32:11,577 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:32:11,583 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:32:11,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:32:11,589 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:32:11,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:32:11,590 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:32:11,590 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:32:11,590 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:32:11,590 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:32:11,591 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:32:11,609 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:32:11,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:32:11,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:32:11,610 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:32:11,611 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:32:11,613 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:32:11,620 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:32:11,621 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:32:11,621 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:32:11,621 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:32:11,621 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:32:11,621 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:32:11,621 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:32:11,622 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:32:11,666 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:32:11,666 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:32:11,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:32:11,667 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:32:11,668 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:32:11,670 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:32:11,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:32:11,677 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:32:11,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:32:11,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:32:11,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:32:11,678 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:32:11,678 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:32:11,680 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:32:11,695 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2022-02-21 04:32:11,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:32:11,696 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:32:11,697 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:32:11,697 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:32:11,699 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:32:11,705 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:32:11,705 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:32:11,705 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:32:11,706 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:32:11,706 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:32:11,706 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:32:11,706 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:32:11,707 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:32:11,722 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:32:11,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:32:11,722 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:32:11,723 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:32:11,724 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:32:11,725 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:32:11,731 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:32:11,732 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:32:11,732 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:32:11,732 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:32:11,732 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:32:11,732 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:32:11,732 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:32:11,736 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:32:11,752 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:32:11,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:32:11,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:32:11,753 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:32:11,753 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:32:11,755 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:32:11,762 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:32:11,762 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:32:11,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:32:11,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:32:11,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:32:11,762 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:32:11,762 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:32:11,772 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:32:11,790 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:32:11,790 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:32:11,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:32:11,791 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:32:11,792 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 04:32:11,793 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:32:11,800 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:32:11,801 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:32:11,801 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:32:11,801 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:32:11,801 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:32:11,809 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:32:11,809 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:32:11,813 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:32:11,830 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-02-21 04:32:11,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:32:11,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:32:11,832 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:32:11,832 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 04:32:11,833 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:32:11,840 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:32:11,840 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:32:11,840 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:32:11,840 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:32:11,840 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:32:11,841 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:32:11,841 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:32:11,843 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:32:11,858 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Ended with exit code 0 [2022-02-21 04:32:11,859 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:32:11,859 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:32:11,860 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:32:11,860 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 04:32:11,862 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:32:11,868 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:32:11,868 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:32:11,868 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:32:11,868 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:32:11,868 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:32:11,869 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:32:11,869 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:32:11,870 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:32:11,885 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 04:32:11,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:32:11,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:32:11,887 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:32:11,887 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 04:32:11,889 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:32:11,896 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:32:11,896 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:32:11,896 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:32:11,896 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:32:11,896 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:32:11,896 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:32:11,896 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:32:11,897 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:32:11,912 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 04:32:11,913 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:32:11,913 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:32:11,914 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:32:11,914 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 04:32:11,916 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:32:11,923 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:32:11,923 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:32:11,923 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:32:11,923 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:32:11,924 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:32:11,924 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:32:11,924 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:32:11,925 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:32:11,940 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 04:32:11,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:32:11,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:32:11,941 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:32:11,944 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 04:32:11,945 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:32:11,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:32:11,952 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:32:11,952 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:32:11,952 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:32:11,952 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:32:11,952 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:32:11,952 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:32:11,953 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:32:11,968 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Ended with exit code 0 [2022-02-21 04:32:11,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:32:11,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:32:11,970 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:32:11,979 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 04:32:11,981 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:32:11,988 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:32:11,989 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:32:11,989 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:32:11,989 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:32:11,989 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:32:11,989 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:32:11,989 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:32:12,007 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:32:12,027 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 04:32:12,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:32:12,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:32:12,028 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:32:12,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 04:32:12,030 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:32:12,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:32:12,037 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:32:12,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:32:12,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:32:12,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:32:12,038 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:32:12,038 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:32:12,052 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:32:12,076 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:32:12,076 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:32:12,077 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:32:12,077 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:32:12,078 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:32:12,080 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 04:32:12,081 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:32:12,081 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:32:12,081 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:32:12,081 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 15 Supporting invariants [] [2022-02-21 04:32:12,108 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 04:32:12,115 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:32:12,120 INFO L390 LassoCheck]: Loop: "assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0;" "assume !(0 != ~mode1~0 % 256);" "assume !(~r1~0 < 2);" "~mode1~0 := 1;" "assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0;" "assume !(0 != ~mode2~0 % 256);" "assume !(~r2~0 < 3);" "~mode2~0 := 1;" "assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0;" "assume !(0 != ~mode3~0 % 256);" "assume !(~r3~0 < 3);" "~mode3~0 := 1;" "assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1, node4_~newmax~3#1;havoc node4_~newmax~3#1;node4_~newmax~3#1 := 0;" "assume !(0 != ~mode4~0 % 256);" "assume !(~r4~0 < 3);" "~mode4~0 := 1;" "assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1;" "assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1;" "assume ~st1~0 + ~nl1~0 <= 1;" "assume ~st2~0 + ~nl2~0 <= 1;" "assume ~st3~0 + ~nl3~0 <= 1;" "assume ~st4~0 + ~nl4~0 <= 1;" "assume !(~r1~0 >= 3);" "assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0;" "assume ~r1~0 < 3;" "assume !(~r1~0 >= 3);" "assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0;" "assume ~r1~0 < 3;check_~tmp~1#1 := 1;" "check_#res#1 := check_~tmp~1#1;" "main_#t~ret61#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret61#1;havoc main_#t~ret61#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "assume { :end_inline_assert } true;main_#t~post62#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post62#1;havoc main_#t~post62#1;" [2022-02-21 04:32:12,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:32:12,178 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:32:12,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:32:12,234 INFO L263 TraceCheckSpWp]: Trace formula consists of 396 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:32:12,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:32:12,253 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:32:12,349 INFO L290 TraceCheckUtils]: 0: Hoare triple {3303#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(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~newmax4~0 := 0; {3303#unseeded} is VALID [2022-02-21 04:32:12,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {3303#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~nondet55#1, main_#t~nondet56#1, main_#t~nondet57#1, main_#t~nondet58#1, main_#t~nondet59#1, main_#t~ret60#1, main_#t~ret61#1, main_#t~post62#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~ep13~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~ep14~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~ep21~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~ep23~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~ep24~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~ep31~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~ep32~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~ep34~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~ep41~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep42~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep43~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id1~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~r1~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st1~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~nl1~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~m1~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~max1~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode1~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~newmax1~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~id2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~r2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~st2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~nl2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~m2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~max2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~mode2~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~newmax2~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~id3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~r3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~st3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~nl3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~m3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~max3~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~mode3~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~newmax3~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~id4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~r4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~st4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~nl4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;~m4~0 := main_#t~nondet56#1;havoc main_#t~nondet56#1;~max4~0 := main_#t~nondet57#1;havoc main_#t~nondet57#1;~mode4~0 := main_#t~nondet58#1;havoc main_#t~nondet58#1;~newmax4~0 := main_#t~nondet59#1;havoc main_#t~nondet59#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0; {3303#unseeded} is VALID [2022-02-21 04:32:12,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {3303#unseeded} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {3303#unseeded} is VALID [2022-02-21 04:32:12,350 INFO L290 TraceCheckUtils]: 3: Hoare triple {3303#unseeded} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {3303#unseeded} is VALID [2022-02-21 04:32:12,350 INFO L290 TraceCheckUtils]: 4: Hoare triple {3303#unseeded} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {3303#unseeded} is VALID [2022-02-21 04:32:12,350 INFO L290 TraceCheckUtils]: 5: Hoare triple {3303#unseeded} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {3303#unseeded} is VALID [2022-02-21 04:32:12,351 INFO L290 TraceCheckUtils]: 6: Hoare triple {3303#unseeded} assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; {3303#unseeded} is VALID [2022-02-21 04:32:12,351 INFO L290 TraceCheckUtils]: 7: Hoare triple {3303#unseeded} init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {3303#unseeded} is VALID [2022-02-21 04:32:12,351 INFO L290 TraceCheckUtils]: 8: Hoare triple {3303#unseeded} assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; {3303#unseeded} is VALID [2022-02-21 04:32:12,352 INFO L290 TraceCheckUtils]: 9: Hoare triple {3303#unseeded} init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {3303#unseeded} is VALID [2022-02-21 04:32:12,352 INFO L290 TraceCheckUtils]: 10: Hoare triple {3303#unseeded} assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; {3303#unseeded} is VALID [2022-02-21 04:32:12,352 INFO L290 TraceCheckUtils]: 11: Hoare triple {3303#unseeded} init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {3303#unseeded} is VALID [2022-02-21 04:32:12,352 INFO L290 TraceCheckUtils]: 12: Hoare triple {3303#unseeded} assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; {3303#unseeded} is VALID [2022-02-21 04:32:12,353 INFO L290 TraceCheckUtils]: 13: Hoare triple {3303#unseeded} init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {3303#unseeded} is VALID [2022-02-21 04:32:12,353 INFO L290 TraceCheckUtils]: 14: Hoare triple {3303#unseeded} assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; {3303#unseeded} is VALID [2022-02-21 04:32:12,353 INFO L290 TraceCheckUtils]: 15: Hoare triple {3303#unseeded} init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); {3303#unseeded} is VALID [2022-02-21 04:32:12,354 INFO L290 TraceCheckUtils]: 16: Hoare triple {3303#unseeded} assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; {3303#unseeded} is VALID [2022-02-21 04:32:12,354 INFO L290 TraceCheckUtils]: 17: Hoare triple {3303#unseeded} init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); {3303#unseeded} is VALID [2022-02-21 04:32:12,354 INFO L290 TraceCheckUtils]: 18: Hoare triple {3303#unseeded} assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; {3303#unseeded} is VALID [2022-02-21 04:32:12,355 INFO L290 TraceCheckUtils]: 19: Hoare triple {3303#unseeded} init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); {3303#unseeded} is VALID [2022-02-21 04:32:12,355 INFO L290 TraceCheckUtils]: 20: Hoare triple {3303#unseeded} assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; {3303#unseeded} is VALID [2022-02-21 04:32:12,355 INFO L290 TraceCheckUtils]: 21: Hoare triple {3303#unseeded} init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); {3303#unseeded} is VALID [2022-02-21 04:32:12,355 INFO L290 TraceCheckUtils]: 22: Hoare triple {3303#unseeded} assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; {3303#unseeded} is VALID [2022-02-21 04:32:12,356 INFO L290 TraceCheckUtils]: 23: Hoare triple {3303#unseeded} init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); {3303#unseeded} is VALID [2022-02-21 04:32:12,356 INFO L290 TraceCheckUtils]: 24: Hoare triple {3303#unseeded} assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; {3303#unseeded} is VALID [2022-02-21 04:32:12,361 INFO L290 TraceCheckUtils]: 25: Hoare triple {3303#unseeded} init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); {3303#unseeded} is VALID [2022-02-21 04:32:12,361 INFO L290 TraceCheckUtils]: 26: Hoare triple {3303#unseeded} assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; {3303#unseeded} is VALID [2022-02-21 04:32:12,362 INFO L290 TraceCheckUtils]: 27: Hoare triple {3303#unseeded} init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); {3303#unseeded} is VALID [2022-02-21 04:32:12,363 INFO L290 TraceCheckUtils]: 28: Hoare triple {3303#unseeded} assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; {3303#unseeded} is VALID [2022-02-21 04:32:12,366 INFO L290 TraceCheckUtils]: 29: Hoare triple {3303#unseeded} init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); {3303#unseeded} is VALID [2022-02-21 04:32:12,367 INFO L290 TraceCheckUtils]: 30: Hoare triple {3303#unseeded} assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; {3303#unseeded} is VALID [2022-02-21 04:32:12,368 INFO L290 TraceCheckUtils]: 31: Hoare triple {3303#unseeded} init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); {3303#unseeded} is VALID [2022-02-21 04:32:12,368 INFO L290 TraceCheckUtils]: 32: Hoare triple {3303#unseeded} assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; {3303#unseeded} is VALID [2022-02-21 04:32:12,368 INFO L290 TraceCheckUtils]: 33: Hoare triple {3303#unseeded} init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); {3303#unseeded} is VALID [2022-02-21 04:32:12,369 INFO L290 TraceCheckUtils]: 34: Hoare triple {3303#unseeded} assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; {3303#unseeded} is VALID [2022-02-21 04:32:12,370 INFO L290 TraceCheckUtils]: 35: Hoare triple {3303#unseeded} init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); {3303#unseeded} is VALID [2022-02-21 04:32:12,370 INFO L290 TraceCheckUtils]: 36: Hoare triple {3303#unseeded} assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; {3303#unseeded} is VALID [2022-02-21 04:32:12,371 INFO L290 TraceCheckUtils]: 37: Hoare triple {3303#unseeded} init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); {3303#unseeded} is VALID [2022-02-21 04:32:12,373 INFO L290 TraceCheckUtils]: 38: Hoare triple {3303#unseeded} assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; {3303#unseeded} is VALID [2022-02-21 04:32:12,374 INFO L290 TraceCheckUtils]: 39: Hoare triple {3303#unseeded} init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); {3303#unseeded} is VALID [2022-02-21 04:32:12,374 INFO L290 TraceCheckUtils]: 40: Hoare triple {3303#unseeded} assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; {3303#unseeded} is VALID [2022-02-21 04:32:12,375 INFO L290 TraceCheckUtils]: 41: Hoare triple {3303#unseeded} init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); {3303#unseeded} is VALID [2022-02-21 04:32:12,375 INFO L290 TraceCheckUtils]: 42: Hoare triple {3303#unseeded} assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; {3303#unseeded} is VALID [2022-02-21 04:32:12,376 INFO L290 TraceCheckUtils]: 43: Hoare triple {3303#unseeded} init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); {3303#unseeded} is VALID [2022-02-21 04:32:12,376 INFO L290 TraceCheckUtils]: 44: Hoare triple {3303#unseeded} assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; {3303#unseeded} is VALID [2022-02-21 04:32:12,377 INFO L290 TraceCheckUtils]: 45: Hoare triple {3303#unseeded} init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); {3303#unseeded} is VALID [2022-02-21 04:32:12,377 INFO L290 TraceCheckUtils]: 46: Hoare triple {3303#unseeded} assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; {3303#unseeded} is VALID [2022-02-21 04:32:12,377 INFO L290 TraceCheckUtils]: 47: Hoare triple {3303#unseeded} init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); {3303#unseeded} is VALID [2022-02-21 04:32:12,377 INFO L290 TraceCheckUtils]: 48: Hoare triple {3303#unseeded} assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; {3303#unseeded} is VALID [2022-02-21 04:32:12,378 INFO L290 TraceCheckUtils]: 49: Hoare triple {3303#unseeded} init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); {3303#unseeded} is VALID [2022-02-21 04:32:12,378 INFO L290 TraceCheckUtils]: 50: Hoare triple {3303#unseeded} assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; {3303#unseeded} is VALID [2022-02-21 04:32:12,378 INFO L290 TraceCheckUtils]: 51: Hoare triple {3303#unseeded} init_#res#1 := init_~tmp___23~0#1; {3303#unseeded} is VALID [2022-02-21 04:32:12,378 INFO L290 TraceCheckUtils]: 52: Hoare triple {3303#unseeded} main_#t~ret60#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret60#1;havoc main_#t~ret60#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3303#unseeded} is VALID [2022-02-21 04:32:12,379 INFO L290 TraceCheckUtils]: 53: Hoare triple {3303#unseeded} assume !(0 == assume_abort_if_not_~cond#1); {3303#unseeded} is VALID [2022-02-21 04:32:12,379 INFO L290 TraceCheckUtils]: 54: Hoare triple {3303#unseeded} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {3303#unseeded} is VALID [2022-02-21 04:32:12,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:32:12,404 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:32:12,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:32:12,427 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:32:12,658 INFO L290 TraceCheckUtils]: 0: Hoare triple {3306#(>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|)))} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:32:12,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 != ~mode1~0 % 256); {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:32:12,658 INFO L290 TraceCheckUtils]: 2: Hoare triple {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(~r1~0 < 2); {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:32:12,659 INFO L290 TraceCheckUtils]: 3: Hoare triple {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} ~mode1~0 := 1; {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:32:12,659 INFO L290 TraceCheckUtils]: 4: Hoare triple {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:32:12,660 INFO L290 TraceCheckUtils]: 5: Hoare triple {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 != ~mode2~0 % 256); {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:32:12,660 INFO L290 TraceCheckUtils]: 6: Hoare triple {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(~r2~0 < 3); {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:32:12,660 INFO L290 TraceCheckUtils]: 7: Hoare triple {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} ~mode2~0 := 1; {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:32:12,661 INFO L290 TraceCheckUtils]: 8: Hoare triple {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:32:12,661 INFO L290 TraceCheckUtils]: 9: Hoare triple {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 != ~mode3~0 % 256); {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:32:12,662 INFO L290 TraceCheckUtils]: 10: Hoare triple {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(~r3~0 < 3); {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:32:12,662 INFO L290 TraceCheckUtils]: 11: Hoare triple {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} ~mode3~0 := 1; {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:32:12,662 INFO L290 TraceCheckUtils]: 12: Hoare triple {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1, node4_~newmax~3#1;havoc node4_~newmax~3#1;node4_~newmax~3#1 := 0; {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:32:12,663 INFO L290 TraceCheckUtils]: 13: Hoare triple {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 != ~mode4~0 % 256); {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:32:12,663 INFO L290 TraceCheckUtils]: 14: Hoare triple {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(~r4~0 < 3); {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:32:12,663 INFO L290 TraceCheckUtils]: 15: Hoare triple {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} ~mode4~0 := 1; {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:32:12,664 INFO L290 TraceCheckUtils]: 16: Hoare triple {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:32:12,665 INFO L290 TraceCheckUtils]: 17: Hoare triple {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:32:12,665 INFO L290 TraceCheckUtils]: 18: Hoare triple {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~st1~0 + ~nl1~0 <= 1; {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:32:12,666 INFO L290 TraceCheckUtils]: 19: Hoare triple {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~st2~0 + ~nl2~0 <= 1; {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:32:12,666 INFO L290 TraceCheckUtils]: 20: Hoare triple {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~st3~0 + ~nl3~0 <= 1; {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:32:12,667 INFO L290 TraceCheckUtils]: 21: Hoare triple {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~st4~0 + ~nl4~0 <= 1; {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:32:12,667 INFO L290 TraceCheckUtils]: 22: Hoare triple {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(~r1~0 >= 3); {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:32:12,667 INFO L290 TraceCheckUtils]: 23: Hoare triple {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:32:12,668 INFO L290 TraceCheckUtils]: 24: Hoare triple {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~r1~0 < 3; {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:32:12,668 INFO L290 TraceCheckUtils]: 25: Hoare triple {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(~r1~0 >= 3); {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:32:12,668 INFO L290 TraceCheckUtils]: 26: Hoare triple {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0; {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:32:12,669 INFO L290 TraceCheckUtils]: 27: Hoare triple {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:32:12,669 INFO L290 TraceCheckUtils]: 28: Hoare triple {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} check_#res#1 := check_~tmp~1#1; {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:32:12,670 INFO L290 TraceCheckUtils]: 29: Hoare triple {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} main_#t~ret61#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret61#1;havoc main_#t~ret61#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:32:12,670 INFO L290 TraceCheckUtils]: 30: Hoare triple {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 == assert_~arg#1 % 256); {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:32:12,671 INFO L290 TraceCheckUtils]: 31: Hoare triple {3483#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume { :end_inline_assert } true;main_#t~post62#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post62#1;havoc main_#t~post62#1; {3316#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|)))))} is VALID [2022-02-21 04:32:12,671 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:32:12,672 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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:32:12,705 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Forceful destruction successful, exit code 0 [2022-02-21 04:32:12,716 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:32:12,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:12,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:12,721 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 04:32:12,722 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 415 states and 719 transitions. cyclomatic complexity: 305 Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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:32:13,257 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 415 states and 719 transitions. cyclomatic complexity: 305. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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 633 states and 1076 transitions. Complement of second has 4 states. [2022-02-21 04:32:13,258 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:32:13,258 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:32:13,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 415 states and 719 transitions. cyclomatic complexity: 305 [2022-02-21 04:32:13,258 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:32:13,258 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:32:13,258 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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:32:13,267 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:32:13,268 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:32:13,268 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:32:13,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 633 states and 1076 transitions. [2022-02-21 04:32:13,271 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:32:13,271 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:32:13,274 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 415 states and 719 transitions. cyclomatic complexity: 305 [2022-02-21 04:32:13,400 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 219 examples of accepted words. [2022-02-21 04:32:13,401 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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:32:13,404 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:32:13,404 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:32:13,404 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 633 states and 1076 transitions. cyclomatic complexity: 444 [2022-02-21 04:32:13,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 633 states and 1076 transitions. cyclomatic complexity: 444 [2022-02-21 04:32:13,405 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:32:13,405 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:32:13,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 55 letters. Loop has 32 letters. [2022-02-21 04:32:13,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 55 letters. Loop has 32 letters. [2022-02-21 04:32:13,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:32:13,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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:32:13,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:32:13,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 633 letters. Loop has 633 letters. [2022-02-21 04:32:13,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 633 letters. Loop has 633 letters. [2022-02-21 04:32:13,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 633 letters. Loop has 633 letters. [2022-02-21 04:32:13,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 415 letters. Loop has 415 letters. [2022-02-21 04:32:13,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 415 letters. Loop has 415 letters. [2022-02-21 04:32:13,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 415 letters. Loop has 415 letters. [2022-02-21 04:32:13,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:32:13,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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:32:13,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:32:13,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 66 letters. Loop has 36 letters. [2022-02-21 04:32:13,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 66 letters. Loop has 36 letters. [2022-02-21 04:32:13,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 67 letters. Loop has 36 letters. [2022-02-21 04:32:13,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 67 letters. Loop has 36 letters. [2022-02-21 04:32:13,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 67 letters. Loop has 37 letters. [2022-02-21 04:32:13,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 37 letters. [2022-02-21 04:32:13,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 67 letters. Loop has 37 letters. [2022-02-21 04:32:13,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 60 letters. Loop has 36 letters. [2022-02-21 04:32:13,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 60 letters. Loop has 36 letters. [2022-02-21 04:32:13,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 60 letters. Loop has 35 letters. [2022-02-21 04:32:13,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 35 letters. [2022-02-21 04:32:13,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 60 letters. Loop has 35 letters. [2022-02-21 04:32:13,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 61 letters. Loop has 38 letters. [2022-02-21 04:32:13,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 38 letters. [2022-02-21 04:32:13,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 61 letters. Loop has 38 letters. [2022-02-21 04:32:13,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 60 letters. Loop has 38 letters. [2022-02-21 04:32:13,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 38 letters. [2022-02-21 04:32:13,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 60 letters. Loop has 38 letters. [2022-02-21 04:32:13,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 61 letters. Loop has 38 letters. [2022-02-21 04:32:13,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 38 letters. [2022-02-21 04:32:13,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 61 letters. Loop has 38 letters. [2022-02-21 04:32:13,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 70 letters. Loop has 36 letters. [2022-02-21 04:32:13,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 70 letters. Loop has 36 letters. [2022-02-21 04:32:13,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 71 letters. Loop has 37 letters. [2022-02-21 04:32:13,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 37 letters. [2022-02-21 04:32:13,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 71 letters. Loop has 37 letters. [2022-02-21 04:32:13,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 71 letters. Loop has 36 letters. [2022-02-21 04:32:13,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 71 letters. Loop has 36 letters. [2022-02-21 04:32:13,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 75 letters. Loop has 37 letters. [2022-02-21 04:32:13,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 37 letters. [2022-02-21 04:32:13,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 75 letters. Loop has 37 letters. [2022-02-21 04:32:13,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 75 letters. Loop has 36 letters. [2022-02-21 04:32:13,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 75 letters. Loop has 36 letters. [2022-02-21 04:32:13,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 75 letters. Loop has 32 letters. [2022-02-21 04:32:13,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 75 letters. Loop has 32 letters. [2022-02-21 04:32:13,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 76 letters. Loop has 32 letters. [2022-02-21 04:32:13,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 76 letters. Loop has 32 letters. [2022-02-21 04:32:13,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 75 letters. Loop has 38 letters. [2022-02-21 04:32:13,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 38 letters. [2022-02-21 04:32:13,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 75 letters. Loop has 38 letters. [2022-02-21 04:32:13,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 73 letters. Loop has 35 letters. [2022-02-21 04:32:13,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 35 letters. [2022-02-21 04:32:13,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 73 letters. Loop has 35 letters. [2022-02-21 04:32:13,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 70 letters. Loop has 36 letters. [2022-02-21 04:32:13,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 70 letters. Loop has 36 letters. [2022-02-21 04:32:13,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:32:13,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:32:13,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 71 letters. Loop has 38 letters. [2022-02-21 04:32:13,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 38 letters. [2022-02-21 04:32:13,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 71 letters. Loop has 38 letters. [2022-02-21 04:32:13,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 71 letters. Loop has 38 letters. [2022-02-21 04:32:13,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 38 letters. [2022-02-21 04:32:13,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 71 letters. Loop has 38 letters. [2022-02-21 04:32:13,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 69 letters. Loop has 35 letters. [2022-02-21 04:32:13,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 35 letters. [2022-02-21 04:32:13,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 69 letters. Loop has 35 letters. [2022-02-21 04:32:13,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 77 letters. Loop has 36 letters. [2022-02-21 04:32:13,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 77 letters. Loop has 36 letters. [2022-02-21 04:32:13,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 78 letters. Loop has 36 letters. [2022-02-21 04:32:13,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 78 letters. Loop has 36 letters. [2022-02-21 04:32:13,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 68 letters. Loop has 36 letters. [2022-02-21 04:32:13,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 68 letters. Loop has 36 letters. [2022-02-21 04:32:13,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 69 letters. Loop has 37 letters. [2022-02-21 04:32:13,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 37 letters. [2022-02-21 04:32:13,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 69 letters. Loop has 37 letters. [2022-02-21 04:32:13,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 69 letters. Loop has 36 letters. [2022-02-21 04:32:13,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 69 letters. Loop has 36 letters. [2022-02-21 04:32:13,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 72 letters. Loop has 37 letters. [2022-02-21 04:32:13,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 37 letters. [2022-02-21 04:32:13,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 72 letters. Loop has 37 letters. [2022-02-21 04:32:13,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 72 letters. Loop has 36 letters. [2022-02-21 04:32:13,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 72 letters. Loop has 36 letters. [2022-02-21 04:32:13,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 78 letters. Loop has 32 letters. [2022-02-21 04:32:13,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 78 letters. Loop has 32 letters. [2022-02-21 04:32:13,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 79 letters. Loop has 32 letters. [2022-02-21 04:32:13,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 79 letters. Loop has 32 letters. [2022-02-21 04:32:13,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 69 letters. Loop has 38 letters. [2022-02-21 04:32:13,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 38 letters. [2022-02-21 04:32:13,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 69 letters. Loop has 38 letters. [2022-02-21 04:32:13,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 70 letters. Loop has 38 letters. [2022-02-21 04:32:13,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 38 letters. [2022-02-21 04:32:13,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 70 letters. Loop has 38 letters. [2022-02-21 04:32:13,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 75 letters. Loop has 36 letters. [2022-02-21 04:32:13,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 75 letters. Loop has 36 letters. [2022-02-21 04:32:13,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 76 letters. Loop has 36 letters. [2022-02-21 04:32:13,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 76 letters. Loop has 36 letters. [2022-02-21 04:32:13,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 76 letters. Loop has 37 letters. [2022-02-21 04:32:13,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 37 letters. [2022-02-21 04:32:13,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 76 letters. Loop has 37 letters. [2022-02-21 04:32:13,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 65 letters. Loop has 32 letters. [2022-02-21 04:32:13,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 65 letters. Loop has 32 letters. [2022-02-21 04:32:13,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 66 letters. Loop has 32 letters. [2022-02-21 04:32:13,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 66 letters. Loop has 32 letters. [2022-02-21 04:32:13,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 76 letters. Loop has 36 letters. [2022-02-21 04:32:13,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 76 letters. Loop has 36 letters. [2022-02-21 04:32:13,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 76 letters. Loop has 35 letters. [2022-02-21 04:32:13,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 35 letters. [2022-02-21 04:32:13,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 76 letters. Loop has 35 letters. [2022-02-21 04:32:13,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 77 letters. Loop has 38 letters. [2022-02-21 04:32:13,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 38 letters. [2022-02-21 04:32:13,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 77 letters. Loop has 38 letters. [2022-02-21 04:32:13,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 59 letters. Loop has 36 letters. [2022-02-21 04:32:13,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 59 letters. Loop has 36 letters. [2022-02-21 04:32:13,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 59 letters. Loop has 35 letters. [2022-02-21 04:32:13,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 35 letters. [2022-02-21 04:32:13,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 59 letters. Loop has 35 letters. [2022-02-21 04:32:13,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 79 letters. Loop has 37 letters. [2022-02-21 04:32:13,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 37 letters. [2022-02-21 04:32:13,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 79 letters. Loop has 37 letters. [2022-02-21 04:32:13,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 79 letters. Loop has 36 letters. [2022-02-21 04:32:13,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 79 letters. Loop has 36 letters. [2022-02-21 04:32:13,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 71 letters. Loop has 37 letters. [2022-02-21 04:32:13,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 37 letters. [2022-02-21 04:32:13,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 71 letters. Loop has 37 letters. [2022-02-21 04:32:13,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 71 letters. Loop has 36 letters. [2022-02-21 04:32:13,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 71 letters. Loop has 36 letters. [2022-02-21 04:32:13,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 80 letters. Loop has 32 letters. [2022-02-21 04:32:13,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 80 letters. Loop has 32 letters. [2022-02-21 04:32:13,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 74 letters. Loop has 32 letters. [2022-02-21 04:32:13,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 74 letters. Loop has 32 letters. [2022-02-21 04:32:13,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 75 letters. Loop has 35 letters. [2022-02-21 04:32:13,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 35 letters. [2022-02-21 04:32:13,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 75 letters. Loop has 35 letters. [2022-02-21 04:32:13,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 72 letters. Loop has 38 letters. [2022-02-21 04:32:13,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 38 letters. [2022-02-21 04:32:13,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 72 letters. Loop has 38 letters. [2022-02-21 04:32:13,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 64 letters. Loop has 32 letters. [2022-02-21 04:32:13,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 64 letters. Loop has 32 letters. [2022-02-21 04:32:13,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 77 letters. Loop has 32 letters. [2022-02-21 04:32:13,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 77 letters. Loop has 32 letters. [2022-02-21 04:32:13,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 61 letters. Loop has 36 letters. [2022-02-21 04:32:13,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 61 letters. Loop has 36 letters. [2022-02-21 04:32:13,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 62 letters. Loop has 37 letters. [2022-02-21 04:32:13,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 37 letters. [2022-02-21 04:32:13,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 62 letters. Loop has 37 letters. [2022-02-21 04:32:13,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 62 letters. Loop has 36 letters. [2022-02-21 04:32:13,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 62 letters. Loop has 36 letters. [2022-02-21 04:32:13,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 77 letters. Loop has 35 letters. [2022-02-21 04:32:13,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 35 letters. [2022-02-21 04:32:13,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 77 letters. Loop has 35 letters. [2022-02-21 04:32:13,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 77 letters. Loop has 36 letters. [2022-02-21 04:32:13,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 77 letters. Loop has 36 letters. [2022-02-21 04:32:13,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 63 letters. Loop has 38 letters. [2022-02-21 04:32:13,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 38 letters. [2022-02-21 04:32:13,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 63 letters. Loop has 38 letters. [2022-02-21 04:32:13,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:32:13,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:32:13,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 75 letters. Loop has 37 letters. [2022-02-21 04:32:13,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 37 letters. [2022-02-21 04:32:13,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 75 letters. Loop has 37 letters. [2022-02-21 04:32:13,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 88 letters. Loop has 32 letters. [2022-02-21 04:32:13,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 88 letters. Loop has 32 letters. [2022-02-21 04:32:13,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 89 letters. Loop has 32 letters. [2022-02-21 04:32:13,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 89 letters. Loop has 32 letters. [2022-02-21 04:32:13,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 57 letters. Loop has 36 letters. [2022-02-21 04:32:13,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 57 letters. Loop has 36 letters. [2022-02-21 04:32:13,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:32:13,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 35 letters. [2022-02-21 04:32:13,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:32:13,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:32:13,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 35 letters. [2022-02-21 04:32:13,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:32:13,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 72 letters. Loop has 36 letters. [2022-02-21 04:32:13,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 72 letters. Loop has 36 letters. [2022-02-21 04:32:13,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 74 letters. Loop has 36 letters. [2022-02-21 04:32:13,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 74 letters. Loop has 36 letters. [2022-02-21 04:32:13,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 71 letters. Loop has 32 letters. [2022-02-21 04:32:13,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 71 letters. Loop has 32 letters. [2022-02-21 04:32:13,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 74 letters. Loop has 36 letters. [2022-02-21 04:32:13,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 74 letters. Loop has 36 letters. [2022-02-21 04:32:13,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 70 letters. Loop has 36 letters. [2022-02-21 04:32:13,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 70 letters. Loop has 36 letters. [2022-02-21 04:32:13,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 76 letters. Loop has 38 letters. [2022-02-21 04:32:13,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 38 letters. [2022-02-21 04:32:13,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 76 letters. Loop has 38 letters. [2022-02-21 04:32:13,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 68 letters. Loop has 37 letters. [2022-02-21 04:32:13,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 37 letters. [2022-02-21 04:32:13,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 68 letters. Loop has 37 letters. [2022-02-21 04:32:13,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 68 letters. Loop has 32 letters. [2022-02-21 04:32:13,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 68 letters. Loop has 32 letters. [2022-02-21 04:32:13,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 82 letters. Loop has 32 letters. [2022-02-21 04:32:13,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 82 letters. Loop has 32 letters. [2022-02-21 04:32:13,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 58 letters. Loop has 35 letters. [2022-02-21 04:32:13,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 35 letters. [2022-02-21 04:32:13,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 58 letters. Loop has 35 letters. [2022-02-21 04:32:13,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 70 letters. Loop has 38 letters. [2022-02-21 04:32:13,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 38 letters. [2022-02-21 04:32:13,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 70 letters. Loop has 38 letters. [2022-02-21 04:32:13,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 74 letters. Loop has 38 letters. [2022-02-21 04:32:13,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 38 letters. [2022-02-21 04:32:13,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 74 letters. Loop has 38 letters. [2022-02-21 04:32:13,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 80 letters. Loop has 38 letters. [2022-02-21 04:32:13,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 38 letters. [2022-02-21 04:32:13,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 80 letters. Loop has 38 letters. [2022-02-21 04:32:13,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 78 letters. Loop has 38 letters. [2022-02-21 04:32:13,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 38 letters. [2022-02-21 04:32:13,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 78 letters. Loop has 38 letters. [2022-02-21 04:32:13,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:32:13,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:32:13,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 63 letters. Loop has 37 letters. [2022-02-21 04:32:13,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 37 letters. [2022-02-21 04:32:13,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 63 letters. Loop has 37 letters. [2022-02-21 04:32:13,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 79 letters. Loop has 38 letters. [2022-02-21 04:32:13,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 38 letters. [2022-02-21 04:32:13,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 79 letters. Loop has 38 letters. [2022-02-21 04:32:13,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 60 letters. Loop has 37 letters. [2022-02-21 04:32:13,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 37 letters. [2022-02-21 04:32:13,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 60 letters. Loop has 37 letters. [2022-02-21 04:32:13,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 60 letters. Loop has 36 letters. [2022-02-21 04:32:13,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 60 letters. Loop has 36 letters. [2022-02-21 04:32:13,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 84 letters. Loop has 32 letters. [2022-02-21 04:32:13,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 84 letters. Loop has 32 letters. [2022-02-21 04:32:13,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 85 letters. Loop has 32 letters. [2022-02-21 04:32:13,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 85 letters. Loop has 32 letters. [2022-02-21 04:32:13,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 81 letters. Loop has 32 letters. [2022-02-21 04:32:13,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 81 letters. Loop has 32 letters. [2022-02-21 04:32:13,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 82 letters. Loop has 32 letters. [2022-02-21 04:32:13,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 82 letters. Loop has 32 letters. [2022-02-21 04:32:13,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 78 letters. Loop has 38 letters. [2022-02-21 04:32:13,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 38 letters. [2022-02-21 04:32:13,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 78 letters. Loop has 38 letters. [2022-02-21 04:32:13,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 61 letters. Loop has 36 letters. [2022-02-21 04:32:13,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 61 letters. Loop has 36 letters. [2022-02-21 04:32:13,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 73 letters. Loop has 32 letters. [2022-02-21 04:32:13,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 73 letters. Loop has 32 letters. [2022-02-21 04:32:13,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 74 letters. Loop has 36 letters. [2022-02-21 04:32:13,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 74 letters. Loop has 36 letters. [2022-02-21 04:32:13,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 75 letters. Loop has 38 letters. [2022-02-21 04:32:13,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 38 letters. [2022-02-21 04:32:13,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 75 letters. Loop has 38 letters. [2022-02-21 04:32:13,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 78 letters. Loop has 32 letters. [2022-02-21 04:32:13,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 78 letters. Loop has 32 letters. [2022-02-21 04:32:13,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 79 letters. Loop has 32 letters. [2022-02-21 04:32:13,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 79 letters. Loop has 32 letters. [2022-02-21 04:32:13,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 87 letters. Loop has 32 letters. [2022-02-21 04:32:13,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 87 letters. Loop has 32 letters. [2022-02-21 04:32:13,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:32:13,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 35 letters. [2022-02-21 04:32:13,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:32:13,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 68 letters. Loop has 36 letters. [2022-02-21 04:32:13,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 68 letters. Loop has 36 letters. [2022-02-21 04:32:13,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:32:13,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 35 letters. [2022-02-21 04:32:13,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:32:13,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:32:13,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:32:13,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 78 letters. Loop has 32 letters. [2022-02-21 04:32:13,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 78 letters. Loop has 32 letters. [2022-02-21 04:32:13,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 80 letters. Loop has 32 letters. [2022-02-21 04:32:13,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 80 letters. Loop has 32 letters. [2022-02-21 04:32:13,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 81 letters. Loop has 32 letters. [2022-02-21 04:32:13,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 81 letters. Loop has 32 letters. [2022-02-21 04:32:13,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 69 letters. Loop has 36 letters. [2022-02-21 04:32:13,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 69 letters. Loop has 36 letters. [2022-02-21 04:32:13,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 90 letters. Loop has 32 letters. [2022-02-21 04:32:13,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 90 letters. Loop has 32 letters. [2022-02-21 04:32:13,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 69 letters. Loop has 32 letters. [2022-02-21 04:32:13,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 69 letters. Loop has 32 letters. [2022-02-21 04:32:13,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 62 letters. Loop has 38 letters. [2022-02-21 04:32:13,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 38 letters. [2022-02-21 04:32:13,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 62 letters. Loop has 38 letters. [2022-02-21 04:32:13,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 73 letters. Loop has 38 letters. [2022-02-21 04:32:13,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 38 letters. [2022-02-21 04:32:13,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 73 letters. Loop has 38 letters. [2022-02-21 04:32:13,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 74 letters. Loop has 38 letters. [2022-02-21 04:32:13,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 38 letters. [2022-02-21 04:32:13,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 74 letters. Loop has 38 letters. [2022-02-21 04:32:13,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 55 letters. Loop has 32 letters. [2022-02-21 04:32:13,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 55 letters. Loop has 32 letters. [2022-02-21 04:32:13,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 77 letters. Loop has 37 letters. [2022-02-21 04:32:13,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 37 letters. [2022-02-21 04:32:13,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 77 letters. Loop has 37 letters. [2022-02-21 04:32:13,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 83 letters. Loop has 32 letters. [2022-02-21 04:32:13,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 83 letters. Loop has 32 letters. [2022-02-21 04:32:13,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 86 letters. Loop has 32 letters. [2022-02-21 04:32:13,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 86 letters. Loop has 32 letters. [2022-02-21 04:32:13,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 58 letters. Loop has 36 letters. [2022-02-21 04:32:13,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 58 letters. Loop has 36 letters. [2022-02-21 04:32:13,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 58 letters. Loop has 37 letters. [2022-02-21 04:32:13,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 37 letters. [2022-02-21 04:32:13,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 58 letters. Loop has 37 letters. [2022-02-21 04:32:13,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 62 letters. Loop has 38 letters. [2022-02-21 04:32:13,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 38 letters. [2022-02-21 04:32:13,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 62 letters. Loop has 38 letters. [2022-02-21 04:32:13,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 79 letters. Loop has 38 letters. [2022-02-21 04:32:13,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 38 letters. [2022-02-21 04:32:13,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 79 letters. Loop has 38 letters. [2022-02-21 04:32:13,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 79 letters. Loop has 32 letters. [2022-02-21 04:32:13,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 79 letters. Loop has 32 letters. [2022-02-21 04:32:13,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 73 letters. Loop has 36 letters. [2022-02-21 04:32:13,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 73 letters. Loop has 36 letters. [2022-02-21 04:32:13,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 73 letters. Loop has 37 letters. [2022-02-21 04:32:13,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 37 letters. [2022-02-21 04:32:13,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 73 letters. Loop has 37 letters. [2022-02-21 04:32:13,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 78 letters. Loop has 36 letters. [2022-02-21 04:32:13,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 78 letters. Loop has 36 letters. [2022-02-21 04:32:13,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 70 letters. Loop has 38 letters. [2022-02-21 04:32:13,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 38 letters. [2022-02-21 04:32:13,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 70 letters. Loop has 38 letters. [2022-02-21 04:32:13,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 71 letters. Loop has 38 letters. [2022-02-21 04:32:13,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 38 letters. [2022-02-21 04:32:13,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 71 letters. Loop has 38 letters. [2022-02-21 04:32:13,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 59 letters. Loop has 36 letters. [2022-02-21 04:32:13,527 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,527 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 59 letters. Loop has 36 letters. [2022-02-21 04:32:13,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 59 letters. Loop has 37 letters. [2022-02-21 04:32:13,528 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,528 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 37 letters. [2022-02-21 04:32:13,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 59 letters. Loop has 37 letters. [2022-02-21 04:32:13,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 81 letters. Loop has 32 letters. [2022-02-21 04:32:13,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,529 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,529 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 81 letters. Loop has 32 letters. [2022-02-21 04:32:13,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 82 letters. Loop has 32 letters. [2022-02-21 04:32:13,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,530 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,530 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 82 letters. Loop has 32 letters. [2022-02-21 04:32:13,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 73 letters. Loop has 36 letters. [2022-02-21 04:32:13,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,531 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 73 letters. Loop has 36 letters. [2022-02-21 04:32:13,531 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 80 letters. Loop has 32 letters. [2022-02-21 04:32:13,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 80 letters. Loop has 32 letters. [2022-02-21 04:32:13,532 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,532 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 77 letters. Loop has 32 letters. [2022-02-21 04:32:13,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 77 letters. Loop has 32 letters. [2022-02-21 04:32:13,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,533 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 76 letters. Loop has 32 letters. [2022-02-21 04:32:13,533 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 76 letters. Loop has 32 letters. [2022-02-21 04:32:13,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 75 letters. Loop has 32 letters. [2022-02-21 04:32:13,534 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,534 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 75 letters. Loop has 32 letters. [2022-02-21 04:32:13,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 74 letters. Loop has 32 letters. [2022-02-21 04:32:13,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,535 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,535 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 74 letters. Loop has 32 letters. [2022-02-21 04:32:13,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 73 letters. Loop has 32 letters. [2022-02-21 04:32:13,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,536 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 73 letters. Loop has 32 letters. [2022-02-21 04:32:13,536 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:32:13,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:32:13,537 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,537 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 71 letters. Loop has 32 letters. [2022-02-21 04:32:13,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 71 letters. Loop has 32 letters. [2022-02-21 04:32:13,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,538 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 74 letters. Loop has 36 letters. [2022-02-21 04:32:13,538 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 74 letters. Loop has 36 letters. [2022-02-21 04:32:13,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:32:13,539 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,539 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:32:13,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 75 letters. Loop has 38 letters. [2022-02-21 04:32:13,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 38 letters. [2022-02-21 04:32:13,540 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 75 letters. Loop has 38 letters. [2022-02-21 04:32:13,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 73 letters. Loop has 36 letters. [2022-02-21 04:32:13,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 73 letters. Loop has 36 letters. [2022-02-21 04:32:13,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 74 letters. Loop has 38 letters. [2022-02-21 04:32:13,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 38 letters. [2022-02-21 04:32:13,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 74 letters. Loop has 38 letters. [2022-02-21 04:32:13,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:32:13,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 35 letters. [2022-02-21 04:32:13,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:32:13,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 69 letters. Loop has 32 letters. [2022-02-21 04:32:13,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 69 letters. Loop has 32 letters. [2022-02-21 04:32:13,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:32:13,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 35 letters. [2022-02-21 04:32:13,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:32:13,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 74 letters. Loop has 37 letters. [2022-02-21 04:32:13,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 37 letters. [2022-02-21 04:32:13,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 74 letters. Loop has 37 letters. [2022-02-21 04:32:13,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 73 letters. Loop has 36 letters. [2022-02-21 04:32:13,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 73 letters. Loop has 36 letters. [2022-02-21 04:32:13,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 68 letters. Loop has 32 letters. [2022-02-21 04:32:13,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 68 letters. Loop has 32 letters. [2022-02-21 04:32:13,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 69 letters. Loop has 36 letters. [2022-02-21 04:32:13,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 69 letters. Loop has 36 letters. [2022-02-21 04:32:13,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 72 letters. Loop has 36 letters. [2022-02-21 04:32:13,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 72 letters. Loop has 36 letters. [2022-02-21 04:32:13,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:32:13,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:32:13,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 72 letters. Loop has 37 letters. [2022-02-21 04:32:13,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 37 letters. [2022-02-21 04:32:13,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 72 letters. Loop has 37 letters. [2022-02-21 04:32:13,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 71 letters. Loop has 36 letters. [2022-02-21 04:32:13,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 71 letters. Loop has 36 letters. [2022-02-21 04:32:13,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 70 letters. Loop has 36 letters. [2022-02-21 04:32:13,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 70 letters. Loop has 36 letters. [2022-02-21 04:32:13,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 66 letters. Loop has 32 letters. [2022-02-21 04:32:13,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 66 letters. Loop has 32 letters. [2022-02-21 04:32:13,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 70 letters. Loop has 36 letters. [2022-02-21 04:32:13,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 70 letters. Loop has 36 letters. [2022-02-21 04:32:13,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 71 letters. Loop has 37 letters. [2022-02-21 04:32:13,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 37 letters. [2022-02-21 04:32:13,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 71 letters. Loop has 37 letters. [2022-02-21 04:32:13,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 65 letters. Loop has 32 letters. [2022-02-21 04:32:13,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 65 letters. Loop has 32 letters. [2022-02-21 04:32:13,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:32:13,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 35 letters. [2022-02-21 04:32:13,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:32:13,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 69 letters. Loop has 36 letters. [2022-02-21 04:32:13,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 69 letters. Loop has 36 letters. [2022-02-21 04:32:13,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:32:13,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 35 letters. [2022-02-21 04:32:13,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:32:13,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 70 letters. Loop has 38 letters. [2022-02-21 04:32:13,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 38 letters. [2022-02-21 04:32:13,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 70 letters. Loop has 38 letters. [2022-02-21 04:32:13,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 68 letters. Loop has 36 letters. [2022-02-21 04:32:13,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 68 letters. Loop has 36 letters. [2022-02-21 04:32:13,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 69 letters. Loop has 38 letters. [2022-02-21 04:32:13,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 38 letters. [2022-02-21 04:32:13,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 69 letters. Loop has 38 letters. [2022-02-21 04:32:13,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:32:13,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 35 letters. [2022-02-21 04:32:13,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:32:13,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 69 letters. Loop has 38 letters. [2022-02-21 04:32:13,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 38 letters. [2022-02-21 04:32:13,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 69 letters. Loop has 38 letters. [2022-02-21 04:32:13,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 67 letters. Loop has 36 letters. [2022-02-21 04:32:13,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 67 letters. Loop has 36 letters. [2022-02-21 04:32:13,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 68 letters. Loop has 38 letters. [2022-02-21 04:32:13,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 38 letters. [2022-02-21 04:32:13,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 68 letters. Loop has 38 letters. [2022-02-21 04:32:13,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 64 letters. Loop has 32 letters. [2022-02-21 04:32:13,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 64 letters. Loop has 32 letters. [2022-02-21 04:32:13,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 65 letters. Loop has 36 letters. [2022-02-21 04:32:13,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 65 letters. Loop has 36 letters. [2022-02-21 04:32:13,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 70 letters. Loop has 37 letters. [2022-02-21 04:32:13,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 37 letters. [2022-02-21 04:32:13,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 70 letters. Loop has 37 letters. [2022-02-21 04:32:13,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:32:13,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:32:13,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 66 letters. Loop has 36 letters. [2022-02-21 04:32:13,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 66 letters. Loop has 36 letters. [2022-02-21 04:32:13,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:32:13,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:32:13,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 67 letters. Loop has 38 letters. [2022-02-21 04:32:13,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 38 letters. [2022-02-21 04:32:13,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 67 letters. Loop has 38 letters. [2022-02-21 04:32:13,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 65 letters. Loop has 36 letters. [2022-02-21 04:32:13,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 65 letters. Loop has 36 letters. [2022-02-21 04:32:13,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 66 letters. Loop has 38 letters. [2022-02-21 04:32:13,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 38 letters. [2022-02-21 04:32:13,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 66 letters. Loop has 38 letters. [2022-02-21 04:32:13,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 64 letters. Loop has 35 letters. [2022-02-21 04:32:13,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 35 letters. [2022-02-21 04:32:13,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 64 letters. Loop has 35 letters. [2022-02-21 04:32:13,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 61 letters. Loop has 32 letters. [2022-02-21 04:32:13,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 61 letters. Loop has 32 letters. [2022-02-21 04:32:13,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:32:13,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 35 letters. [2022-02-21 04:32:13,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:32:13,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 66 letters. Loop has 37 letters. [2022-02-21 04:32:13,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 37 letters. [2022-02-21 04:32:13,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 66 letters. Loop has 37 letters. [2022-02-21 04:32:13,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 65 letters. Loop has 36 letters. [2022-02-21 04:32:13,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 65 letters. Loop has 36 letters. [2022-02-21 04:32:13,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:32:13,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:32:13,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 61 letters. Loop has 36 letters. [2022-02-21 04:32:13,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 61 letters. Loop has 36 letters. [2022-02-21 04:32:13,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 64 letters. Loop has 36 letters. [2022-02-21 04:32:13,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 64 letters. Loop has 36 letters. [2022-02-21 04:32:13,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:32:13,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:32:13,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 64 letters. Loop has 37 letters. [2022-02-21 04:32:13,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 37 letters. [2022-02-21 04:32:13,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 64 letters. Loop has 37 letters. [2022-02-21 04:32:13,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 63 letters. Loop has 36 letters. [2022-02-21 04:32:13,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 63 letters. Loop has 36 letters. [2022-02-21 04:32:13,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 63 letters. Loop has 37 letters. [2022-02-21 04:32:13,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 37 letters. [2022-02-21 04:32:13,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 63 letters. Loop has 37 letters. [2022-02-21 04:32:13,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 62 letters. Loop has 36 letters. [2022-02-21 04:32:13,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 62 letters. Loop has 36 letters. [2022-02-21 04:32:13,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 62 letters. Loop has 37 letters. [2022-02-21 04:32:13,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 37 letters. [2022-02-21 04:32:13,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 62 letters. Loop has 37 letters. [2022-02-21 04:32:13,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 57 letters. Loop has 32 letters. [2022-02-21 04:32:13,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 57 letters. Loop has 32 letters. [2022-02-21 04:32:13,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 56 letters. Loop has 32 letters. [2022-02-21 04:32:13,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 56 letters. Loop has 32 letters. [2022-02-21 04:32:13,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 63 letters. Loop has 35 letters. [2022-02-21 04:32:13,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 35 letters. [2022-02-21 04:32:13,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 63 letters. Loop has 35 letters. [2022-02-21 04:32:13,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 64 letters. Loop has 36 letters. [2022-02-21 04:32:13,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 64 letters. Loop has 36 letters. [2022-02-21 04:32:13,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 66 letters. Loop has 38 letters. [2022-02-21 04:32:13,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 38 letters. [2022-02-21 04:32:13,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 66 letters. Loop has 38 letters. [2022-02-21 04:32:13,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 65 letters. Loop has 38 letters. [2022-02-21 04:32:13,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 38 letters. [2022-02-21 04:32:13,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 65 letters. Loop has 38 letters. [2022-02-21 04:32:13,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 86 letters. Loop has 32 letters. [2022-02-21 04:32:13,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 86 letters. Loop has 32 letters. [2022-02-21 04:32:13,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 85 letters. Loop has 32 letters. [2022-02-21 04:32:13,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 85 letters. Loop has 32 letters. [2022-02-21 04:32:13,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 84 letters. Loop has 32 letters. [2022-02-21 04:32:13,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 84 letters. Loop has 32 letters. [2022-02-21 04:32:13,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 83 letters. Loop has 32 letters. [2022-02-21 04:32:13,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 32 letters. [2022-02-21 04:32:13,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 83 letters. Loop has 32 letters. [2022-02-21 04:32:13,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 65 letters. Loop has 38 letters. [2022-02-21 04:32:13,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 38 letters. [2022-02-21 04:32:13,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 65 letters. Loop has 38 letters. [2022-02-21 04:32:13,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 63 letters. Loop has 36 letters. [2022-02-21 04:32:13,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 63 letters. Loop has 36 letters. [2022-02-21 04:32:13,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 64 letters. Loop has 38 letters. [2022-02-21 04:32:13,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 38 letters. [2022-02-21 04:32:13,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 64 letters. Loop has 38 letters. [2022-02-21 04:32:13,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 69 letters. Loop has 36 letters. [2022-02-21 04:32:13,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 69 letters. Loop has 36 letters. [2022-02-21 04:32:13,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 70 letters. Loop has 37 letters. [2022-02-21 04:32:13,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 37 letters. [2022-02-21 04:32:13,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 70 letters. Loop has 37 letters. [2022-02-21 04:32:13,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 68 letters. Loop has 36 letters. [2022-02-21 04:32:13,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 68 letters. Loop has 36 letters. [2022-02-21 04:32:13,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 68 letters. Loop has 37 letters. [2022-02-21 04:32:13,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 37 letters. [2022-02-21 04:32:13,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 68 letters. Loop has 37 letters. [2022-02-21 04:32:13,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 67 letters. Loop has 36 letters. [2022-02-21 04:32:13,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 67 letters. Loop has 36 letters. [2022-02-21 04:32:13,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 67 letters. Loop has 37 letters. [2022-02-21 04:32:13,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 37 letters. [2022-02-21 04:32:13,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 67 letters. Loop has 37 letters. [2022-02-21 04:32:13,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 66 letters. Loop has 36 letters. [2022-02-21 04:32:13,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 66 letters. Loop has 36 letters. [2022-02-21 04:32:13,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 66 letters. Loop has 37 letters. [2022-02-21 04:32:13,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 37 letters. [2022-02-21 04:32:13,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 66 letters. Loop has 37 letters. [2022-02-21 04:32:13,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 74 letters. Loop has 38 letters. [2022-02-21 04:32:13,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 38 letters. [2022-02-21 04:32:13,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 74 letters. Loop has 38 letters. [2022-02-21 04:32:13,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 72 letters. Loop has 36 letters. [2022-02-21 04:32:13,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 72 letters. Loop has 36 letters. [2022-02-21 04:32:13,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 73 letters. Loop has 38 letters. [2022-02-21 04:32:13,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 38 letters. [2022-02-21 04:32:13,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 73 letters. Loop has 38 letters. [2022-02-21 04:32:13,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:32:13,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 35 letters. [2022-02-21 04:32:13,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:32:13,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 71 letters. Loop has 36 letters. [2022-02-21 04:32:13,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 36 letters. [2022-02-21 04:32:13,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 71 letters. Loop has 36 letters. [2022-02-21 04:32:13,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 72 letters. Loop has 38 letters. [2022-02-21 04:32:13,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 38 letters. [2022-02-21 04:32:13,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 72 letters. Loop has 38 letters. [2022-02-21 04:32:13,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 73 letters. Loop has 38 letters. [2022-02-21 04:32:13,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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 38 letters. [2022-02-21 04:32:13,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 73 letters. Loop has 38 letters. [2022-02-21 04:32:13,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 415 states and 719 transitions. cyclomatic complexity: 305 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:32:13,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states 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:32:13,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 633 states and 1076 transitions. cyclomatic complexity: 444 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:32:13,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,626 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:32:13,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 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:32:13,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 564 transitions. [2022-02-21 04:32:13,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 564 transitions. Stem has 55 letters. Loop has 32 letters. [2022-02-21 04:32:13,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 564 transitions. Stem has 87 letters. Loop has 32 letters. [2022-02-21 04:32:13,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 564 transitions. Stem has 55 letters. Loop has 64 letters. [2022-02-21 04:32:13,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:32:13,630 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 633 states and 1076 transitions. cyclomatic complexity: 444 [2022-02-21 04:32:13,644 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:32:13,644 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 633 states to 0 states and 0 transitions. [2022-02-21 04:32:13,645 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:32:13,645 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:32:13,645 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:32:13,645 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:32:13,645 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:32:13,645 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:32:13,645 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:32:13,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:32:13,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:32:13,646 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:13,646 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:32:13,646 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 04:32:13,646 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 04:32:13,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 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:32:13,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:32:13,678 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-02-21 04:32:13,678 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:32:13,679 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 04:32:13,679 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:32:13,679 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:32:13,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:32:13,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:32:13,679 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:32:13,679 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:32:13,679 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:32:13,679 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:32:13,679 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:32:13,680 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:32:13,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:32:13,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:32:13 BoogieIcfgContainer [2022-02-21 04:32:13,685 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:32:13,685 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:32:13,685 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:32:13,686 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:32:13,686 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:32:05" (3/4) ... [2022-02-21 04:32:13,688 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:32:13,688 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:32:13,689 INFO L158 Benchmark]: Toolchain (without parser) took 9368.70ms. Allocated memory was 100.7MB in the beginning and 182.5MB in the end (delta: 81.8MB). Free memory was 69.6MB in the beginning and 111.7MB in the end (delta: -42.1MB). Peak memory consumption was 38.4MB. Max. memory is 16.1GB. [2022-02-21 04:32:13,689 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 100.7MB. Free memory is still 56.9MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:32:13,689 INFO L158 Benchmark]: CACSL2BoogieTranslator took 389.43ms. Allocated memory is still 100.7MB. Free memory was 69.4MB in the beginning and 61.8MB in the end (delta: 7.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 04:32:13,690 INFO L158 Benchmark]: Boogie Procedure Inliner took 83.64ms. Allocated memory is still 100.7MB. Free memory was 61.8MB in the beginning and 55.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 04:32:13,690 INFO L158 Benchmark]: Boogie Preprocessor took 47.35ms. Allocated memory is still 100.7MB. Free memory was 55.0MB in the beginning and 50.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 04:32:13,690 INFO L158 Benchmark]: RCFGBuilder took 1030.72ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 50.4MB in the beginning and 90.2MB in the end (delta: -39.8MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. [2022-02-21 04:32:13,690 INFO L158 Benchmark]: BuchiAutomizer took 7809.72ms. Allocated memory was 121.6MB in the beginning and 182.5MB in the end (delta: 60.8MB). Free memory was 90.2MB in the beginning and 111.7MB in the end (delta: -21.6MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. [2022-02-21 04:32:13,691 INFO L158 Benchmark]: Witness Printer took 2.71ms. Allocated memory is still 182.5MB. Free memory is still 111.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:32:13,692 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.17ms. Allocated memory is still 100.7MB. Free memory is still 56.9MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 389.43ms. Allocated memory is still 100.7MB. Free memory was 69.4MB in the beginning and 61.8MB in the end (delta: 7.6MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 83.64ms. Allocated memory is still 100.7MB. Free memory was 61.8MB in the beginning and 55.5MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 47.35ms. Allocated memory is still 100.7MB. Free memory was 55.0MB in the beginning and 50.8MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1030.72ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 50.4MB in the beginning and 90.2MB in the end (delta: -39.8MB). Peak memory consumption was 28.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 7809.72ms. Allocated memory was 121.6MB in the beginning and 182.5MB in the end (delta: 60.8MB). Free memory was 90.2MB in the beginning and 111.7MB in the end (delta: -21.6MB). Peak memory consumption was 37.9MB. Max. memory is 16.1GB. * Witness Printer took 2.71ms. Allocated memory is still 182.5MB. Free memory is still 111.7MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 15 + -2 * i2 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.7s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 4.3s. Construction of modules took 0.0s. Büchi inclusion checks took 3.0s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 415 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 895 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 895 mSDsluCounter, 4300 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2457 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 1843 mSDtfsCounter, 36 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI2 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital194 mio100 ax100 hnf100 lsp38 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq229 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 35ms VariablesStem: 0 VariablesLoop: 1 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 04:32:13,716 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE