./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.5.3.ufo.BOUNDED-10.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_floodmax.5.3.ufo.BOUNDED-10.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 f1bcb2f3f5be6f9c47f1432334b844bf6563333b140bd48b23d7fc79eb421410 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:27:33,852 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:27:33,854 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:27:33,884 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:27:33,885 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:27:33,888 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:27:33,890 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:27:33,894 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:27:33,896 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:27:33,897 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:27:33,898 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:27:33,900 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:27:33,901 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:27:33,905 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:27:33,906 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:27:33,907 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:27:33,908 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:27:33,909 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:27:33,912 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:27:33,913 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:27:33,916 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:27:33,916 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:27:33,918 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:27:33,918 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:27:33,922 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:27:33,924 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:27:33,924 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:27:33,925 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:27:33,926 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:27:33,926 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:27:33,927 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:27:33,927 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:27:33,928 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:27:33,929 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:27:33,930 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:27:33,930 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:27:33,931 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:27:33,931 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:27:33,931 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:27:33,931 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:27:33,932 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:27:33,933 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:27:33,956 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:27:33,958 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:27:33,959 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:27:33,959 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:27:33,960 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:27:33,960 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:27:33,961 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:27:33,961 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:27:33,961 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:27:33,961 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:27:33,962 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:27:33,962 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:27:33,962 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:27:33,963 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:27:33,963 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:27:33,963 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:27:33,963 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:27:33,963 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:27:33,964 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:27:33,964 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:27:33,964 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:27:33,964 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:27:33,964 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:27:33,965 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:27:33,965 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:27:33,965 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:27:33,965 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:27:33,965 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:27:33,965 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:27:33,966 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:27:33,966 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:27:33,967 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:27:33,967 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 -> f1bcb2f3f5be6f9c47f1432334b844bf6563333b140bd48b23d7fc79eb421410 [2022-02-21 04:27:34,267 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:27:34,296 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:27:34,298 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:27:34,300 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:27:34,300 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:27:34,302 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.5.3.ufo.BOUNDED-10.pals.c [2022-02-21 04:27:34,355 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/031abf7a2/88c89ab2559f4e9aa3cb0dc866f338a2/FLAG204357089 [2022-02-21 04:27:34,840 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:27:34,841 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.5.3.ufo.BOUNDED-10.pals.c [2022-02-21 04:27:34,859 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/031abf7a2/88c89ab2559f4e9aa3cb0dc866f338a2/FLAG204357089 [2022-02-21 04:27:35,167 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/031abf7a2/88c89ab2559f4e9aa3cb0dc866f338a2 [2022-02-21 04:27:35,169 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:27:35,170 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:27:35,174 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:27:35,174 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:27:35,180 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:27:35,181 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:27:35" (1/1) ... [2022-02-21 04:27:35,182 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@36e84723 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:35, skipping insertion in model container [2022-02-21 04:27:35,182 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:27:35" (1/1) ... [2022-02-21 04:27:35,188 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:27:35,285 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:27:35,777 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_floodmax.5.3.ufo.BOUNDED-10.pals.c[60917,60930] [2022-02-21 04:27:35,778 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:27:35,789 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:27:35,885 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_floodmax.5.3.ufo.BOUNDED-10.pals.c[60917,60930] [2022-02-21 04:27:35,886 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:27:35,912 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:27:35,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:35 WrapperNode [2022-02-21 04:27:35,914 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:27:35,915 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:27:35,915 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:27:35,916 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:27:35,921 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:27:35" (1/1) ... [2022-02-21 04:27:35,951 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:27:35" (1/1) ... [2022-02-21 04:27:36,039 INFO L137 Inliner]: procedures = 24, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 2019 [2022-02-21 04:27:36,039 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:27:36,040 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:27:36,040 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:27:36,040 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:27:36,047 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:35" (1/1) ... [2022-02-21 04:27:36,047 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:35" (1/1) ... [2022-02-21 04:27:36,054 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:35" (1/1) ... [2022-02-21 04:27:36,055 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:35" (1/1) ... [2022-02-21 04:27:36,103 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:35" (1/1) ... [2022-02-21 04:27:36,139 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:35" (1/1) ... [2022-02-21 04:27:36,148 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:35" (1/1) ... [2022-02-21 04:27:36,173 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:27:36,174 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:27:36,175 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:27:36,175 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:27:36,188 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:35" (1/1) ... [2022-02-21 04:27:36,194 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:36,215 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:36,232 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:27:36,239 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:27:36,266 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:27:36,266 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:27:36,266 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:27:36,266 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:27:36,451 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:27:36,453 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:27:37,746 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:27:37,758 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:27:37,758 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 04:27:37,761 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:27:37 BoogieIcfgContainer [2022-02-21 04:27:37,780 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:27:37,780 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:27:37,781 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:27:37,783 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:27:37,784 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:27:37,784 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:27:35" (1/3) ... [2022-02-21 04:27:37,785 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@634be17f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:27:37, skipping insertion in model container [2022-02-21 04:27:37,785 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:27:37,785 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:35" (2/3) ... [2022-02-21 04:27:37,785 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@634be17f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:27:37, skipping insertion in model container [2022-02-21 04:27:37,785 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:27:37,785 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:27:37" (3/3) ... [2022-02-21 04:27:37,786 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.5.3.ufo.BOUNDED-10.pals.c [2022-02-21 04:27:37,817 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:27:37,818 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:27:37,818 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:27:37,818 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:27:37,818 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:27:37,818 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:27:37,818 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:27:37,818 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:27:37,860 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 705 states, 704 states have (on average 1.8494318181818181) internal successors, (1302), 704 states have internal predecessors, (1302), 0 states have call successors, (0), 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:27:38,051 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 155 [2022-02-21 04:27:38,052 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:27:38,052 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:27:38,063 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:38,064 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] [2022-02-21 04:27:38,064 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:27:38,070 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 705 states, 704 states have (on average 1.8494318181818181) internal successors, (1302), 704 states have internal predecessors, (1302), 0 states have call successors, (0), 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:27:38,120 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 155 [2022-02-21 04:27:38,121 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:27:38,121 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:27:38,126 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:38,127 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] [2022-02-21 04:27:38,141 INFO L791 eck$LassoCheckResult]: Stem: 691#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(40, 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;~p15~0 := 0;~p15_old~0 := 0;~p15_new~0 := 0;~ep15~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;~p25~0 := 0;~p25_old~0 := 0;~p25_new~0 := 0;~ep25~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;~p35~0 := 0;~p35_old~0 := 0;~p35_new~0 := 0;~ep35~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;~p45~0 := 0;~p45_old~0 := 0;~p45_new~0 := 0;~ep45~0 := 0;~p51~0 := 0;~p51_old~0 := 0;~p51_new~0 := 0;~ep51~0 := 0;~p52~0 := 0;~p52_old~0 := 0;~p52_new~0 := 0;~ep52~0 := 0;~p53~0 := 0;~p53_old~0 := 0;~p53_new~0 := 0;~ep53~0 := 0;~p54~0 := 0;~p54_old~0 := 0;~p54_new~0 := 0;~ep54~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~id5~0 := 0;~r5~0 := 0;~st5~0 := 0;~nl5~0 := 0;~m5~0 := 0;~max5~0 := 0;~mode5~0 := 0; 588#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet60#1, main_#t~nondet61#1, main_#t~nondet62#1, main_#t~nondet63#1, main_#t~nondet64#1, main_#t~nondet65#1, main_#t~nondet66#1, main_#t~nondet67#1, main_#t~nondet68#1, main_#t~nondet69#1, main_#t~nondet70#1, main_#t~nondet71#1, main_#t~nondet72#1, main_#t~nondet73#1, main_#t~nondet74#1, main_#t~nondet75#1, main_#t~nondet76#1, main_#t~nondet77#1, main_#t~nondet78#1, main_#t~ret79#1, main_#t~ret80#1, main_#t~post81#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~nondet24#1;havoc main_#t~nondet24#1;~ep13~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep14~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep15~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~ep21~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~ep23~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~ep24~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~ep25~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~ep31~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~ep32~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~ep34~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~ep35~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~ep41~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~ep42~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~ep43~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~ep45~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~ep51~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~ep52~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~ep53~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~ep54~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~id1~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~r1~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~st1~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~nl1~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~m1~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~max1~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~mode1~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~id2~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~r2~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~st2~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~nl2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~m2~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;~max2~0 := main_#t~nondet56#1;havoc main_#t~nondet56#1;~mode2~0 := main_#t~nondet57#1;havoc main_#t~nondet57#1;~id3~0 := main_#t~nondet58#1;havoc main_#t~nondet58#1;~r3~0 := main_#t~nondet59#1;havoc main_#t~nondet59#1;~st3~0 := main_#t~nondet60#1;havoc main_#t~nondet60#1;~nl3~0 := main_#t~nondet61#1;havoc main_#t~nondet61#1;~m3~0 := main_#t~nondet62#1;havoc main_#t~nondet62#1;~max3~0 := main_#t~nondet63#1;havoc main_#t~nondet63#1;~mode3~0 := main_#t~nondet64#1;havoc main_#t~nondet64#1;~id4~0 := main_#t~nondet65#1;havoc main_#t~nondet65#1;~r4~0 := main_#t~nondet66#1;havoc main_#t~nondet66#1;~st4~0 := main_#t~nondet67#1;havoc main_#t~nondet67#1;~nl4~0 := main_#t~nondet68#1;havoc main_#t~nondet68#1;~m4~0 := main_#t~nondet69#1;havoc main_#t~nondet69#1;~max4~0 := main_#t~nondet70#1;havoc main_#t~nondet70#1;~mode4~0 := main_#t~nondet71#1;havoc main_#t~nondet71#1;~id5~0 := main_#t~nondet72#1;havoc main_#t~nondet72#1;~r5~0 := main_#t~nondet73#1;havoc main_#t~nondet73#1;~st5~0 := main_#t~nondet74#1;havoc main_#t~nondet74#1;~nl5~0 := main_#t~nondet75#1;havoc main_#t~nondet75#1;~m5~0 := main_#t~nondet76#1;havoc main_#t~nondet76#1;~max5~0 := main_#t~nondet77#1;havoc main_#t~nondet77#1;~mode5~0 := main_#t~nondet78#1;havoc main_#t~nondet78#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r151~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r251~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r351~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r451~0#1, init_~r511~0#1, init_~r521~0#1, init_~r531~0#1, init_~r541~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_~r152~0#1, init_~tmp___2~0#1, init_~r212~0#1, init_~tmp___3~0#1, init_~r232~0#1, init_~tmp___4~0#1, init_~r242~0#1, init_~tmp___5~0#1, init_~r252~0#1, init_~tmp___6~0#1, init_~r312~0#1, init_~tmp___7~0#1, init_~r322~0#1, init_~tmp___8~0#1, init_~r342~0#1, init_~tmp___9~0#1, init_~r352~0#1, init_~tmp___10~0#1, init_~r412~0#1, init_~tmp___11~0#1, init_~r422~0#1, init_~tmp___12~0#1, init_~r432~0#1, init_~tmp___13~0#1, init_~r452~0#1, init_~tmp___14~0#1, init_~r512~0#1, init_~tmp___15~0#1, init_~r522~0#1, init_~tmp___16~0#1, init_~r532~0#1, init_~tmp___17~0#1, init_~r542~0#1, init_~tmp___18~0#1, init_~r123~0#1, init_~tmp___19~0#1, init_~r133~0#1, init_~tmp___20~0#1, init_~r143~0#1, init_~tmp___21~0#1, init_~r153~0#1, init_~tmp___22~0#1, init_~r213~0#1, init_~tmp___23~0#1, init_~r233~0#1, init_~tmp___24~0#1, init_~r243~0#1, init_~tmp___25~0#1, init_~r253~0#1, init_~tmp___26~0#1, init_~r313~0#1, init_~tmp___27~0#1, init_~r323~0#1, init_~tmp___28~0#1, init_~r343~0#1, init_~tmp___29~0#1, init_~r353~0#1, init_~tmp___30~0#1, init_~r413~0#1, init_~tmp___31~0#1, init_~r423~0#1, init_~tmp___32~0#1, init_~r433~0#1, init_~tmp___33~0#1, init_~r453~0#1, init_~tmp___34~0#1, init_~r513~0#1, init_~tmp___35~0#1, init_~r523~0#1, init_~tmp___36~0#1, init_~r533~0#1, init_~tmp___37~0#1, init_~r543~0#1, init_~tmp___38~0#1, init_~r124~0#1, init_~tmp___39~0#1, init_~r134~0#1, init_~tmp___40~0#1, init_~r144~0#1, init_~tmp___41~0#1, init_~r154~0#1, init_~tmp___42~0#1, init_~r214~0#1, init_~tmp___43~0#1, init_~r234~0#1, init_~tmp___44~0#1, init_~r244~0#1, init_~tmp___45~0#1, init_~r254~0#1, init_~tmp___46~0#1, init_~r314~0#1, init_~tmp___47~0#1, init_~r324~0#1, init_~tmp___48~0#1, init_~r344~0#1, init_~tmp___49~0#1, init_~r354~0#1, init_~tmp___50~0#1, init_~r414~0#1, init_~tmp___51~0#1, init_~r424~0#1, init_~tmp___52~0#1, init_~r434~0#1, init_~tmp___53~0#1, init_~r454~0#1, init_~tmp___54~0#1, init_~r514~0#1, init_~tmp___55~0#1, init_~r524~0#1, init_~tmp___56~0#1, init_~r534~0#1, init_~tmp___57~0#1, init_~r544~0#1, init_~tmp___58~0#1, init_~tmp___59~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r151~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r251~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r351~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r451~0#1;havoc init_~r511~0#1;havoc init_~r521~0#1;havoc init_~r531~0#1;havoc init_~r541~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_~r152~0#1;havoc init_~tmp___2~0#1;havoc init_~r212~0#1;havoc init_~tmp___3~0#1;havoc init_~r232~0#1;havoc init_~tmp___4~0#1;havoc init_~r242~0#1;havoc init_~tmp___5~0#1;havoc init_~r252~0#1;havoc init_~tmp___6~0#1;havoc init_~r312~0#1;havoc init_~tmp___7~0#1;havoc init_~r322~0#1;havoc init_~tmp___8~0#1;havoc init_~r342~0#1;havoc init_~tmp___9~0#1;havoc init_~r352~0#1;havoc init_~tmp___10~0#1;havoc init_~r412~0#1;havoc init_~tmp___11~0#1;havoc init_~r422~0#1;havoc init_~tmp___12~0#1;havoc init_~r432~0#1;havoc init_~tmp___13~0#1;havoc init_~r452~0#1;havoc init_~tmp___14~0#1;havoc init_~r512~0#1;havoc init_~tmp___15~0#1;havoc init_~r522~0#1;havoc init_~tmp___16~0#1;havoc init_~r532~0#1;havoc init_~tmp___17~0#1;havoc init_~r542~0#1;havoc init_~tmp___18~0#1;havoc init_~r123~0#1;havoc init_~tmp___19~0#1;havoc init_~r133~0#1;havoc init_~tmp___20~0#1;havoc init_~r143~0#1;havoc init_~tmp___21~0#1;havoc init_~r153~0#1;havoc init_~tmp___22~0#1;havoc init_~r213~0#1;havoc init_~tmp___23~0#1;havoc init_~r233~0#1;havoc init_~tmp___24~0#1;havoc init_~r243~0#1;havoc init_~tmp___25~0#1;havoc init_~r253~0#1;havoc init_~tmp___26~0#1;havoc init_~r313~0#1;havoc init_~tmp___27~0#1;havoc init_~r323~0#1;havoc init_~tmp___28~0#1;havoc init_~r343~0#1;havoc init_~tmp___29~0#1;havoc init_~r353~0#1;havoc init_~tmp___30~0#1;havoc init_~r413~0#1;havoc init_~tmp___31~0#1;havoc init_~r423~0#1;havoc init_~tmp___32~0#1;havoc init_~r433~0#1;havoc init_~tmp___33~0#1;havoc init_~r453~0#1;havoc init_~tmp___34~0#1;havoc init_~r513~0#1;havoc init_~tmp___35~0#1;havoc init_~r523~0#1;havoc init_~tmp___36~0#1;havoc init_~r533~0#1;havoc init_~tmp___37~0#1;havoc init_~r543~0#1;havoc init_~tmp___38~0#1;havoc init_~r124~0#1;havoc init_~tmp___39~0#1;havoc init_~r134~0#1;havoc init_~tmp___40~0#1;havoc init_~r144~0#1;havoc init_~tmp___41~0#1;havoc init_~r154~0#1;havoc init_~tmp___42~0#1;havoc init_~r214~0#1;havoc init_~tmp___43~0#1;havoc init_~r234~0#1;havoc init_~tmp___44~0#1;havoc init_~r244~0#1;havoc init_~tmp___45~0#1;havoc init_~r254~0#1;havoc init_~tmp___46~0#1;havoc init_~r314~0#1;havoc init_~tmp___47~0#1;havoc init_~r324~0#1;havoc init_~tmp___48~0#1;havoc init_~r344~0#1;havoc init_~tmp___49~0#1;havoc init_~r354~0#1;havoc init_~tmp___50~0#1;havoc init_~r414~0#1;havoc init_~tmp___51~0#1;havoc init_~r424~0#1;havoc init_~tmp___52~0#1;havoc init_~r434~0#1;havoc init_~tmp___53~0#1;havoc init_~r454~0#1;havoc init_~tmp___54~0#1;havoc init_~r514~0#1;havoc init_~tmp___55~0#1;havoc init_~r524~0#1;havoc init_~tmp___56~0#1;havoc init_~r534~0#1;havoc init_~tmp___57~0#1;havoc init_~r544~0#1;havoc init_~tmp___58~0#1;havoc init_~tmp___59~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r151~0#1 := ~ep15~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r251~0#1 := ~ep25~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r351~0#1 := ~ep35~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0;init_~r451~0#1 := ~ep45~0;init_~r511~0#1 := ~ep51~0;init_~r521~0#1 := ~ep52~0;init_~r531~0#1 := ~ep53~0;init_~r541~0#1 := ~ep54~0; 365#L623true assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 67#L642true init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 353#L652true assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 509#L671true init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 621#L681true assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; 439#L700true init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 96#L710true assume 0 != init_~r151~0#1 % 256;init_~tmp___2~0#1 := 1; 217#L729true init_~r152~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 360#L739true assume 0 != init_~r211~0#1 % 256;init_~tmp___3~0#1 := 1; 489#L758true init_~r212~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 15#L768true assume 0 != init_~r231~0#1 % 256;init_~tmp___4~0#1 := 1; 343#L787true init_~r232~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 293#L797true assume 0 != init_~r241~0#1 % 256;init_~tmp___5~0#1 := 1; 624#L816true init_~r242~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); 425#L826true assume 0 != init_~r251~0#1 % 256;init_~tmp___6~0#1 := 1; 512#L845true init_~r252~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); 378#L855true assume 0 != init_~r311~0#1 % 256;init_~tmp___7~0#1 := 1; 283#L874true init_~r312~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); 572#L884true assume 0 != init_~r321~0#1 % 256;init_~tmp___8~0#1 := 1; 319#L903true init_~r322~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); 158#L913true assume 0 != init_~r341~0#1 % 256;init_~tmp___9~0#1 := 1; 465#L932true init_~r342~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); 664#L942true assume 0 != init_~r351~0#1 % 256;init_~tmp___10~0#1 := 1; 214#L961true init_~r352~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); 276#L971true assume 0 != init_~r411~0#1 % 256;init_~tmp___11~0#1 := 1; 133#L990true init_~r412~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); 494#L1000true assume 0 != init_~r421~0#1 % 256;init_~tmp___12~0#1 := 1; 640#L1019true init_~r422~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); 705#L1029true assume 0 != init_~r431~0#1 % 256;init_~tmp___13~0#1 := 1; 225#L1048true init_~r432~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); 211#L1058true assume 0 != init_~r451~0#1 % 256;init_~tmp___14~0#1 := 1; 208#L1077true init_~r452~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); 178#L1087true assume 0 != init_~r511~0#1 % 256;init_~tmp___15~0#1 := 1; 637#L1106true init_~r512~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); 311#L1116true assume 0 != init_~r521~0#1 % 256;init_~tmp___16~0#1 := 1; 389#L1135true init_~r522~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); 700#L1145true assume 0 != init_~r531~0#1 % 256;init_~tmp___17~0#1 := 1; 316#L1164true init_~r532~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); 391#L1174true assume 0 != init_~r541~0#1 % 256;init_~tmp___18~0#1 := 1; 268#L1193true init_~r542~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); 562#L1203true assume 0 != init_~r122~0#1 % 256;init_~tmp___19~0#1 := 1; 218#L1222true init_~r123~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); 549#L1232true assume 0 != init_~r132~0#1 % 256;init_~tmp___20~0#1 := 1; 258#L1251true init_~r133~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); 288#L1261true assume 0 != init_~r142~0#1 % 256;init_~tmp___21~0#1 := 1; 267#L1280true init_~r143~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); 362#L1290true assume 0 != init_~r152~0#1 % 256;init_~tmp___22~0#1 := 1; 672#L1309true init_~r153~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); 339#L1319true assume 0 != init_~r212~0#1 % 256;init_~tmp___23~0#1 := 1; 249#L1338true init_~r213~0#1 := (if 0 == init_~tmp___23~0#1 then 0 else 1); 220#L1348true assume 0 != init_~r232~0#1 % 256;init_~tmp___24~0#1 := 1; 449#L1367true init_~r233~0#1 := (if 0 == init_~tmp___24~0#1 then 0 else 1); 651#L1377true assume 0 != init_~r242~0#1 % 256;init_~tmp___25~0#1 := 1; 93#L1396true init_~r243~0#1 := (if 0 == init_~tmp___25~0#1 then 0 else 1); 652#L1406true assume 0 != init_~r252~0#1 % 256;init_~tmp___26~0#1 := 1; 500#L1425true init_~r253~0#1 := (if 0 == init_~tmp___26~0#1 then 0 else 1); 475#L1435true assume 0 != init_~r312~0#1 % 256;init_~tmp___27~0#1 := 1; 274#L1454true init_~r313~0#1 := (if 0 == init_~tmp___27~0#1 then 0 else 1); 680#L1464true assume 0 != init_~r322~0#1 % 256;init_~tmp___28~0#1 := 1; 531#L1483true init_~r323~0#1 := (if 0 == init_~tmp___28~0#1 then 0 else 1); 677#L1493true assume 0 != init_~r342~0#1 % 256;init_~tmp___29~0#1 := 1; 140#L1512true init_~r343~0#1 := (if 0 == init_~tmp___29~0#1 then 0 else 1); 681#L1522true assume 0 != init_~r352~0#1 % 256;init_~tmp___30~0#1 := 1; 60#L1541true init_~r353~0#1 := (if 0 == init_~tmp___30~0#1 then 0 else 1); 294#L1551true assume 0 != init_~r412~0#1 % 256;init_~tmp___31~0#1 := 1; 90#L1570true init_~r413~0#1 := (if 0 == init_~tmp___31~0#1 then 0 else 1); 459#L1580true assume 0 != init_~r422~0#1 % 256;init_~tmp___32~0#1 := 1; 166#L1599true init_~r423~0#1 := (if 0 == init_~tmp___32~0#1 then 0 else 1); 32#L1609true assume 0 != init_~r432~0#1 % 256;init_~tmp___33~0#1 := 1; 655#L1628true init_~r433~0#1 := (if 0 == init_~tmp___33~0#1 then 0 else 1); 234#L1638true assume 0 != init_~r452~0#1 % 256;init_~tmp___34~0#1 := 1; 135#L1657true init_~r453~0#1 := (if 0 == init_~tmp___34~0#1 then 0 else 1); 300#L1667true assume 0 != init_~r512~0#1 % 256;init_~tmp___35~0#1 := 1; 227#L1686true init_~r513~0#1 := (if 0 == init_~tmp___35~0#1 then 0 else 1); 414#L1696true assume 0 != init_~r522~0#1 % 256;init_~tmp___36~0#1 := 1; 404#L1715true init_~r523~0#1 := (if 0 == init_~tmp___36~0#1 then 0 else 1); 239#L1725true assume 0 != init_~r532~0#1 % 256;init_~tmp___37~0#1 := 1; 460#L1744true init_~r533~0#1 := (if 0 == init_~tmp___37~0#1 then 0 else 1); 607#L1754true assume 0 != init_~r542~0#1 % 256;init_~tmp___38~0#1 := 1; 221#L1773true init_~r543~0#1 := (if 0 == init_~tmp___38~0#1 then 0 else 1); 240#L1783true assume 0 != init_~r123~0#1 % 256;init_~tmp___39~0#1 := 1; 584#L1802true init_~r124~0#1 := (if 0 == init_~tmp___39~0#1 then 0 else 1); 393#L1812true assume 0 != init_~r133~0#1 % 256;init_~tmp___40~0#1 := 1; 550#L1831true init_~r134~0#1 := (if 0 == init_~tmp___40~0#1 then 0 else 1); 115#L1841true assume 0 != init_~r143~0#1 % 256;init_~tmp___41~0#1 := 1; 577#L1860true init_~r144~0#1 := (if 0 == init_~tmp___41~0#1 then 0 else 1); 88#L1870true assume 0 != init_~r153~0#1 % 256;init_~tmp___42~0#1 := 1; 670#L1889true init_~r154~0#1 := (if 0 == init_~tmp___42~0#1 then 0 else 1); 215#L1899true assume 0 != init_~r213~0#1 % 256;init_~tmp___43~0#1 := 1; 629#L1918true init_~r214~0#1 := (if 0 == init_~tmp___43~0#1 then 0 else 1); 213#L1928true assume 0 != init_~r233~0#1 % 256;init_~tmp___44~0#1 := 1; 433#L1947true init_~r234~0#1 := (if 0 == init_~tmp___44~0#1 then 0 else 1); 662#L1957true assume 0 != init_~r243~0#1 % 256;init_~tmp___45~0#1 := 1; 697#L1976true init_~r244~0#1 := (if 0 == init_~tmp___45~0#1 then 0 else 1); 192#L1986true assume 0 != init_~r253~0#1 % 256;init_~tmp___46~0#1 := 1; 222#L2005true init_~r254~0#1 := (if 0 == init_~tmp___46~0#1 then 0 else 1); 614#L2015true assume 0 != init_~r313~0#1 % 256;init_~tmp___47~0#1 := 1; 472#L2034true init_~r314~0#1 := (if 0 == init_~tmp___47~0#1 then 0 else 1); 641#L2044true assume 0 != init_~r323~0#1 % 256;init_~tmp___48~0#1 := 1; 291#L2063true init_~r324~0#1 := (if 0 == init_~tmp___48~0#1 then 0 else 1); 252#L2073true assume 0 != init_~r343~0#1 % 256;init_~tmp___49~0#1 := 1; 216#L2092true init_~r344~0#1 := (if 0 == init_~tmp___49~0#1 then 0 else 1); 125#L2102true assume 0 != init_~r353~0#1 % 256;init_~tmp___50~0#1 := 1; 296#L2121true init_~r354~0#1 := (if 0 == init_~tmp___50~0#1 then 0 else 1); 175#L2131true assume 0 != init_~r413~0#1 % 256;init_~tmp___51~0#1 := 1; 570#L2150true init_~r414~0#1 := (if 0 == init_~tmp___51~0#1 then 0 else 1); 207#L2160true assume 0 != init_~r423~0#1 % 256;init_~tmp___52~0#1 := 1; 55#L2179true init_~r424~0#1 := (if 0 == init_~tmp___52~0#1 then 0 else 1); 599#L2189true assume 0 != init_~r433~0#1 % 256;init_~tmp___53~0#1 := 1; 591#L2208true init_~r434~0#1 := (if 0 == init_~tmp___53~0#1 then 0 else 1); 255#L2218true assume 0 != init_~r453~0#1 % 256;init_~tmp___54~0#1 := 1; 356#L2237true init_~r454~0#1 := (if 0 == init_~tmp___54~0#1 then 0 else 1); 514#L2247true assume 0 != init_~r513~0#1 % 256;init_~tmp___55~0#1 := 1; 426#L2266true init_~r514~0#1 := (if 0 == init_~tmp___55~0#1 then 0 else 1); 102#L2276true assume 0 != init_~r523~0#1 % 256;init_~tmp___56~0#1 := 1; 406#L2295true init_~r524~0#1 := (if 0 == init_~tmp___56~0#1 then 0 else 1); 219#L2305true assume 0 != init_~r533~0#1 % 256;init_~tmp___57~0#1 := 1; 202#L2324true init_~r534~0#1 := (if 0 == init_~tmp___57~0#1 then 0 else 1); 347#L2334true assume 0 != init_~r543~0#1 % 256;init_~tmp___58~0#1 := 1; 23#L2353true init_~r544~0#1 := (if 0 == init_~tmp___58~0#1 then 0 else 1); 505#L2363true assume !(~id1~0 != ~id2~0);init_~tmp___59~0#1 := 0; 479#L2363-1true init_#res#1 := init_~tmp___59~0#1; 532#L2604true main_#t~ret79#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret79#1;havoc main_#t~ret79#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; 490#L21true assume !(0 == assume_abort_if_not_~cond#1); 197#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;~p15_old~0 := ~nomsg~0;~p15_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;~p25_old~0 := ~nomsg~0;~p25_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;~p35_old~0 := ~nomsg~0;~p35_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;~p45_old~0 := ~nomsg~0;~p45_new~0 := ~nomsg~0;~p51_old~0 := ~nomsg~0;~p51_new~0 := ~nomsg~0;~p52_old~0 := ~nomsg~0;~p52_new~0 := ~nomsg~0;~p53_old~0 := ~nomsg~0;~p53_new~0 := ~nomsg~0;~p54_old~0 := ~nomsg~0;~p54_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 421#L2776-2true [2022-02-21 04:27:38,144 INFO L793 eck$LassoCheckResult]: Loop: 421#L2776-2true assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1, node1_#t~ite7#1; 408#L148true assume !(0 != ~mode1~0 % 256); 516#L187true assume !(~r1~0 < 4); 660#L187-1true ~mode1~0 := 1; 415#L148-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite8#1, node2_#t~ite9#1, node2_#t~ite10#1, node2_#t~ite11#1; 321#L211true assume !(0 != ~mode2~0 % 256); 303#L250true assume !(~r2~0 < 4); 485#L250-1true ~mode2~0 := 1; 116#L211-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite12#1, node3_#t~ite13#1, node3_#t~ite14#1, node3_#t~ite15#1; 123#L274true assume !(0 != ~mode3~0 % 256); 39#L313true assume !(~r3~0 < 4); 162#L313-1true ~mode3~0 := 1; 350#L274-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite16#1, node4_#t~ite17#1, node4_#t~ite18#1, node4_#t~ite19#1; 277#L337true assume !(0 != ~mode4~0 % 256); 551#L376true assume !(~r4~0 < 4); 91#L376-1true ~mode4~0 := 1; 164#L337-2true assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite20#1, node5_#t~ite21#1, node5_#t~ite22#1, node5_#t~ite23#1; 456#L400true assume !(0 != ~mode5~0 % 256); 244#L439true assume !(~r5~0 < 4); 594#L439-1true ~mode5~0 := 1; 145#L400-2true assume { :end_inline_node5 } 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;~p15_old~0 := ~p15_new~0;~p15_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;~p25_old~0 := ~p25_new~0;~p25_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;~p35_old~0 := ~p35_new~0;~p35_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;~p45_old~0 := ~p45_new~0;~p45_new~0 := ~nomsg~0;~p51_old~0 := ~p51_new~0;~p51_new~0 := ~nomsg~0;~p52_old~0 := ~p52_new~0;~p52_new~0 := ~nomsg~0;~p53_old~0 := ~p53_new~0;~p53_new~0 := ~nomsg~0;~p54_old~0 := ~p54_new~0;~p54_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 349#L2612true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; 305#L2612-1true check_#res#1 := check_~tmp~1#1; 325#L2668true main_#t~ret80#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret80#1;havoc main_#t~ret80#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; 307#L2836true assume !(0 == assert_~arg#1 % 256); 508#L2831true assume { :end_inline_assert } true;main_#t~post81#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post81#1;havoc main_#t~post81#1; 421#L2776-2true [2022-02-21 04:27:38,150 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:27:38,150 INFO L85 PathProgramCache]: Analyzing trace with hash -1593308194, now seen corresponding path program 1 times [2022-02-21 04:27:38,158 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:27:38,158 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251373972] [2022-02-21 04:27:38,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:27:38,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:27:38,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:27:38,542 INFO L290 TraceCheckUtils]: 0: Hoare triple {709#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(40, 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;~p15~0 := 0;~p15_old~0 := 0;~p15_new~0 := 0;~ep15~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;~p25~0 := 0;~p25_old~0 := 0;~p25_new~0 := 0;~ep25~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;~p35~0 := 0;~p35_old~0 := 0;~p35_new~0 := 0;~ep35~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;~p45~0 := 0;~p45_old~0 := 0;~p45_new~0 := 0;~ep45~0 := 0;~p51~0 := 0;~p51_old~0 := 0;~p51_new~0 := 0;~ep51~0 := 0;~p52~0 := 0;~p52_old~0 := 0;~p52_new~0 := 0;~ep52~0 := 0;~p53~0 := 0;~p53_old~0 := 0;~p53_new~0 := 0;~ep53~0 := 0;~p54~0 := 0;~p54_old~0 := 0;~p54_new~0 := 0;~ep54~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~id5~0 := 0;~r5~0 := 0;~st5~0 := 0;~nl5~0 := 0;~m5~0 := 0;~max5~0 := 0;~mode5~0 := 0; {709#true} is VALID [2022-02-21 04:27:38,543 INFO L290 TraceCheckUtils]: 1: Hoare triple {709#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet60#1, main_#t~nondet61#1, main_#t~nondet62#1, main_#t~nondet63#1, main_#t~nondet64#1, main_#t~nondet65#1, main_#t~nondet66#1, main_#t~nondet67#1, main_#t~nondet68#1, main_#t~nondet69#1, main_#t~nondet70#1, main_#t~nondet71#1, main_#t~nondet72#1, main_#t~nondet73#1, main_#t~nondet74#1, main_#t~nondet75#1, main_#t~nondet76#1, main_#t~nondet77#1, main_#t~nondet78#1, main_#t~ret79#1, main_#t~ret80#1, main_#t~post81#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~nondet24#1;havoc main_#t~nondet24#1;~ep13~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep14~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep15~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~ep21~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~ep23~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~ep24~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~ep25~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~ep31~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~ep32~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~ep34~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~ep35~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~ep41~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~ep42~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~ep43~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~ep45~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~ep51~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~ep52~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~ep53~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~ep54~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~id1~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~r1~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~st1~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~nl1~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~m1~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~max1~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~mode1~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~id2~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~r2~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~st2~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~nl2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~m2~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;~max2~0 := main_#t~nondet56#1;havoc main_#t~nondet56#1;~mode2~0 := main_#t~nondet57#1;havoc main_#t~nondet57#1;~id3~0 := main_#t~nondet58#1;havoc main_#t~nondet58#1;~r3~0 := main_#t~nondet59#1;havoc main_#t~nondet59#1;~st3~0 := main_#t~nondet60#1;havoc main_#t~nondet60#1;~nl3~0 := main_#t~nondet61#1;havoc main_#t~nondet61#1;~m3~0 := main_#t~nondet62#1;havoc main_#t~nondet62#1;~max3~0 := main_#t~nondet63#1;havoc main_#t~nondet63#1;~mode3~0 := main_#t~nondet64#1;havoc main_#t~nondet64#1;~id4~0 := main_#t~nondet65#1;havoc main_#t~nondet65#1;~r4~0 := main_#t~nondet66#1;havoc main_#t~nondet66#1;~st4~0 := main_#t~nondet67#1;havoc main_#t~nondet67#1;~nl4~0 := main_#t~nondet68#1;havoc main_#t~nondet68#1;~m4~0 := main_#t~nondet69#1;havoc main_#t~nondet69#1;~max4~0 := main_#t~nondet70#1;havoc main_#t~nondet70#1;~mode4~0 := main_#t~nondet71#1;havoc main_#t~nondet71#1;~id5~0 := main_#t~nondet72#1;havoc main_#t~nondet72#1;~r5~0 := main_#t~nondet73#1;havoc main_#t~nondet73#1;~st5~0 := main_#t~nondet74#1;havoc main_#t~nondet74#1;~nl5~0 := main_#t~nondet75#1;havoc main_#t~nondet75#1;~m5~0 := main_#t~nondet76#1;havoc main_#t~nondet76#1;~max5~0 := main_#t~nondet77#1;havoc main_#t~nondet77#1;~mode5~0 := main_#t~nondet78#1;havoc main_#t~nondet78#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r151~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r251~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r351~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r451~0#1, init_~r511~0#1, init_~r521~0#1, init_~r531~0#1, init_~r541~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_~r152~0#1, init_~tmp___2~0#1, init_~r212~0#1, init_~tmp___3~0#1, init_~r232~0#1, init_~tmp___4~0#1, init_~r242~0#1, init_~tmp___5~0#1, init_~r252~0#1, init_~tmp___6~0#1, init_~r312~0#1, init_~tmp___7~0#1, init_~r322~0#1, init_~tmp___8~0#1, init_~r342~0#1, init_~tmp___9~0#1, init_~r352~0#1, init_~tmp___10~0#1, init_~r412~0#1, init_~tmp___11~0#1, init_~r422~0#1, init_~tmp___12~0#1, init_~r432~0#1, init_~tmp___13~0#1, init_~r452~0#1, init_~tmp___14~0#1, init_~r512~0#1, init_~tmp___15~0#1, init_~r522~0#1, init_~tmp___16~0#1, init_~r532~0#1, init_~tmp___17~0#1, init_~r542~0#1, init_~tmp___18~0#1, init_~r123~0#1, init_~tmp___19~0#1, init_~r133~0#1, init_~tmp___20~0#1, init_~r143~0#1, init_~tmp___21~0#1, init_~r153~0#1, init_~tmp___22~0#1, init_~r213~0#1, init_~tmp___23~0#1, init_~r233~0#1, init_~tmp___24~0#1, init_~r243~0#1, init_~tmp___25~0#1, init_~r253~0#1, init_~tmp___26~0#1, init_~r313~0#1, init_~tmp___27~0#1, init_~r323~0#1, init_~tmp___28~0#1, init_~r343~0#1, init_~tmp___29~0#1, init_~r353~0#1, init_~tmp___30~0#1, init_~r413~0#1, init_~tmp___31~0#1, init_~r423~0#1, init_~tmp___32~0#1, init_~r433~0#1, init_~tmp___33~0#1, init_~r453~0#1, init_~tmp___34~0#1, init_~r513~0#1, init_~tmp___35~0#1, init_~r523~0#1, init_~tmp___36~0#1, init_~r533~0#1, init_~tmp___37~0#1, init_~r543~0#1, init_~tmp___38~0#1, init_~r124~0#1, init_~tmp___39~0#1, init_~r134~0#1, init_~tmp___40~0#1, init_~r144~0#1, init_~tmp___41~0#1, init_~r154~0#1, init_~tmp___42~0#1, init_~r214~0#1, init_~tmp___43~0#1, init_~r234~0#1, init_~tmp___44~0#1, init_~r244~0#1, init_~tmp___45~0#1, init_~r254~0#1, init_~tmp___46~0#1, init_~r314~0#1, init_~tmp___47~0#1, init_~r324~0#1, init_~tmp___48~0#1, init_~r344~0#1, init_~tmp___49~0#1, init_~r354~0#1, init_~tmp___50~0#1, init_~r414~0#1, init_~tmp___51~0#1, init_~r424~0#1, init_~tmp___52~0#1, init_~r434~0#1, init_~tmp___53~0#1, init_~r454~0#1, init_~tmp___54~0#1, init_~r514~0#1, init_~tmp___55~0#1, init_~r524~0#1, init_~tmp___56~0#1, init_~r534~0#1, init_~tmp___57~0#1, init_~r544~0#1, init_~tmp___58~0#1, init_~tmp___59~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r151~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r251~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r351~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r451~0#1;havoc init_~r511~0#1;havoc init_~r521~0#1;havoc init_~r531~0#1;havoc init_~r541~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_~r152~0#1;havoc init_~tmp___2~0#1;havoc init_~r212~0#1;havoc init_~tmp___3~0#1;havoc init_~r232~0#1;havoc init_~tmp___4~0#1;havoc init_~r242~0#1;havoc init_~tmp___5~0#1;havoc init_~r252~0#1;havoc init_~tmp___6~0#1;havoc init_~r312~0#1;havoc init_~tmp___7~0#1;havoc init_~r322~0#1;havoc init_~tmp___8~0#1;havoc init_~r342~0#1;havoc init_~tmp___9~0#1;havoc init_~r352~0#1;havoc init_~tmp___10~0#1;havoc init_~r412~0#1;havoc init_~tmp___11~0#1;havoc init_~r422~0#1;havoc init_~tmp___12~0#1;havoc init_~r432~0#1;havoc init_~tmp___13~0#1;havoc init_~r452~0#1;havoc init_~tmp___14~0#1;havoc init_~r512~0#1;havoc init_~tmp___15~0#1;havoc init_~r522~0#1;havoc init_~tmp___16~0#1;havoc init_~r532~0#1;havoc init_~tmp___17~0#1;havoc init_~r542~0#1;havoc init_~tmp___18~0#1;havoc init_~r123~0#1;havoc init_~tmp___19~0#1;havoc init_~r133~0#1;havoc init_~tmp___20~0#1;havoc init_~r143~0#1;havoc init_~tmp___21~0#1;havoc init_~r153~0#1;havoc init_~tmp___22~0#1;havoc init_~r213~0#1;havoc init_~tmp___23~0#1;havoc init_~r233~0#1;havoc init_~tmp___24~0#1;havoc init_~r243~0#1;havoc init_~tmp___25~0#1;havoc init_~r253~0#1;havoc init_~tmp___26~0#1;havoc init_~r313~0#1;havoc init_~tmp___27~0#1;havoc init_~r323~0#1;havoc init_~tmp___28~0#1;havoc init_~r343~0#1;havoc init_~tmp___29~0#1;havoc init_~r353~0#1;havoc init_~tmp___30~0#1;havoc init_~r413~0#1;havoc init_~tmp___31~0#1;havoc init_~r423~0#1;havoc init_~tmp___32~0#1;havoc init_~r433~0#1;havoc init_~tmp___33~0#1;havoc init_~r453~0#1;havoc init_~tmp___34~0#1;havoc init_~r513~0#1;havoc init_~tmp___35~0#1;havoc init_~r523~0#1;havoc init_~tmp___36~0#1;havoc init_~r533~0#1;havoc init_~tmp___37~0#1;havoc init_~r543~0#1;havoc init_~tmp___38~0#1;havoc init_~r124~0#1;havoc init_~tmp___39~0#1;havoc init_~r134~0#1;havoc init_~tmp___40~0#1;havoc init_~r144~0#1;havoc init_~tmp___41~0#1;havoc init_~r154~0#1;havoc init_~tmp___42~0#1;havoc init_~r214~0#1;havoc init_~tmp___43~0#1;havoc init_~r234~0#1;havoc init_~tmp___44~0#1;havoc init_~r244~0#1;havoc init_~tmp___45~0#1;havoc init_~r254~0#1;havoc init_~tmp___46~0#1;havoc init_~r314~0#1;havoc init_~tmp___47~0#1;havoc init_~r324~0#1;havoc init_~tmp___48~0#1;havoc init_~r344~0#1;havoc init_~tmp___49~0#1;havoc init_~r354~0#1;havoc init_~tmp___50~0#1;havoc init_~r414~0#1;havoc init_~tmp___51~0#1;havoc init_~r424~0#1;havoc init_~tmp___52~0#1;havoc init_~r434~0#1;havoc init_~tmp___53~0#1;havoc init_~r454~0#1;havoc init_~tmp___54~0#1;havoc init_~r514~0#1;havoc init_~tmp___55~0#1;havoc init_~r524~0#1;havoc init_~tmp___56~0#1;havoc init_~r534~0#1;havoc init_~tmp___57~0#1;havoc init_~r544~0#1;havoc init_~tmp___58~0#1;havoc init_~tmp___59~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r151~0#1 := ~ep15~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r251~0#1 := ~ep25~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r351~0#1 := ~ep35~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0;init_~r451~0#1 := ~ep45~0;init_~r511~0#1 := ~ep51~0;init_~r521~0#1 := ~ep52~0;init_~r531~0#1 := ~ep53~0;init_~r541~0#1 := ~ep54~0; {709#true} is VALID [2022-02-21 04:27:38,543 INFO L290 TraceCheckUtils]: 2: Hoare triple {709#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,544 INFO L290 TraceCheckUtils]: 3: Hoare triple {709#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,544 INFO L290 TraceCheckUtils]: 4: Hoare triple {709#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,544 INFO L290 TraceCheckUtils]: 5: Hoare triple {709#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,545 INFO L290 TraceCheckUtils]: 6: Hoare triple {709#true} assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,545 INFO L290 TraceCheckUtils]: 7: Hoare triple {709#true} init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,545 INFO L290 TraceCheckUtils]: 8: Hoare triple {709#true} assume 0 != init_~r151~0#1 % 256;init_~tmp___2~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,545 INFO L290 TraceCheckUtils]: 9: Hoare triple {709#true} init_~r152~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,546 INFO L290 TraceCheckUtils]: 10: Hoare triple {709#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___3~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,546 INFO L290 TraceCheckUtils]: 11: Hoare triple {709#true} init_~r212~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,546 INFO L290 TraceCheckUtils]: 12: Hoare triple {709#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___4~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,546 INFO L290 TraceCheckUtils]: 13: Hoare triple {709#true} init_~r232~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {709#true} assume 0 != init_~r241~0#1 % 256;init_~tmp___5~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,547 INFO L290 TraceCheckUtils]: 15: Hoare triple {709#true} init_~r242~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,547 INFO L290 TraceCheckUtils]: 16: Hoare triple {709#true} assume 0 != init_~r251~0#1 % 256;init_~tmp___6~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,547 INFO L290 TraceCheckUtils]: 17: Hoare triple {709#true} init_~r252~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,547 INFO L290 TraceCheckUtils]: 18: Hoare triple {709#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___7~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {709#true} init_~r312~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,548 INFO L290 TraceCheckUtils]: 20: Hoare triple {709#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___8~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,548 INFO L290 TraceCheckUtils]: 21: Hoare triple {709#true} init_~r322~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,548 INFO L290 TraceCheckUtils]: 22: Hoare triple {709#true} assume 0 != init_~r341~0#1 % 256;init_~tmp___9~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {709#true} init_~r342~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,549 INFO L290 TraceCheckUtils]: 24: Hoare triple {709#true} assume 0 != init_~r351~0#1 % 256;init_~tmp___10~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,550 INFO L290 TraceCheckUtils]: 25: Hoare triple {709#true} init_~r352~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,550 INFO L290 TraceCheckUtils]: 26: Hoare triple {709#true} assume 0 != init_~r411~0#1 % 256;init_~tmp___11~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,550 INFO L290 TraceCheckUtils]: 27: Hoare triple {709#true} init_~r412~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,550 INFO L290 TraceCheckUtils]: 28: Hoare triple {709#true} assume 0 != init_~r421~0#1 % 256;init_~tmp___12~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,551 INFO L290 TraceCheckUtils]: 29: Hoare triple {709#true} init_~r422~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,551 INFO L290 TraceCheckUtils]: 30: Hoare triple {709#true} assume 0 != init_~r431~0#1 % 256;init_~tmp___13~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,551 INFO L290 TraceCheckUtils]: 31: Hoare triple {709#true} init_~r432~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,551 INFO L290 TraceCheckUtils]: 32: Hoare triple {709#true} assume 0 != init_~r451~0#1 % 256;init_~tmp___14~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,551 INFO L290 TraceCheckUtils]: 33: Hoare triple {709#true} init_~r452~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,551 INFO L290 TraceCheckUtils]: 34: Hoare triple {709#true} assume 0 != init_~r511~0#1 % 256;init_~tmp___15~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,552 INFO L290 TraceCheckUtils]: 35: Hoare triple {709#true} init_~r512~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,552 INFO L290 TraceCheckUtils]: 36: Hoare triple {709#true} assume 0 != init_~r521~0#1 % 256;init_~tmp___16~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,552 INFO L290 TraceCheckUtils]: 37: Hoare triple {709#true} init_~r522~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,552 INFO L290 TraceCheckUtils]: 38: Hoare triple {709#true} assume 0 != init_~r531~0#1 % 256;init_~tmp___17~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,553 INFO L290 TraceCheckUtils]: 39: Hoare triple {709#true} init_~r532~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,553 INFO L290 TraceCheckUtils]: 40: Hoare triple {709#true} assume 0 != init_~r541~0#1 % 256;init_~tmp___18~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,553 INFO L290 TraceCheckUtils]: 41: Hoare triple {709#true} init_~r542~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,553 INFO L290 TraceCheckUtils]: 42: Hoare triple {709#true} assume 0 != init_~r122~0#1 % 256;init_~tmp___19~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,554 INFO L290 TraceCheckUtils]: 43: Hoare triple {709#true} init_~r123~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,554 INFO L290 TraceCheckUtils]: 44: Hoare triple {709#true} assume 0 != init_~r132~0#1 % 256;init_~tmp___20~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,554 INFO L290 TraceCheckUtils]: 45: Hoare triple {709#true} init_~r133~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,554 INFO L290 TraceCheckUtils]: 46: Hoare triple {709#true} assume 0 != init_~r142~0#1 % 256;init_~tmp___21~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,555 INFO L290 TraceCheckUtils]: 47: Hoare triple {709#true} init_~r143~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,555 INFO L290 TraceCheckUtils]: 48: Hoare triple {709#true} assume 0 != init_~r152~0#1 % 256;init_~tmp___22~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,558 INFO L290 TraceCheckUtils]: 49: Hoare triple {709#true} init_~r153~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,558 INFO L290 TraceCheckUtils]: 50: Hoare triple {709#true} assume 0 != init_~r212~0#1 % 256;init_~tmp___23~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,558 INFO L290 TraceCheckUtils]: 51: Hoare triple {709#true} init_~r213~0#1 := (if 0 == init_~tmp___23~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,559 INFO L290 TraceCheckUtils]: 52: Hoare triple {709#true} assume 0 != init_~r232~0#1 % 256;init_~tmp___24~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,559 INFO L290 TraceCheckUtils]: 53: Hoare triple {709#true} init_~r233~0#1 := (if 0 == init_~tmp___24~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,560 INFO L290 TraceCheckUtils]: 54: Hoare triple {709#true} assume 0 != init_~r242~0#1 % 256;init_~tmp___25~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,562 INFO L290 TraceCheckUtils]: 55: Hoare triple {709#true} init_~r243~0#1 := (if 0 == init_~tmp___25~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,563 INFO L290 TraceCheckUtils]: 56: Hoare triple {709#true} assume 0 != init_~r252~0#1 % 256;init_~tmp___26~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,564 INFO L290 TraceCheckUtils]: 57: Hoare triple {709#true} init_~r253~0#1 := (if 0 == init_~tmp___26~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,564 INFO L290 TraceCheckUtils]: 58: Hoare triple {709#true} assume 0 != init_~r312~0#1 % 256;init_~tmp___27~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,565 INFO L290 TraceCheckUtils]: 59: Hoare triple {709#true} init_~r313~0#1 := (if 0 == init_~tmp___27~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,565 INFO L290 TraceCheckUtils]: 60: Hoare triple {709#true} assume 0 != init_~r322~0#1 % 256;init_~tmp___28~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,565 INFO L290 TraceCheckUtils]: 61: Hoare triple {709#true} init_~r323~0#1 := (if 0 == init_~tmp___28~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,566 INFO L290 TraceCheckUtils]: 62: Hoare triple {709#true} assume 0 != init_~r342~0#1 % 256;init_~tmp___29~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,566 INFO L290 TraceCheckUtils]: 63: Hoare triple {709#true} init_~r343~0#1 := (if 0 == init_~tmp___29~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,566 INFO L290 TraceCheckUtils]: 64: Hoare triple {709#true} assume 0 != init_~r352~0#1 % 256;init_~tmp___30~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,568 INFO L290 TraceCheckUtils]: 65: Hoare triple {709#true} init_~r353~0#1 := (if 0 == init_~tmp___30~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,571 INFO L290 TraceCheckUtils]: 66: Hoare triple {709#true} assume 0 != init_~r412~0#1 % 256;init_~tmp___31~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,571 INFO L290 TraceCheckUtils]: 67: Hoare triple {709#true} init_~r413~0#1 := (if 0 == init_~tmp___31~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,572 INFO L290 TraceCheckUtils]: 68: Hoare triple {709#true} assume 0 != init_~r422~0#1 % 256;init_~tmp___32~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,572 INFO L290 TraceCheckUtils]: 69: Hoare triple {709#true} init_~r423~0#1 := (if 0 == init_~tmp___32~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,572 INFO L290 TraceCheckUtils]: 70: Hoare triple {709#true} assume 0 != init_~r432~0#1 % 256;init_~tmp___33~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,572 INFO L290 TraceCheckUtils]: 71: Hoare triple {709#true} init_~r433~0#1 := (if 0 == init_~tmp___33~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,572 INFO L290 TraceCheckUtils]: 72: Hoare triple {709#true} assume 0 != init_~r452~0#1 % 256;init_~tmp___34~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,572 INFO L290 TraceCheckUtils]: 73: Hoare triple {709#true} init_~r453~0#1 := (if 0 == init_~tmp___34~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,573 INFO L290 TraceCheckUtils]: 74: Hoare triple {709#true} assume 0 != init_~r512~0#1 % 256;init_~tmp___35~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,573 INFO L290 TraceCheckUtils]: 75: Hoare triple {709#true} init_~r513~0#1 := (if 0 == init_~tmp___35~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,573 INFO L290 TraceCheckUtils]: 76: Hoare triple {709#true} assume 0 != init_~r522~0#1 % 256;init_~tmp___36~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,573 INFO L290 TraceCheckUtils]: 77: Hoare triple {709#true} init_~r523~0#1 := (if 0 == init_~tmp___36~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,573 INFO L290 TraceCheckUtils]: 78: Hoare triple {709#true} assume 0 != init_~r532~0#1 % 256;init_~tmp___37~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,573 INFO L290 TraceCheckUtils]: 79: Hoare triple {709#true} init_~r533~0#1 := (if 0 == init_~tmp___37~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,574 INFO L290 TraceCheckUtils]: 80: Hoare triple {709#true} assume 0 != init_~r542~0#1 % 256;init_~tmp___38~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,574 INFO L290 TraceCheckUtils]: 81: Hoare triple {709#true} init_~r543~0#1 := (if 0 == init_~tmp___38~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,574 INFO L290 TraceCheckUtils]: 82: Hoare triple {709#true} assume 0 != init_~r123~0#1 % 256;init_~tmp___39~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,574 INFO L290 TraceCheckUtils]: 83: Hoare triple {709#true} init_~r124~0#1 := (if 0 == init_~tmp___39~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,574 INFO L290 TraceCheckUtils]: 84: Hoare triple {709#true} assume 0 != init_~r133~0#1 % 256;init_~tmp___40~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,575 INFO L290 TraceCheckUtils]: 85: Hoare triple {709#true} init_~r134~0#1 := (if 0 == init_~tmp___40~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,575 INFO L290 TraceCheckUtils]: 86: Hoare triple {709#true} assume 0 != init_~r143~0#1 % 256;init_~tmp___41~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,575 INFO L290 TraceCheckUtils]: 87: Hoare triple {709#true} init_~r144~0#1 := (if 0 == init_~tmp___41~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,575 INFO L290 TraceCheckUtils]: 88: Hoare triple {709#true} assume 0 != init_~r153~0#1 % 256;init_~tmp___42~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,575 INFO L290 TraceCheckUtils]: 89: Hoare triple {709#true} init_~r154~0#1 := (if 0 == init_~tmp___42~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,576 INFO L290 TraceCheckUtils]: 90: Hoare triple {709#true} assume 0 != init_~r213~0#1 % 256;init_~tmp___43~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,576 INFO L290 TraceCheckUtils]: 91: Hoare triple {709#true} init_~r214~0#1 := (if 0 == init_~tmp___43~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,576 INFO L290 TraceCheckUtils]: 92: Hoare triple {709#true} assume 0 != init_~r233~0#1 % 256;init_~tmp___44~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,576 INFO L290 TraceCheckUtils]: 93: Hoare triple {709#true} init_~r234~0#1 := (if 0 == init_~tmp___44~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,576 INFO L290 TraceCheckUtils]: 94: Hoare triple {709#true} assume 0 != init_~r243~0#1 % 256;init_~tmp___45~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,576 INFO L290 TraceCheckUtils]: 95: Hoare triple {709#true} init_~r244~0#1 := (if 0 == init_~tmp___45~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,577 INFO L290 TraceCheckUtils]: 96: Hoare triple {709#true} assume 0 != init_~r253~0#1 % 256;init_~tmp___46~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,577 INFO L290 TraceCheckUtils]: 97: Hoare triple {709#true} init_~r254~0#1 := (if 0 == init_~tmp___46~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,577 INFO L290 TraceCheckUtils]: 98: Hoare triple {709#true} assume 0 != init_~r313~0#1 % 256;init_~tmp___47~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,577 INFO L290 TraceCheckUtils]: 99: Hoare triple {709#true} init_~r314~0#1 := (if 0 == init_~tmp___47~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,577 INFO L290 TraceCheckUtils]: 100: Hoare triple {709#true} assume 0 != init_~r323~0#1 % 256;init_~tmp___48~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,577 INFO L290 TraceCheckUtils]: 101: Hoare triple {709#true} init_~r324~0#1 := (if 0 == init_~tmp___48~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,578 INFO L290 TraceCheckUtils]: 102: Hoare triple {709#true} assume 0 != init_~r343~0#1 % 256;init_~tmp___49~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,578 INFO L290 TraceCheckUtils]: 103: Hoare triple {709#true} init_~r344~0#1 := (if 0 == init_~tmp___49~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,578 INFO L290 TraceCheckUtils]: 104: Hoare triple {709#true} assume 0 != init_~r353~0#1 % 256;init_~tmp___50~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,580 INFO L290 TraceCheckUtils]: 105: Hoare triple {709#true} init_~r354~0#1 := (if 0 == init_~tmp___50~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,580 INFO L290 TraceCheckUtils]: 106: Hoare triple {709#true} assume 0 != init_~r413~0#1 % 256;init_~tmp___51~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,581 INFO L290 TraceCheckUtils]: 107: Hoare triple {709#true} init_~r414~0#1 := (if 0 == init_~tmp___51~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,581 INFO L290 TraceCheckUtils]: 108: Hoare triple {709#true} assume 0 != init_~r423~0#1 % 256;init_~tmp___52~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,581 INFO L290 TraceCheckUtils]: 109: Hoare triple {709#true} init_~r424~0#1 := (if 0 == init_~tmp___52~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,581 INFO L290 TraceCheckUtils]: 110: Hoare triple {709#true} assume 0 != init_~r433~0#1 % 256;init_~tmp___53~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,581 INFO L290 TraceCheckUtils]: 111: Hoare triple {709#true} init_~r434~0#1 := (if 0 == init_~tmp___53~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,581 INFO L290 TraceCheckUtils]: 112: Hoare triple {709#true} assume 0 != init_~r453~0#1 % 256;init_~tmp___54~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,582 INFO L290 TraceCheckUtils]: 113: Hoare triple {709#true} init_~r454~0#1 := (if 0 == init_~tmp___54~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,582 INFO L290 TraceCheckUtils]: 114: Hoare triple {709#true} assume 0 != init_~r513~0#1 % 256;init_~tmp___55~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,583 INFO L290 TraceCheckUtils]: 115: Hoare triple {709#true} init_~r514~0#1 := (if 0 == init_~tmp___55~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,583 INFO L290 TraceCheckUtils]: 116: Hoare triple {709#true} assume 0 != init_~r523~0#1 % 256;init_~tmp___56~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,583 INFO L290 TraceCheckUtils]: 117: Hoare triple {709#true} init_~r524~0#1 := (if 0 == init_~tmp___56~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,584 INFO L290 TraceCheckUtils]: 118: Hoare triple {709#true} assume 0 != init_~r533~0#1 % 256;init_~tmp___57~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,584 INFO L290 TraceCheckUtils]: 119: Hoare triple {709#true} init_~r534~0#1 := (if 0 == init_~tmp___57~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,595 INFO L290 TraceCheckUtils]: 120: Hoare triple {709#true} assume 0 != init_~r543~0#1 % 256;init_~tmp___58~0#1 := 1; {709#true} is VALID [2022-02-21 04:27:38,596 INFO L290 TraceCheckUtils]: 121: Hoare triple {709#true} init_~r544~0#1 := (if 0 == init_~tmp___58~0#1 then 0 else 1); {709#true} is VALID [2022-02-21 04:27:38,597 INFO L290 TraceCheckUtils]: 122: Hoare triple {709#true} assume !(~id1~0 != ~id2~0);init_~tmp___59~0#1 := 0; {711#(= |ULTIMATE.start_init_~tmp___59~0#1| 0)} is VALID [2022-02-21 04:27:38,597 INFO L290 TraceCheckUtils]: 123: Hoare triple {711#(= |ULTIMATE.start_init_~tmp___59~0#1| 0)} init_#res#1 := init_~tmp___59~0#1; {712#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:27:38,600 INFO L290 TraceCheckUtils]: 124: Hoare triple {712#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret79#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret79#1;havoc main_#t~ret79#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; {713#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:27:38,601 INFO L290 TraceCheckUtils]: 125: Hoare triple {713#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {710#false} is VALID [2022-02-21 04:27:38,601 INFO L290 TraceCheckUtils]: 126: Hoare triple {710#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;~p15_old~0 := ~nomsg~0;~p15_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;~p25_old~0 := ~nomsg~0;~p25_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;~p35_old~0 := ~nomsg~0;~p35_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;~p45_old~0 := ~nomsg~0;~p45_new~0 := ~nomsg~0;~p51_old~0 := ~nomsg~0;~p51_new~0 := ~nomsg~0;~p52_old~0 := ~nomsg~0;~p52_new~0 := ~nomsg~0;~p53_old~0 := ~nomsg~0;~p53_new~0 := ~nomsg~0;~p54_old~0 := ~nomsg~0;~p54_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {710#false} is VALID [2022-02-21 04:27:38,602 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:27:38,604 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:27:38,604 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251373972] [2022-02-21 04:27:38,605 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251373972] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:27:38,606 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:27:38,606 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:27:38,608 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586730876] [2022-02-21 04:27:38,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:27:38,612 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:27:38,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:27:38,614 INFO L85 PathProgramCache]: Analyzing trace with hash -679733109, now seen corresponding path program 1 times [2022-02-21 04:27:38,615 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:27:38,615 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119521325] [2022-02-21 04:27:38,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:27:38,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:27:38,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:27:38,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {714#true} assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1, node1_#t~ite7#1; {714#true} is VALID [2022-02-21 04:27:38,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {714#true} assume !(0 != ~mode1~0 % 256); {714#true} is VALID [2022-02-21 04:27:38,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {714#true} assume !(~r1~0 < 4); {714#true} is VALID [2022-02-21 04:27:38,702 INFO L290 TraceCheckUtils]: 3: Hoare triple {714#true} ~mode1~0 := 1; {714#true} is VALID [2022-02-21 04:27:38,702 INFO L290 TraceCheckUtils]: 4: Hoare triple {714#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite8#1, node2_#t~ite9#1, node2_#t~ite10#1, node2_#t~ite11#1; {714#true} is VALID [2022-02-21 04:27:38,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {714#true} assume !(0 != ~mode2~0 % 256); {714#true} is VALID [2022-02-21 04:27:38,702 INFO L290 TraceCheckUtils]: 6: Hoare triple {714#true} assume !(~r2~0 < 4); {714#true} is VALID [2022-02-21 04:27:38,702 INFO L290 TraceCheckUtils]: 7: Hoare triple {714#true} ~mode2~0 := 1; {714#true} is VALID [2022-02-21 04:27:38,702 INFO L290 TraceCheckUtils]: 8: Hoare triple {714#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite12#1, node3_#t~ite13#1, node3_#t~ite14#1, node3_#t~ite15#1; {714#true} is VALID [2022-02-21 04:27:38,703 INFO L290 TraceCheckUtils]: 9: Hoare triple {714#true} assume !(0 != ~mode3~0 % 256); {714#true} is VALID [2022-02-21 04:27:38,703 INFO L290 TraceCheckUtils]: 10: Hoare triple {714#true} assume !(~r3~0 < 4); {714#true} is VALID [2022-02-21 04:27:38,703 INFO L290 TraceCheckUtils]: 11: Hoare triple {714#true} ~mode3~0 := 1; {714#true} is VALID [2022-02-21 04:27:38,703 INFO L290 TraceCheckUtils]: 12: Hoare triple {714#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite16#1, node4_#t~ite17#1, node4_#t~ite18#1, node4_#t~ite19#1; {714#true} is VALID [2022-02-21 04:27:38,703 INFO L290 TraceCheckUtils]: 13: Hoare triple {714#true} assume !(0 != ~mode4~0 % 256); {714#true} is VALID [2022-02-21 04:27:38,703 INFO L290 TraceCheckUtils]: 14: Hoare triple {714#true} assume !(~r4~0 < 4); {714#true} is VALID [2022-02-21 04:27:38,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {714#true} ~mode4~0 := 1; {714#true} is VALID [2022-02-21 04:27:38,704 INFO L290 TraceCheckUtils]: 16: Hoare triple {714#true} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite20#1, node5_#t~ite21#1, node5_#t~ite22#1, node5_#t~ite23#1; {714#true} is VALID [2022-02-21 04:27:38,704 INFO L290 TraceCheckUtils]: 17: Hoare triple {714#true} assume !(0 != ~mode5~0 % 256); {714#true} is VALID [2022-02-21 04:27:38,704 INFO L290 TraceCheckUtils]: 18: Hoare triple {714#true} assume !(~r5~0 < 4); {714#true} is VALID [2022-02-21 04:27:38,704 INFO L290 TraceCheckUtils]: 19: Hoare triple {714#true} ~mode5~0 := 1; {714#true} is VALID [2022-02-21 04:27:38,705 INFO L290 TraceCheckUtils]: 20: Hoare triple {714#true} assume { :end_inline_node5 } 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;~p15_old~0 := ~p15_new~0;~p15_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;~p25_old~0 := ~p25_new~0;~p25_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;~p35_old~0 := ~p35_new~0;~p35_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;~p45_old~0 := ~p45_new~0;~p45_new~0 := ~nomsg~0;~p51_old~0 := ~p51_new~0;~p51_new~0 := ~nomsg~0;~p52_old~0 := ~p52_new~0;~p52_new~0 := ~nomsg~0;~p53_old~0 := ~p53_new~0;~p53_new~0 := ~nomsg~0;~p54_old~0 := ~p54_new~0;~p54_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {714#true} is VALID [2022-02-21 04:27:38,705 INFO L290 TraceCheckUtils]: 21: Hoare triple {714#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {716#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:27:38,706 INFO L290 TraceCheckUtils]: 22: Hoare triple {716#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {717#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:27:38,706 INFO L290 TraceCheckUtils]: 23: Hoare triple {717#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret80#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret80#1;havoc main_#t~ret80#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; {718#(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:27:38,707 INFO L290 TraceCheckUtils]: 24: Hoare triple {718#(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); {715#false} is VALID [2022-02-21 04:27:38,707 INFO L290 TraceCheckUtils]: 25: Hoare triple {715#false} assume { :end_inline_assert } true;main_#t~post81#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post81#1;havoc main_#t~post81#1; {715#false} is VALID [2022-02-21 04:27:38,708 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:27:38,708 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:27:38,708 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119521325] [2022-02-21 04:27:38,708 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119521325] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:27:38,708 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:27:38,708 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:27:38,709 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1678539949] [2022-02-21 04:27:38,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:27:38,710 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:27:38,710 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:27:38,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:27:38,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:27:38,736 INFO L87 Difference]: Start difference. First operand has 705 states, 704 states have (on average 1.8494318181818181) internal successors, (1302), 704 states have internal predecessors, (1302), 0 states have call successors, (0), 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 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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:27:41,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:27:41,202 INFO L93 Difference]: Finished difference Result 709 states and 1302 transitions. [2022-02-21 04:27:41,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:27:41,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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:27:41,227 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:27:41,230 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 709 states and 1302 transitions. [2022-02-21 04:27:41,277 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 154 [2022-02-21 04:27:41,304 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 709 states to 700 states and 1284 transitions. [2022-02-21 04:27:41,305 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 700 [2022-02-21 04:27:41,306 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 700 [2022-02-21 04:27:41,306 INFO L73 IsDeterministic]: Start isDeterministic. Operand 700 states and 1284 transitions. [2022-02-21 04:27:41,309 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:27:41,309 INFO L681 BuchiCegarLoop]: Abstraction has 700 states and 1284 transitions. [2022-02-21 04:27:41,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 700 states and 1284 transitions. [2022-02-21 04:27:41,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 700 to 700. [2022-02-21 04:27:41,347 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:27:41,350 INFO L82 GeneralOperation]: Start isEquivalent. First operand 700 states and 1284 transitions. Second operand has 700 states, 700 states have (on average 1.8342857142857143) internal successors, (1284), 699 states have internal predecessors, (1284), 0 states have call successors, (0), 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:27:41,353 INFO L74 IsIncluded]: Start isIncluded. First operand 700 states and 1284 transitions. Second operand has 700 states, 700 states have (on average 1.8342857142857143) internal successors, (1284), 699 states have internal predecessors, (1284), 0 states have call successors, (0), 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:27:41,357 INFO L87 Difference]: Start difference. First operand 700 states and 1284 transitions. Second operand has 700 states, 700 states have (on average 1.8342857142857143) internal successors, (1284), 699 states have internal predecessors, (1284), 0 states have call successors, (0), 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:27:41,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:27:41,411 INFO L93 Difference]: Finished difference Result 700 states and 1284 transitions. [2022-02-21 04:27:41,411 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1284 transitions. [2022-02-21 04:27:41,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:27:41,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:27:41,427 INFO L74 IsIncluded]: Start isIncluded. First operand has 700 states, 700 states have (on average 1.8342857142857143) internal successors, (1284), 699 states have internal predecessors, (1284), 0 states have call successors, (0), 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 700 states and 1284 transitions. [2022-02-21 04:27:41,428 INFO L87 Difference]: Start difference. First operand has 700 states, 700 states have (on average 1.8342857142857143) internal successors, (1284), 699 states have internal predecessors, (1284), 0 states have call successors, (0), 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 700 states and 1284 transitions. [2022-02-21 04:27:41,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:27:41,475 INFO L93 Difference]: Finished difference Result 700 states and 1284 transitions. [2022-02-21 04:27:41,475 INFO L276 IsEmpty]: Start isEmpty. Operand 700 states and 1284 transitions. [2022-02-21 04:27:41,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:27:41,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:27:41,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:27:41,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:27:41,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 700 states, 700 states have (on average 1.8342857142857143) internal successors, (1284), 699 states have internal predecessors, (1284), 0 states have call successors, (0), 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:27:41,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 700 states to 700 states and 1284 transitions. [2022-02-21 04:27:41,512 INFO L704 BuchiCegarLoop]: Abstraction has 700 states and 1284 transitions. [2022-02-21 04:27:41,512 INFO L587 BuchiCegarLoop]: Abstraction has 700 states and 1284 transitions. [2022-02-21 04:27:41,512 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:27:41,512 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 700 states and 1284 transitions. [2022-02-21 04:27:41,515 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 154 [2022-02-21 04:27:41,516 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:27:41,516 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:27:41,517 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:41,518 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:27:41,518 INFO L791 eck$LassoCheckResult]: Stem: 2131#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(40, 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;~p15~0 := 0;~p15_old~0 := 0;~p15_new~0 := 0;~ep15~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;~p25~0 := 0;~p25_old~0 := 0;~p25_new~0 := 0;~ep25~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;~p35~0 := 0;~p35_old~0 := 0;~p35_new~0 := 0;~ep35~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;~p45~0 := 0;~p45_old~0 := 0;~p45_new~0 := 0;~ep45~0 := 0;~p51~0 := 0;~p51_old~0 := 0;~p51_new~0 := 0;~ep51~0 := 0;~p52~0 := 0;~p52_old~0 := 0;~p52_new~0 := 0;~ep52~0 := 0;~p53~0 := 0;~p53_old~0 := 0;~p53_new~0 := 0;~ep53~0 := 0;~p54~0 := 0;~p54_old~0 := 0;~p54_new~0 := 0;~ep54~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~id5~0 := 0;~r5~0 := 0;~st5~0 := 0;~nl5~0 := 0;~m5~0 := 0;~max5~0 := 0;~mode5~0 := 0; 2116#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet60#1, main_#t~nondet61#1, main_#t~nondet62#1, main_#t~nondet63#1, main_#t~nondet64#1, main_#t~nondet65#1, main_#t~nondet66#1, main_#t~nondet67#1, main_#t~nondet68#1, main_#t~nondet69#1, main_#t~nondet70#1, main_#t~nondet71#1, main_#t~nondet72#1, main_#t~nondet73#1, main_#t~nondet74#1, main_#t~nondet75#1, main_#t~nondet76#1, main_#t~nondet77#1, main_#t~nondet78#1, main_#t~ret79#1, main_#t~ret80#1, main_#t~post81#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~nondet24#1;havoc main_#t~nondet24#1;~ep13~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep14~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep15~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~ep21~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~ep23~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~ep24~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~ep25~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~ep31~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~ep32~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~ep34~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~ep35~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~ep41~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~ep42~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~ep43~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~ep45~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~ep51~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~ep52~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~ep53~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~ep54~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~id1~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~r1~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~st1~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~nl1~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~m1~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~max1~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~mode1~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~id2~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~r2~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~st2~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~nl2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~m2~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;~max2~0 := main_#t~nondet56#1;havoc main_#t~nondet56#1;~mode2~0 := main_#t~nondet57#1;havoc main_#t~nondet57#1;~id3~0 := main_#t~nondet58#1;havoc main_#t~nondet58#1;~r3~0 := main_#t~nondet59#1;havoc main_#t~nondet59#1;~st3~0 := main_#t~nondet60#1;havoc main_#t~nondet60#1;~nl3~0 := main_#t~nondet61#1;havoc main_#t~nondet61#1;~m3~0 := main_#t~nondet62#1;havoc main_#t~nondet62#1;~max3~0 := main_#t~nondet63#1;havoc main_#t~nondet63#1;~mode3~0 := main_#t~nondet64#1;havoc main_#t~nondet64#1;~id4~0 := main_#t~nondet65#1;havoc main_#t~nondet65#1;~r4~0 := main_#t~nondet66#1;havoc main_#t~nondet66#1;~st4~0 := main_#t~nondet67#1;havoc main_#t~nondet67#1;~nl4~0 := main_#t~nondet68#1;havoc main_#t~nondet68#1;~m4~0 := main_#t~nondet69#1;havoc main_#t~nondet69#1;~max4~0 := main_#t~nondet70#1;havoc main_#t~nondet70#1;~mode4~0 := main_#t~nondet71#1;havoc main_#t~nondet71#1;~id5~0 := main_#t~nondet72#1;havoc main_#t~nondet72#1;~r5~0 := main_#t~nondet73#1;havoc main_#t~nondet73#1;~st5~0 := main_#t~nondet74#1;havoc main_#t~nondet74#1;~nl5~0 := main_#t~nondet75#1;havoc main_#t~nondet75#1;~m5~0 := main_#t~nondet76#1;havoc main_#t~nondet76#1;~max5~0 := main_#t~nondet77#1;havoc main_#t~nondet77#1;~mode5~0 := main_#t~nondet78#1;havoc main_#t~nondet78#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r151~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r251~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r351~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r451~0#1, init_~r511~0#1, init_~r521~0#1, init_~r531~0#1, init_~r541~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_~r152~0#1, init_~tmp___2~0#1, init_~r212~0#1, init_~tmp___3~0#1, init_~r232~0#1, init_~tmp___4~0#1, init_~r242~0#1, init_~tmp___5~0#1, init_~r252~0#1, init_~tmp___6~0#1, init_~r312~0#1, init_~tmp___7~0#1, init_~r322~0#1, init_~tmp___8~0#1, init_~r342~0#1, init_~tmp___9~0#1, init_~r352~0#1, init_~tmp___10~0#1, init_~r412~0#1, init_~tmp___11~0#1, init_~r422~0#1, init_~tmp___12~0#1, init_~r432~0#1, init_~tmp___13~0#1, init_~r452~0#1, init_~tmp___14~0#1, init_~r512~0#1, init_~tmp___15~0#1, init_~r522~0#1, init_~tmp___16~0#1, init_~r532~0#1, init_~tmp___17~0#1, init_~r542~0#1, init_~tmp___18~0#1, init_~r123~0#1, init_~tmp___19~0#1, init_~r133~0#1, init_~tmp___20~0#1, init_~r143~0#1, init_~tmp___21~0#1, init_~r153~0#1, init_~tmp___22~0#1, init_~r213~0#1, init_~tmp___23~0#1, init_~r233~0#1, init_~tmp___24~0#1, init_~r243~0#1, init_~tmp___25~0#1, init_~r253~0#1, init_~tmp___26~0#1, init_~r313~0#1, init_~tmp___27~0#1, init_~r323~0#1, init_~tmp___28~0#1, init_~r343~0#1, init_~tmp___29~0#1, init_~r353~0#1, init_~tmp___30~0#1, init_~r413~0#1, init_~tmp___31~0#1, init_~r423~0#1, init_~tmp___32~0#1, init_~r433~0#1, init_~tmp___33~0#1, init_~r453~0#1, init_~tmp___34~0#1, init_~r513~0#1, init_~tmp___35~0#1, init_~r523~0#1, init_~tmp___36~0#1, init_~r533~0#1, init_~tmp___37~0#1, init_~r543~0#1, init_~tmp___38~0#1, init_~r124~0#1, init_~tmp___39~0#1, init_~r134~0#1, init_~tmp___40~0#1, init_~r144~0#1, init_~tmp___41~0#1, init_~r154~0#1, init_~tmp___42~0#1, init_~r214~0#1, init_~tmp___43~0#1, init_~r234~0#1, init_~tmp___44~0#1, init_~r244~0#1, init_~tmp___45~0#1, init_~r254~0#1, init_~tmp___46~0#1, init_~r314~0#1, init_~tmp___47~0#1, init_~r324~0#1, init_~tmp___48~0#1, init_~r344~0#1, init_~tmp___49~0#1, init_~r354~0#1, init_~tmp___50~0#1, init_~r414~0#1, init_~tmp___51~0#1, init_~r424~0#1, init_~tmp___52~0#1, init_~r434~0#1, init_~tmp___53~0#1, init_~r454~0#1, init_~tmp___54~0#1, init_~r514~0#1, init_~tmp___55~0#1, init_~r524~0#1, init_~tmp___56~0#1, init_~r534~0#1, init_~tmp___57~0#1, init_~r544~0#1, init_~tmp___58~0#1, init_~tmp___59~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r151~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r251~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r351~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r451~0#1;havoc init_~r511~0#1;havoc init_~r521~0#1;havoc init_~r531~0#1;havoc init_~r541~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_~r152~0#1;havoc init_~tmp___2~0#1;havoc init_~r212~0#1;havoc init_~tmp___3~0#1;havoc init_~r232~0#1;havoc init_~tmp___4~0#1;havoc init_~r242~0#1;havoc init_~tmp___5~0#1;havoc init_~r252~0#1;havoc init_~tmp___6~0#1;havoc init_~r312~0#1;havoc init_~tmp___7~0#1;havoc init_~r322~0#1;havoc init_~tmp___8~0#1;havoc init_~r342~0#1;havoc init_~tmp___9~0#1;havoc init_~r352~0#1;havoc init_~tmp___10~0#1;havoc init_~r412~0#1;havoc init_~tmp___11~0#1;havoc init_~r422~0#1;havoc init_~tmp___12~0#1;havoc init_~r432~0#1;havoc init_~tmp___13~0#1;havoc init_~r452~0#1;havoc init_~tmp___14~0#1;havoc init_~r512~0#1;havoc init_~tmp___15~0#1;havoc init_~r522~0#1;havoc init_~tmp___16~0#1;havoc init_~r532~0#1;havoc init_~tmp___17~0#1;havoc init_~r542~0#1;havoc init_~tmp___18~0#1;havoc init_~r123~0#1;havoc init_~tmp___19~0#1;havoc init_~r133~0#1;havoc init_~tmp___20~0#1;havoc init_~r143~0#1;havoc init_~tmp___21~0#1;havoc init_~r153~0#1;havoc init_~tmp___22~0#1;havoc init_~r213~0#1;havoc init_~tmp___23~0#1;havoc init_~r233~0#1;havoc init_~tmp___24~0#1;havoc init_~r243~0#1;havoc init_~tmp___25~0#1;havoc init_~r253~0#1;havoc init_~tmp___26~0#1;havoc init_~r313~0#1;havoc init_~tmp___27~0#1;havoc init_~r323~0#1;havoc init_~tmp___28~0#1;havoc init_~r343~0#1;havoc init_~tmp___29~0#1;havoc init_~r353~0#1;havoc init_~tmp___30~0#1;havoc init_~r413~0#1;havoc init_~tmp___31~0#1;havoc init_~r423~0#1;havoc init_~tmp___32~0#1;havoc init_~r433~0#1;havoc init_~tmp___33~0#1;havoc init_~r453~0#1;havoc init_~tmp___34~0#1;havoc init_~r513~0#1;havoc init_~tmp___35~0#1;havoc init_~r523~0#1;havoc init_~tmp___36~0#1;havoc init_~r533~0#1;havoc init_~tmp___37~0#1;havoc init_~r543~0#1;havoc init_~tmp___38~0#1;havoc init_~r124~0#1;havoc init_~tmp___39~0#1;havoc init_~r134~0#1;havoc init_~tmp___40~0#1;havoc init_~r144~0#1;havoc init_~tmp___41~0#1;havoc init_~r154~0#1;havoc init_~tmp___42~0#1;havoc init_~r214~0#1;havoc init_~tmp___43~0#1;havoc init_~r234~0#1;havoc init_~tmp___44~0#1;havoc init_~r244~0#1;havoc init_~tmp___45~0#1;havoc init_~r254~0#1;havoc init_~tmp___46~0#1;havoc init_~r314~0#1;havoc init_~tmp___47~0#1;havoc init_~r324~0#1;havoc init_~tmp___48~0#1;havoc init_~r344~0#1;havoc init_~tmp___49~0#1;havoc init_~r354~0#1;havoc init_~tmp___50~0#1;havoc init_~r414~0#1;havoc init_~tmp___51~0#1;havoc init_~r424~0#1;havoc init_~tmp___52~0#1;havoc init_~r434~0#1;havoc init_~tmp___53~0#1;havoc init_~r454~0#1;havoc init_~tmp___54~0#1;havoc init_~r514~0#1;havoc init_~tmp___55~0#1;havoc init_~r524~0#1;havoc init_~tmp___56~0#1;havoc init_~r534~0#1;havoc init_~tmp___57~0#1;havoc init_~r544~0#1;havoc init_~tmp___58~0#1;havoc init_~tmp___59~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r151~0#1 := ~ep15~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r251~0#1 := ~ep25~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r351~0#1 := ~ep35~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0;init_~r451~0#1 := ~ep45~0;init_~r511~0#1 := ~ep51~0;init_~r521~0#1 := ~ep52~0;init_~r531~0#1 := ~ep53~0;init_~r541~0#1 := ~ep54~0; 2001#L623 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 1523#L642 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 1589#L652 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 1994#L671 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 2096#L681 assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; 1859#L700 init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 1648#L710 assume 0 != init_~r151~0#1 % 256;init_~tmp___2~0#1 := 1; 1635#L729 init_~r152~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 1848#L739 assume 0 != init_~r211~0#1 % 256;init_~tmp___3~0#1 := 1; 1520#L758 init_~r212~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 1467#L768 assume 0 != init_~r231~0#1 % 256;init_~tmp___4~0#1 := 1; 1468#L787 init_~r232~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 1942#L797 assume 0 != init_~r241~0#1 % 256;init_~tmp___5~0#1 := 1; 1616#L816 init_~r242~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); 2046#L826 assume 0 != init_~r251~0#1 % 256;init_~tmp___6~0#1 := 1; 1666#L845 init_~r252~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); 2015#L855 assume 0 != init_~r311~0#1 % 256;init_~tmp___7~0#1 := 1; 1477#L874 init_~r312~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); 1934#L884 assume 0 != init_~r321~0#1 % 256;init_~tmp___8~0#1 := 1; 1506#L903 init_~r322~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); 1765#L913 assume 0 != init_~r341~0#1 % 256;init_~tmp___9~0#1 := 1; 1452#L932 init_~r342~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); 2069#L942 assume 0 != init_~r351~0#1 % 256;init_~tmp___10~0#1 := 1; 1844#L961 init_~r352~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); 1845#L971 assume 0 != init_~r411~0#1 % 256;init_~tmp___11~0#1 := 1; 1475#L990 init_~r412~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); 1721#L1000 assume 0 != init_~r421~0#1 % 256;init_~tmp___12~0#1 := 1; 1770#L1019 init_~r422~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); 2128#L1029 assume 0 != init_~r431~0#1 % 256;init_~tmp___13~0#1 := 1; 1628#L1048 init_~r432~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); 1839#L1058 assume 0 != init_~r451~0#1 % 256;init_~tmp___14~0#1 := 1; 1484#L1077 init_~r452~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); 1791#L1087 assume 0 != init_~r511~0#1 % 256;init_~tmp___15~0#1 := 1; 1631#L1106 init_~r512~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); 1960#L1116 assume 0 != init_~r521~0#1 % 256;init_~tmp___16~0#1 := 1; 1610#L1135 init_~r522~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); 2023#L1145 assume 0 != init_~r531~0#1 % 256;init_~tmp___17~0#1 := 1; 1479#L1164 init_~r532~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); 1968#L1174 assume 0 != init_~r541~0#1 % 256;init_~tmp___18~0#1 := 1; 1594#L1193 init_~r542~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); 1921#L1203 assume 0 != init_~r122~0#1 % 256;init_~tmp___19~0#1 := 1; 1673#L1222 init_~r123~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); 1849#L1232 assume 0 != init_~r132~0#1 % 256;init_~tmp___20~0#1 := 1; 1910#L1251 init_~r133~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); 1911#L1261 assume 0 != init_~r142~0#1 % 256;init_~tmp___21~0#1 := 1; 1892#L1280 init_~r143~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); 1920#L1290 assume 0 != init_~r152~0#1 % 256;init_~tmp___22~0#1 := 1; 1671#L1309 init_~r153~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); 1988#L1319 assume 0 != init_~r212~0#1 % 256;init_~tmp___23~0#1 := 1; 1753#L1338 init_~r213~0#1 := (if 0 == init_~tmp___23~0#1 then 0 else 1); 1853#L1348 assume 0 != init_~r232~0#1 % 256;init_~tmp___24~0#1 := 1; 1542#L1367 init_~r233~0#1 := (if 0 == init_~tmp___24~0#1 then 0 else 1); 2062#L1377 assume 0 != init_~r242~0#1 % 256;init_~tmp___25~0#1 := 1; 1598#L1396 init_~r243~0#1 := (if 0 == init_~tmp___25~0#1 then 0 else 1); 1642#L1406 assume 0 != init_~r252~0#1 % 256;init_~tmp___26~0#1 := 1; 1741#L1425 init_~r253~0#1 := (if 0 == init_~tmp___26~0#1 then 0 else 1); 2078#L1435 assume 0 != init_~r312~0#1 % 256;init_~tmp___27~0#1 := 1; 1543#L1454 init_~r313~0#1 := (if 0 == init_~tmp___27~0#1 then 0 else 1); 1925#L1464 assume 0 != init_~r322~0#1 % 256;init_~tmp___28~0#1 := 1; 1826#L1483 init_~r323~0#1 := (if 0 == init_~tmp___28~0#1 then 0 else 1); 2104#L1493 assume 0 != init_~r342~0#1 % 256;init_~tmp___29~0#1 := 1; 1732#L1512 init_~r343~0#1 := (if 0 == init_~tmp___29~0#1 then 0 else 1); 1733#L1522 assume 0 != init_~r352~0#1 % 256;init_~tmp___30~0#1 := 1; 1442#L1541 init_~r353~0#1 := (if 0 == init_~tmp___30~0#1 then 0 else 1); 1573#L1551 assume 0 != init_~r412~0#1 % 256;init_~tmp___31~0#1 := 1; 1638#L1570 init_~r413~0#1 := (if 0 == init_~tmp___31~0#1 then 0 else 1); 1639#L1580 assume 0 != init_~r422~0#1 % 256;init_~tmp___32~0#1 := 1; 1777#L1599 init_~r423~0#1 := (if 0 == init_~tmp___32~0#1 then 0 else 1); 1508#L1609 assume 0 != init_~r432~0#1 % 256;init_~tmp___33~0#1 := 1; 1509#L1628 init_~r433~0#1 := (if 0 == init_~tmp___33~0#1 then 0 else 1); 1868#L1638 assume 0 != init_~r452~0#1 % 256;init_~tmp___34~0#1 := 1; 1446#L1657 init_~r453~0#1 := (if 0 == init_~tmp___34~0#1 then 0 else 1); 1727#L1667 assume 0 != init_~r512~0#1 % 256;init_~tmp___35~0#1 := 1; 1618#L1686 init_~r513~0#1 := (if 0 == init_~tmp___35~0#1 then 0 else 1); 1860#L1696 assume 0 != init_~r522~0#1 % 256;init_~tmp___36~0#1 := 1; 1819#L1715 init_~r523~0#1 := (if 0 == init_~tmp___36~0#1 then 0 else 1); 1882#L1725 assume 0 != init_~r532~0#1 % 256;init_~tmp___37~0#1 := 1; 1883#L1744 init_~r533~0#1 := (if 0 == init_~tmp___37~0#1 then 0 else 1); 2067#L1754 assume 0 != init_~r542~0#1 % 256;init_~tmp___38~0#1 := 1; 1851#L1773 init_~r543~0#1 := (if 0 == init_~tmp___38~0#1 then 0 else 1); 1852#L1783 assume 0 != init_~r123~0#1 % 256;init_~tmp___39~0#1 := 1; 1534#L1802 init_~r124~0#1 := (if 0 == init_~tmp___39~0#1 then 0 else 1); 2026#L1812 assume 0 != init_~r133~0#1 % 256;init_~tmp___40~0#1 := 1; 1933#L1831 init_~r134~0#1 := (if 0 == init_~tmp___40~0#1 then 0 else 1); 1688#L1841 assume 0 != init_~r143~0#1 % 256;init_~tmp___41~0#1 := 1; 1575#L1860 init_~r144~0#1 := (if 0 == init_~tmp___41~0#1 then 0 else 1); 1625#L1870 assume 0 != init_~r153~0#1 % 256;init_~tmp___42~0#1 := 1; 1626#L1889 init_~r154~0#1 := (if 0 == init_~tmp___42~0#1 then 0 else 1); 1846#L1899 assume 0 != init_~r213~0#1 % 256;init_~tmp___43~0#1 := 1; 1537#L1918 init_~r214~0#1 := (if 0 == init_~tmp___43~0#1 then 0 else 1); 1842#L1928 assume 0 != init_~r233~0#1 % 256;init_~tmp___44~0#1 := 1; 1843#L1947 init_~r234~0#1 := (if 0 == init_~tmp___44~0#1 then 0 else 1); 2052#L1957 assume 0 != init_~r243~0#1 % 256;init_~tmp___45~0#1 := 1; 2093#L1976 init_~r244~0#1 := (if 0 == init_~tmp___45~0#1 then 0 else 1); 1814#L1986 assume 0 != init_~r253~0#1 % 256;init_~tmp___46~0#1 := 1; 1701#L2005 init_~r254~0#1 := (if 0 == init_~tmp___46~0#1 then 0 else 1); 1854#L2015 assume 0 != init_~r313~0#1 % 256;init_~tmp___47~0#1 := 1; 1602#L2034 init_~r314~0#1 := (if 0 == init_~tmp___47~0#1 then 0 else 1); 2074#L2044 assume 0 != init_~r323~0#1 % 256;init_~tmp___48~0#1 := 1; 1554#L2063 init_~r324~0#1 := (if 0 == init_~tmp___48~0#1 then 0 else 1); 1898#L2073 assume 0 != init_~r343~0#1 % 256;init_~tmp___49~0#1 := 1; 1712#L2092 init_~r344~0#1 := (if 0 == init_~tmp___49~0#1 then 0 else 1); 1703#L2102 assume 0 != init_~r353~0#1 % 256;init_~tmp___50~0#1 := 1; 1591#L2121 init_~r354~0#1 := (if 0 == init_~tmp___50~0#1 then 0 else 1); 1787#L2131 assume 0 != init_~r413~0#1 % 256;init_~tmp___51~0#1 := 1; 1551#L2150 init_~r414~0#1 := (if 0 == init_~tmp___51~0#1 then 0 else 1); 1836#L2160 assume 0 != init_~r423~0#1 % 256;init_~tmp___52~0#1 := 1; 1561#L2179 init_~r424~0#1 := (if 0 == init_~tmp___52~0#1 then 0 else 1); 1562#L2189 assume 0 != init_~r433~0#1 % 256;init_~tmp___53~0#1 := 1; 1838#L2208 init_~r434~0#1 := (if 0 == init_~tmp___53~0#1 then 0 else 1); 1906#L2218 assume 0 != init_~r453~0#1 % 256;init_~tmp___54~0#1 := 1; 1532#L2237 init_~r454~0#1 := (if 0 == init_~tmp___54~0#1 then 0 else 1); 1996#L2247 assume 0 != init_~r513~0#1 % 256;init_~tmp___55~0#1 := 1; 1979#L2266 init_~r514~0#1 := (if 0 == init_~tmp___55~0#1 then 0 else 1); 1659#L2276 assume 0 != init_~r523~0#1 % 256;init_~tmp___56~0#1 := 1; 1661#L2295 init_~r524~0#1 := (if 0 == init_~tmp___56~0#1 then 0 else 1); 1850#L2305 assume 0 != init_~r533~0#1 % 256;init_~tmp___57~0#1 := 1; 1608#L2324 init_~r534~0#1 := (if 0 == init_~tmp___57~0#1 then 0 else 1); 1829#L2334 assume 0 != init_~r543~0#1 % 256;init_~tmp___58~0#1 := 1; 1481#L2353 init_~r544~0#1 := (if 0 == init_~tmp___58~0#1 then 0 else 1); 1482#L2363 assume !(~id1~0 != ~id2~0);init_~tmp___59~0#1 := 0; 1434#L2363-1 init_#res#1 := init_~tmp___59~0#1; 2080#L2604 main_#t~ret79#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret79#1;havoc main_#t~ret79#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; 2085#L21 assume !(0 == assume_abort_if_not_~cond#1); 1822#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;~p15_old~0 := ~nomsg~0;~p15_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;~p25_old~0 := ~nomsg~0;~p25_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;~p35_old~0 := ~nomsg~0;~p35_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;~p45_old~0 := ~nomsg~0;~p45_new~0 := ~nomsg~0;~p51_old~0 := ~nomsg~0;~p51_new~0 := ~nomsg~0;~p52_old~0 := ~nomsg~0;~p52_new~0 := ~nomsg~0;~p53_old~0 := ~nomsg~0;~p53_new~0 := ~nomsg~0;~p54_old~0 := ~nomsg~0;~p54_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 1823#L2776-2 [2022-02-21 04:27:41,518 INFO L793 eck$LassoCheckResult]: Loop: 1823#L2776-2 assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1, node1_#t~ite7#1; 2035#L148 assume !(0 != ~mode1~0 % 256); 2036#L187 assume !(~r1~0 < 4); 2008#L187-1 ~mode1~0 := 1; 2034#L148-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite8#1, node2_#t~ite9#1, node2_#t~ite10#1, node2_#t~ite11#1; 1970#L211 assume !(0 != ~mode2~0 % 256); 1949#L250 assume !(~r2~0 < 4); 1950#L250-1 ~mode2~0 := 1; 1690#L211-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite12#1, node3_#t~ite13#1, node3_#t~ite14#1, node3_#t~ite15#1; 1691#L274 assume !(0 != ~mode3~0 % 256); 1525#L313 assume !(~r3~0 < 4); 1526#L313-1 ~mode3~0 := 1; 1771#L274-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite16#1, node4_#t~ite17#1, node4_#t~ite18#1, node4_#t~ite19#1; 1926#L337 assume !(0 != ~mode4~0 % 256); 1927#L376 assume !(~r4~0 < 4); 1636#L376-1 ~mode4~0 := 1; 1637#L337-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite20#1, node5_#t~ite21#1, node5_#t~ite22#1, node5_#t~ite23#1; 1774#L400 assume !(0 != ~mode5~0 % 256); 1888#L439 assume !(~r5~0 < 4); 1889#L439-1 ~mode5~0 := 1; 1742#L400-2 assume { :end_inline_node5 } 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;~p15_old~0 := ~p15_new~0;~p15_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;~p25_old~0 := ~p25_new~0;~p25_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;~p35_old~0 := ~p35_new~0;~p35_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;~p45_old~0 := ~p45_new~0;~p45_new~0 := ~nomsg~0;~p51_old~0 := ~p51_new~0;~p51_new~0 := ~nomsg~0;~p52_old~0 := ~p52_new~0;~p52_new~0 := ~nomsg~0;~p53_old~0 := ~p53_new~0;~p53_new~0 := ~nomsg~0;~p54_old~0 := ~p54_new~0;~p54_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 1743#L2612 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 1973#L2613 assume ~st1~0 + ~nl1~0 <= 1; 1734#L2614 assume ~st2~0 + ~nl2~0 <= 1; 1465#L2615 assume ~st3~0 + ~nl3~0 <= 1; 1466#L2616 assume ~st4~0 + ~nl4~0 <= 1; 1861#L2617 assume ~st5~0 + ~nl5~0 <= 1; 2000#L2618 assume ~r1~0 >= 4; 1816#L2622 assume ~r1~0 < 4; 1958#L2627 assume ~r1~0 >= 4; 1435#L2632 assume ~r1~0 < 4;check_~tmp~1#1 := 1; 1436#L2612-1 check_#res#1 := check_~tmp~1#1; 1952#L2668 main_#t~ret80#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret80#1;havoc main_#t~ret80#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; 1954#L2836 assume !(0 == assert_~arg#1 % 256); 1955#L2831 assume { :end_inline_assert } true;main_#t~post81#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post81#1;havoc main_#t~post81#1; 1823#L2776-2 [2022-02-21 04:27:41,519 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:27:41,535 INFO L85 PathProgramCache]: Analyzing trace with hash -1593308194, now seen corresponding path program 2 times [2022-02-21 04:27:41,536 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:27:41,536 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1598251699] [2022-02-21 04:27:41,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:27:41,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:27:41,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:27:41,648 INFO L290 TraceCheckUtils]: 0: Hoare triple {3535#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(40, 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;~p15~0 := 0;~p15_old~0 := 0;~p15_new~0 := 0;~ep15~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;~p25~0 := 0;~p25_old~0 := 0;~p25_new~0 := 0;~ep25~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;~p35~0 := 0;~p35_old~0 := 0;~p35_new~0 := 0;~ep35~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;~p45~0 := 0;~p45_old~0 := 0;~p45_new~0 := 0;~ep45~0 := 0;~p51~0 := 0;~p51_old~0 := 0;~p51_new~0 := 0;~ep51~0 := 0;~p52~0 := 0;~p52_old~0 := 0;~p52_new~0 := 0;~ep52~0 := 0;~p53~0 := 0;~p53_old~0 := 0;~p53_new~0 := 0;~ep53~0 := 0;~p54~0 := 0;~p54_old~0 := 0;~p54_new~0 := 0;~ep54~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~id5~0 := 0;~r5~0 := 0;~st5~0 := 0;~nl5~0 := 0;~m5~0 := 0;~max5~0 := 0;~mode5~0 := 0; {3535#true} is VALID [2022-02-21 04:27:41,649 INFO L290 TraceCheckUtils]: 1: Hoare triple {3535#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet60#1, main_#t~nondet61#1, main_#t~nondet62#1, main_#t~nondet63#1, main_#t~nondet64#1, main_#t~nondet65#1, main_#t~nondet66#1, main_#t~nondet67#1, main_#t~nondet68#1, main_#t~nondet69#1, main_#t~nondet70#1, main_#t~nondet71#1, main_#t~nondet72#1, main_#t~nondet73#1, main_#t~nondet74#1, main_#t~nondet75#1, main_#t~nondet76#1, main_#t~nondet77#1, main_#t~nondet78#1, main_#t~ret79#1, main_#t~ret80#1, main_#t~post81#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~nondet24#1;havoc main_#t~nondet24#1;~ep13~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep14~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep15~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~ep21~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~ep23~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~ep24~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~ep25~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~ep31~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~ep32~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~ep34~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~ep35~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~ep41~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~ep42~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~ep43~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~ep45~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~ep51~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~ep52~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~ep53~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~ep54~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~id1~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~r1~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~st1~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~nl1~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~m1~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~max1~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~mode1~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~id2~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~r2~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~st2~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~nl2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~m2~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;~max2~0 := main_#t~nondet56#1;havoc main_#t~nondet56#1;~mode2~0 := main_#t~nondet57#1;havoc main_#t~nondet57#1;~id3~0 := main_#t~nondet58#1;havoc main_#t~nondet58#1;~r3~0 := main_#t~nondet59#1;havoc main_#t~nondet59#1;~st3~0 := main_#t~nondet60#1;havoc main_#t~nondet60#1;~nl3~0 := main_#t~nondet61#1;havoc main_#t~nondet61#1;~m3~0 := main_#t~nondet62#1;havoc main_#t~nondet62#1;~max3~0 := main_#t~nondet63#1;havoc main_#t~nondet63#1;~mode3~0 := main_#t~nondet64#1;havoc main_#t~nondet64#1;~id4~0 := main_#t~nondet65#1;havoc main_#t~nondet65#1;~r4~0 := main_#t~nondet66#1;havoc main_#t~nondet66#1;~st4~0 := main_#t~nondet67#1;havoc main_#t~nondet67#1;~nl4~0 := main_#t~nondet68#1;havoc main_#t~nondet68#1;~m4~0 := main_#t~nondet69#1;havoc main_#t~nondet69#1;~max4~0 := main_#t~nondet70#1;havoc main_#t~nondet70#1;~mode4~0 := main_#t~nondet71#1;havoc main_#t~nondet71#1;~id5~0 := main_#t~nondet72#1;havoc main_#t~nondet72#1;~r5~0 := main_#t~nondet73#1;havoc main_#t~nondet73#1;~st5~0 := main_#t~nondet74#1;havoc main_#t~nondet74#1;~nl5~0 := main_#t~nondet75#1;havoc main_#t~nondet75#1;~m5~0 := main_#t~nondet76#1;havoc main_#t~nondet76#1;~max5~0 := main_#t~nondet77#1;havoc main_#t~nondet77#1;~mode5~0 := main_#t~nondet78#1;havoc main_#t~nondet78#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r151~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r251~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r351~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r451~0#1, init_~r511~0#1, init_~r521~0#1, init_~r531~0#1, init_~r541~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_~r152~0#1, init_~tmp___2~0#1, init_~r212~0#1, init_~tmp___3~0#1, init_~r232~0#1, init_~tmp___4~0#1, init_~r242~0#1, init_~tmp___5~0#1, init_~r252~0#1, init_~tmp___6~0#1, init_~r312~0#1, init_~tmp___7~0#1, init_~r322~0#1, init_~tmp___8~0#1, init_~r342~0#1, init_~tmp___9~0#1, init_~r352~0#1, init_~tmp___10~0#1, init_~r412~0#1, init_~tmp___11~0#1, init_~r422~0#1, init_~tmp___12~0#1, init_~r432~0#1, init_~tmp___13~0#1, init_~r452~0#1, init_~tmp___14~0#1, init_~r512~0#1, init_~tmp___15~0#1, init_~r522~0#1, init_~tmp___16~0#1, init_~r532~0#1, init_~tmp___17~0#1, init_~r542~0#1, init_~tmp___18~0#1, init_~r123~0#1, init_~tmp___19~0#1, init_~r133~0#1, init_~tmp___20~0#1, init_~r143~0#1, init_~tmp___21~0#1, init_~r153~0#1, init_~tmp___22~0#1, init_~r213~0#1, init_~tmp___23~0#1, init_~r233~0#1, init_~tmp___24~0#1, init_~r243~0#1, init_~tmp___25~0#1, init_~r253~0#1, init_~tmp___26~0#1, init_~r313~0#1, init_~tmp___27~0#1, init_~r323~0#1, init_~tmp___28~0#1, init_~r343~0#1, init_~tmp___29~0#1, init_~r353~0#1, init_~tmp___30~0#1, init_~r413~0#1, init_~tmp___31~0#1, init_~r423~0#1, init_~tmp___32~0#1, init_~r433~0#1, init_~tmp___33~0#1, init_~r453~0#1, init_~tmp___34~0#1, init_~r513~0#1, init_~tmp___35~0#1, init_~r523~0#1, init_~tmp___36~0#1, init_~r533~0#1, init_~tmp___37~0#1, init_~r543~0#1, init_~tmp___38~0#1, init_~r124~0#1, init_~tmp___39~0#1, init_~r134~0#1, init_~tmp___40~0#1, init_~r144~0#1, init_~tmp___41~0#1, init_~r154~0#1, init_~tmp___42~0#1, init_~r214~0#1, init_~tmp___43~0#1, init_~r234~0#1, init_~tmp___44~0#1, init_~r244~0#1, init_~tmp___45~0#1, init_~r254~0#1, init_~tmp___46~0#1, init_~r314~0#1, init_~tmp___47~0#1, init_~r324~0#1, init_~tmp___48~0#1, init_~r344~0#1, init_~tmp___49~0#1, init_~r354~0#1, init_~tmp___50~0#1, init_~r414~0#1, init_~tmp___51~0#1, init_~r424~0#1, init_~tmp___52~0#1, init_~r434~0#1, init_~tmp___53~0#1, init_~r454~0#1, init_~tmp___54~0#1, init_~r514~0#1, init_~tmp___55~0#1, init_~r524~0#1, init_~tmp___56~0#1, init_~r534~0#1, init_~tmp___57~0#1, init_~r544~0#1, init_~tmp___58~0#1, init_~tmp___59~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r151~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r251~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r351~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r451~0#1;havoc init_~r511~0#1;havoc init_~r521~0#1;havoc init_~r531~0#1;havoc init_~r541~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_~r152~0#1;havoc init_~tmp___2~0#1;havoc init_~r212~0#1;havoc init_~tmp___3~0#1;havoc init_~r232~0#1;havoc init_~tmp___4~0#1;havoc init_~r242~0#1;havoc init_~tmp___5~0#1;havoc init_~r252~0#1;havoc init_~tmp___6~0#1;havoc init_~r312~0#1;havoc init_~tmp___7~0#1;havoc init_~r322~0#1;havoc init_~tmp___8~0#1;havoc init_~r342~0#1;havoc init_~tmp___9~0#1;havoc init_~r352~0#1;havoc init_~tmp___10~0#1;havoc init_~r412~0#1;havoc init_~tmp___11~0#1;havoc init_~r422~0#1;havoc init_~tmp___12~0#1;havoc init_~r432~0#1;havoc init_~tmp___13~0#1;havoc init_~r452~0#1;havoc init_~tmp___14~0#1;havoc init_~r512~0#1;havoc init_~tmp___15~0#1;havoc init_~r522~0#1;havoc init_~tmp___16~0#1;havoc init_~r532~0#1;havoc init_~tmp___17~0#1;havoc init_~r542~0#1;havoc init_~tmp___18~0#1;havoc init_~r123~0#1;havoc init_~tmp___19~0#1;havoc init_~r133~0#1;havoc init_~tmp___20~0#1;havoc init_~r143~0#1;havoc init_~tmp___21~0#1;havoc init_~r153~0#1;havoc init_~tmp___22~0#1;havoc init_~r213~0#1;havoc init_~tmp___23~0#1;havoc init_~r233~0#1;havoc init_~tmp___24~0#1;havoc init_~r243~0#1;havoc init_~tmp___25~0#1;havoc init_~r253~0#1;havoc init_~tmp___26~0#1;havoc init_~r313~0#1;havoc init_~tmp___27~0#1;havoc init_~r323~0#1;havoc init_~tmp___28~0#1;havoc init_~r343~0#1;havoc init_~tmp___29~0#1;havoc init_~r353~0#1;havoc init_~tmp___30~0#1;havoc init_~r413~0#1;havoc init_~tmp___31~0#1;havoc init_~r423~0#1;havoc init_~tmp___32~0#1;havoc init_~r433~0#1;havoc init_~tmp___33~0#1;havoc init_~r453~0#1;havoc init_~tmp___34~0#1;havoc init_~r513~0#1;havoc init_~tmp___35~0#1;havoc init_~r523~0#1;havoc init_~tmp___36~0#1;havoc init_~r533~0#1;havoc init_~tmp___37~0#1;havoc init_~r543~0#1;havoc init_~tmp___38~0#1;havoc init_~r124~0#1;havoc init_~tmp___39~0#1;havoc init_~r134~0#1;havoc init_~tmp___40~0#1;havoc init_~r144~0#1;havoc init_~tmp___41~0#1;havoc init_~r154~0#1;havoc init_~tmp___42~0#1;havoc init_~r214~0#1;havoc init_~tmp___43~0#1;havoc init_~r234~0#1;havoc init_~tmp___44~0#1;havoc init_~r244~0#1;havoc init_~tmp___45~0#1;havoc init_~r254~0#1;havoc init_~tmp___46~0#1;havoc init_~r314~0#1;havoc init_~tmp___47~0#1;havoc init_~r324~0#1;havoc init_~tmp___48~0#1;havoc init_~r344~0#1;havoc init_~tmp___49~0#1;havoc init_~r354~0#1;havoc init_~tmp___50~0#1;havoc init_~r414~0#1;havoc init_~tmp___51~0#1;havoc init_~r424~0#1;havoc init_~tmp___52~0#1;havoc init_~r434~0#1;havoc init_~tmp___53~0#1;havoc init_~r454~0#1;havoc init_~tmp___54~0#1;havoc init_~r514~0#1;havoc init_~tmp___55~0#1;havoc init_~r524~0#1;havoc init_~tmp___56~0#1;havoc init_~r534~0#1;havoc init_~tmp___57~0#1;havoc init_~r544~0#1;havoc init_~tmp___58~0#1;havoc init_~tmp___59~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r151~0#1 := ~ep15~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r251~0#1 := ~ep25~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r351~0#1 := ~ep35~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0;init_~r451~0#1 := ~ep45~0;init_~r511~0#1 := ~ep51~0;init_~r521~0#1 := ~ep52~0;init_~r531~0#1 := ~ep53~0;init_~r541~0#1 := ~ep54~0; {3535#true} is VALID [2022-02-21 04:27:41,649 INFO L290 TraceCheckUtils]: 2: Hoare triple {3535#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,649 INFO L290 TraceCheckUtils]: 3: Hoare triple {3535#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,649 INFO L290 TraceCheckUtils]: 4: Hoare triple {3535#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,649 INFO L290 TraceCheckUtils]: 5: Hoare triple {3535#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,650 INFO L290 TraceCheckUtils]: 6: Hoare triple {3535#true} assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {3535#true} init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,650 INFO L290 TraceCheckUtils]: 8: Hoare triple {3535#true} assume 0 != init_~r151~0#1 % 256;init_~tmp___2~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,650 INFO L290 TraceCheckUtils]: 9: Hoare triple {3535#true} init_~r152~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,650 INFO L290 TraceCheckUtils]: 10: Hoare triple {3535#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___3~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,650 INFO L290 TraceCheckUtils]: 11: Hoare triple {3535#true} init_~r212~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,651 INFO L290 TraceCheckUtils]: 12: Hoare triple {3535#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___4~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,651 INFO L290 TraceCheckUtils]: 13: Hoare triple {3535#true} init_~r232~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,651 INFO L290 TraceCheckUtils]: 14: Hoare triple {3535#true} assume 0 != init_~r241~0#1 % 256;init_~tmp___5~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,651 INFO L290 TraceCheckUtils]: 15: Hoare triple {3535#true} init_~r242~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,651 INFO L290 TraceCheckUtils]: 16: Hoare triple {3535#true} assume 0 != init_~r251~0#1 % 256;init_~tmp___6~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,651 INFO L290 TraceCheckUtils]: 17: Hoare triple {3535#true} init_~r252~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,651 INFO L290 TraceCheckUtils]: 18: Hoare triple {3535#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___7~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,652 INFO L290 TraceCheckUtils]: 19: Hoare triple {3535#true} init_~r312~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,652 INFO L290 TraceCheckUtils]: 20: Hoare triple {3535#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___8~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,652 INFO L290 TraceCheckUtils]: 21: Hoare triple {3535#true} init_~r322~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,652 INFO L290 TraceCheckUtils]: 22: Hoare triple {3535#true} assume 0 != init_~r341~0#1 % 256;init_~tmp___9~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,652 INFO L290 TraceCheckUtils]: 23: Hoare triple {3535#true} init_~r342~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,652 INFO L290 TraceCheckUtils]: 24: Hoare triple {3535#true} assume 0 != init_~r351~0#1 % 256;init_~tmp___10~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,652 INFO L290 TraceCheckUtils]: 25: Hoare triple {3535#true} init_~r352~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,653 INFO L290 TraceCheckUtils]: 26: Hoare triple {3535#true} assume 0 != init_~r411~0#1 % 256;init_~tmp___11~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,653 INFO L290 TraceCheckUtils]: 27: Hoare triple {3535#true} init_~r412~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,653 INFO L290 TraceCheckUtils]: 28: Hoare triple {3535#true} assume 0 != init_~r421~0#1 % 256;init_~tmp___12~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,653 INFO L290 TraceCheckUtils]: 29: Hoare triple {3535#true} init_~r422~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,653 INFO L290 TraceCheckUtils]: 30: Hoare triple {3535#true} assume 0 != init_~r431~0#1 % 256;init_~tmp___13~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,653 INFO L290 TraceCheckUtils]: 31: Hoare triple {3535#true} init_~r432~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,654 INFO L290 TraceCheckUtils]: 32: Hoare triple {3535#true} assume 0 != init_~r451~0#1 % 256;init_~tmp___14~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,654 INFO L290 TraceCheckUtils]: 33: Hoare triple {3535#true} init_~r452~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,654 INFO L290 TraceCheckUtils]: 34: Hoare triple {3535#true} assume 0 != init_~r511~0#1 % 256;init_~tmp___15~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,654 INFO L290 TraceCheckUtils]: 35: Hoare triple {3535#true} init_~r512~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,654 INFO L290 TraceCheckUtils]: 36: Hoare triple {3535#true} assume 0 != init_~r521~0#1 % 256;init_~tmp___16~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,654 INFO L290 TraceCheckUtils]: 37: Hoare triple {3535#true} init_~r522~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,654 INFO L290 TraceCheckUtils]: 38: Hoare triple {3535#true} assume 0 != init_~r531~0#1 % 256;init_~tmp___17~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,655 INFO L290 TraceCheckUtils]: 39: Hoare triple {3535#true} init_~r532~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,655 INFO L290 TraceCheckUtils]: 40: Hoare triple {3535#true} assume 0 != init_~r541~0#1 % 256;init_~tmp___18~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,655 INFO L290 TraceCheckUtils]: 41: Hoare triple {3535#true} init_~r542~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,655 INFO L290 TraceCheckUtils]: 42: Hoare triple {3535#true} assume 0 != init_~r122~0#1 % 256;init_~tmp___19~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,655 INFO L290 TraceCheckUtils]: 43: Hoare triple {3535#true} init_~r123~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,655 INFO L290 TraceCheckUtils]: 44: Hoare triple {3535#true} assume 0 != init_~r132~0#1 % 256;init_~tmp___20~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,656 INFO L290 TraceCheckUtils]: 45: Hoare triple {3535#true} init_~r133~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,656 INFO L290 TraceCheckUtils]: 46: Hoare triple {3535#true} assume 0 != init_~r142~0#1 % 256;init_~tmp___21~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,656 INFO L290 TraceCheckUtils]: 47: Hoare triple {3535#true} init_~r143~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,656 INFO L290 TraceCheckUtils]: 48: Hoare triple {3535#true} assume 0 != init_~r152~0#1 % 256;init_~tmp___22~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,656 INFO L290 TraceCheckUtils]: 49: Hoare triple {3535#true} init_~r153~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,656 INFO L290 TraceCheckUtils]: 50: Hoare triple {3535#true} assume 0 != init_~r212~0#1 % 256;init_~tmp___23~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,657 INFO L290 TraceCheckUtils]: 51: Hoare triple {3535#true} init_~r213~0#1 := (if 0 == init_~tmp___23~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,657 INFO L290 TraceCheckUtils]: 52: Hoare triple {3535#true} assume 0 != init_~r232~0#1 % 256;init_~tmp___24~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,657 INFO L290 TraceCheckUtils]: 53: Hoare triple {3535#true} init_~r233~0#1 := (if 0 == init_~tmp___24~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,657 INFO L290 TraceCheckUtils]: 54: Hoare triple {3535#true} assume 0 != init_~r242~0#1 % 256;init_~tmp___25~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,657 INFO L290 TraceCheckUtils]: 55: Hoare triple {3535#true} init_~r243~0#1 := (if 0 == init_~tmp___25~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,657 INFO L290 TraceCheckUtils]: 56: Hoare triple {3535#true} assume 0 != init_~r252~0#1 % 256;init_~tmp___26~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,658 INFO L290 TraceCheckUtils]: 57: Hoare triple {3535#true} init_~r253~0#1 := (if 0 == init_~tmp___26~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,658 INFO L290 TraceCheckUtils]: 58: Hoare triple {3535#true} assume 0 != init_~r312~0#1 % 256;init_~tmp___27~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,658 INFO L290 TraceCheckUtils]: 59: Hoare triple {3535#true} init_~r313~0#1 := (if 0 == init_~tmp___27~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,658 INFO L290 TraceCheckUtils]: 60: Hoare triple {3535#true} assume 0 != init_~r322~0#1 % 256;init_~tmp___28~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,658 INFO L290 TraceCheckUtils]: 61: Hoare triple {3535#true} init_~r323~0#1 := (if 0 == init_~tmp___28~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,658 INFO L290 TraceCheckUtils]: 62: Hoare triple {3535#true} assume 0 != init_~r342~0#1 % 256;init_~tmp___29~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,658 INFO L290 TraceCheckUtils]: 63: Hoare triple {3535#true} init_~r343~0#1 := (if 0 == init_~tmp___29~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,659 INFO L290 TraceCheckUtils]: 64: Hoare triple {3535#true} assume 0 != init_~r352~0#1 % 256;init_~tmp___30~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,659 INFO L290 TraceCheckUtils]: 65: Hoare triple {3535#true} init_~r353~0#1 := (if 0 == init_~tmp___30~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,659 INFO L290 TraceCheckUtils]: 66: Hoare triple {3535#true} assume 0 != init_~r412~0#1 % 256;init_~tmp___31~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,659 INFO L290 TraceCheckUtils]: 67: Hoare triple {3535#true} init_~r413~0#1 := (if 0 == init_~tmp___31~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,659 INFO L290 TraceCheckUtils]: 68: Hoare triple {3535#true} assume 0 != init_~r422~0#1 % 256;init_~tmp___32~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,659 INFO L290 TraceCheckUtils]: 69: Hoare triple {3535#true} init_~r423~0#1 := (if 0 == init_~tmp___32~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,659 INFO L290 TraceCheckUtils]: 70: Hoare triple {3535#true} assume 0 != init_~r432~0#1 % 256;init_~tmp___33~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,660 INFO L290 TraceCheckUtils]: 71: Hoare triple {3535#true} init_~r433~0#1 := (if 0 == init_~tmp___33~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,660 INFO L290 TraceCheckUtils]: 72: Hoare triple {3535#true} assume 0 != init_~r452~0#1 % 256;init_~tmp___34~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,660 INFO L290 TraceCheckUtils]: 73: Hoare triple {3535#true} init_~r453~0#1 := (if 0 == init_~tmp___34~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,660 INFO L290 TraceCheckUtils]: 74: Hoare triple {3535#true} assume 0 != init_~r512~0#1 % 256;init_~tmp___35~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,660 INFO L290 TraceCheckUtils]: 75: Hoare triple {3535#true} init_~r513~0#1 := (if 0 == init_~tmp___35~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,660 INFO L290 TraceCheckUtils]: 76: Hoare triple {3535#true} assume 0 != init_~r522~0#1 % 256;init_~tmp___36~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,660 INFO L290 TraceCheckUtils]: 77: Hoare triple {3535#true} init_~r523~0#1 := (if 0 == init_~tmp___36~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,661 INFO L290 TraceCheckUtils]: 78: Hoare triple {3535#true} assume 0 != init_~r532~0#1 % 256;init_~tmp___37~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,661 INFO L290 TraceCheckUtils]: 79: Hoare triple {3535#true} init_~r533~0#1 := (if 0 == init_~tmp___37~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,661 INFO L290 TraceCheckUtils]: 80: Hoare triple {3535#true} assume 0 != init_~r542~0#1 % 256;init_~tmp___38~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,661 INFO L290 TraceCheckUtils]: 81: Hoare triple {3535#true} init_~r543~0#1 := (if 0 == init_~tmp___38~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,661 INFO L290 TraceCheckUtils]: 82: Hoare triple {3535#true} assume 0 != init_~r123~0#1 % 256;init_~tmp___39~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,661 INFO L290 TraceCheckUtils]: 83: Hoare triple {3535#true} init_~r124~0#1 := (if 0 == init_~tmp___39~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,661 INFO L290 TraceCheckUtils]: 84: Hoare triple {3535#true} assume 0 != init_~r133~0#1 % 256;init_~tmp___40~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,662 INFO L290 TraceCheckUtils]: 85: Hoare triple {3535#true} init_~r134~0#1 := (if 0 == init_~tmp___40~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,662 INFO L290 TraceCheckUtils]: 86: Hoare triple {3535#true} assume 0 != init_~r143~0#1 % 256;init_~tmp___41~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,662 INFO L290 TraceCheckUtils]: 87: Hoare triple {3535#true} init_~r144~0#1 := (if 0 == init_~tmp___41~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,662 INFO L290 TraceCheckUtils]: 88: Hoare triple {3535#true} assume 0 != init_~r153~0#1 % 256;init_~tmp___42~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,662 INFO L290 TraceCheckUtils]: 89: Hoare triple {3535#true} init_~r154~0#1 := (if 0 == init_~tmp___42~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,662 INFO L290 TraceCheckUtils]: 90: Hoare triple {3535#true} assume 0 != init_~r213~0#1 % 256;init_~tmp___43~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,663 INFO L290 TraceCheckUtils]: 91: Hoare triple {3535#true} init_~r214~0#1 := (if 0 == init_~tmp___43~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,663 INFO L290 TraceCheckUtils]: 92: Hoare triple {3535#true} assume 0 != init_~r233~0#1 % 256;init_~tmp___44~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,663 INFO L290 TraceCheckUtils]: 93: Hoare triple {3535#true} init_~r234~0#1 := (if 0 == init_~tmp___44~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,663 INFO L290 TraceCheckUtils]: 94: Hoare triple {3535#true} assume 0 != init_~r243~0#1 % 256;init_~tmp___45~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,663 INFO L290 TraceCheckUtils]: 95: Hoare triple {3535#true} init_~r244~0#1 := (if 0 == init_~tmp___45~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,663 INFO L290 TraceCheckUtils]: 96: Hoare triple {3535#true} assume 0 != init_~r253~0#1 % 256;init_~tmp___46~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,663 INFO L290 TraceCheckUtils]: 97: Hoare triple {3535#true} init_~r254~0#1 := (if 0 == init_~tmp___46~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,664 INFO L290 TraceCheckUtils]: 98: Hoare triple {3535#true} assume 0 != init_~r313~0#1 % 256;init_~tmp___47~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,664 INFO L290 TraceCheckUtils]: 99: Hoare triple {3535#true} init_~r314~0#1 := (if 0 == init_~tmp___47~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,664 INFO L290 TraceCheckUtils]: 100: Hoare triple {3535#true} assume 0 != init_~r323~0#1 % 256;init_~tmp___48~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,664 INFO L290 TraceCheckUtils]: 101: Hoare triple {3535#true} init_~r324~0#1 := (if 0 == init_~tmp___48~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,664 INFO L290 TraceCheckUtils]: 102: Hoare triple {3535#true} assume 0 != init_~r343~0#1 % 256;init_~tmp___49~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,664 INFO L290 TraceCheckUtils]: 103: Hoare triple {3535#true} init_~r344~0#1 := (if 0 == init_~tmp___49~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,664 INFO L290 TraceCheckUtils]: 104: Hoare triple {3535#true} assume 0 != init_~r353~0#1 % 256;init_~tmp___50~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,665 INFO L290 TraceCheckUtils]: 105: Hoare triple {3535#true} init_~r354~0#1 := (if 0 == init_~tmp___50~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,665 INFO L290 TraceCheckUtils]: 106: Hoare triple {3535#true} assume 0 != init_~r413~0#1 % 256;init_~tmp___51~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,665 INFO L290 TraceCheckUtils]: 107: Hoare triple {3535#true} init_~r414~0#1 := (if 0 == init_~tmp___51~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,665 INFO L290 TraceCheckUtils]: 108: Hoare triple {3535#true} assume 0 != init_~r423~0#1 % 256;init_~tmp___52~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,665 INFO L290 TraceCheckUtils]: 109: Hoare triple {3535#true} init_~r424~0#1 := (if 0 == init_~tmp___52~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,665 INFO L290 TraceCheckUtils]: 110: Hoare triple {3535#true} assume 0 != init_~r433~0#1 % 256;init_~tmp___53~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,665 INFO L290 TraceCheckUtils]: 111: Hoare triple {3535#true} init_~r434~0#1 := (if 0 == init_~tmp___53~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,666 INFO L290 TraceCheckUtils]: 112: Hoare triple {3535#true} assume 0 != init_~r453~0#1 % 256;init_~tmp___54~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,666 INFO L290 TraceCheckUtils]: 113: Hoare triple {3535#true} init_~r454~0#1 := (if 0 == init_~tmp___54~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,666 INFO L290 TraceCheckUtils]: 114: Hoare triple {3535#true} assume 0 != init_~r513~0#1 % 256;init_~tmp___55~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,666 INFO L290 TraceCheckUtils]: 115: Hoare triple {3535#true} init_~r514~0#1 := (if 0 == init_~tmp___55~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,666 INFO L290 TraceCheckUtils]: 116: Hoare triple {3535#true} assume 0 != init_~r523~0#1 % 256;init_~tmp___56~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,666 INFO L290 TraceCheckUtils]: 117: Hoare triple {3535#true} init_~r524~0#1 := (if 0 == init_~tmp___56~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,666 INFO L290 TraceCheckUtils]: 118: Hoare triple {3535#true} assume 0 != init_~r533~0#1 % 256;init_~tmp___57~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,667 INFO L290 TraceCheckUtils]: 119: Hoare triple {3535#true} init_~r534~0#1 := (if 0 == init_~tmp___57~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,667 INFO L290 TraceCheckUtils]: 120: Hoare triple {3535#true} assume 0 != init_~r543~0#1 % 256;init_~tmp___58~0#1 := 1; {3535#true} is VALID [2022-02-21 04:27:41,667 INFO L290 TraceCheckUtils]: 121: Hoare triple {3535#true} init_~r544~0#1 := (if 0 == init_~tmp___58~0#1 then 0 else 1); {3535#true} is VALID [2022-02-21 04:27:41,667 INFO L290 TraceCheckUtils]: 122: Hoare triple {3535#true} assume !(~id1~0 != ~id2~0);init_~tmp___59~0#1 := 0; {3537#(= |ULTIMATE.start_init_~tmp___59~0#1| 0)} is VALID [2022-02-21 04:27:41,668 INFO L290 TraceCheckUtils]: 123: Hoare triple {3537#(= |ULTIMATE.start_init_~tmp___59~0#1| 0)} init_#res#1 := init_~tmp___59~0#1; {3538#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:27:41,668 INFO L290 TraceCheckUtils]: 124: Hoare triple {3538#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret79#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret79#1;havoc main_#t~ret79#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; {3539#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:27:41,669 INFO L290 TraceCheckUtils]: 125: Hoare triple {3539#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {3536#false} is VALID [2022-02-21 04:27:41,669 INFO L290 TraceCheckUtils]: 126: Hoare triple {3536#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;~p15_old~0 := ~nomsg~0;~p15_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;~p25_old~0 := ~nomsg~0;~p25_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;~p35_old~0 := ~nomsg~0;~p35_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;~p45_old~0 := ~nomsg~0;~p45_new~0 := ~nomsg~0;~p51_old~0 := ~nomsg~0;~p51_new~0 := ~nomsg~0;~p52_old~0 := ~nomsg~0;~p52_new~0 := ~nomsg~0;~p53_old~0 := ~nomsg~0;~p53_new~0 := ~nomsg~0;~p54_old~0 := ~nomsg~0;~p54_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {3536#false} is VALID [2022-02-21 04:27:41,669 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:27:41,669 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:27:41,670 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1598251699] [2022-02-21 04:27:41,670 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1598251699] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:27:41,670 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:27:41,670 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:27:41,670 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1206349916] [2022-02-21 04:27:41,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:27:41,671 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:27:41,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:27:41,671 INFO L85 PathProgramCache]: Analyzing trace with hash 1856582015, now seen corresponding path program 1 times [2022-02-21 04:27:41,671 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:27:41,671 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1160557568] [2022-02-21 04:27:41,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:27:41,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:27:41,682 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:27:41,696 INFO L290 TraceCheckUtils]: 0: Hoare triple {3540#true} assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1, node1_#t~ite7#1; {3540#true} is VALID [2022-02-21 04:27:41,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {3540#true} assume !(0 != ~mode1~0 % 256); {3540#true} is VALID [2022-02-21 04:27:41,697 INFO L290 TraceCheckUtils]: 2: Hoare triple {3540#true} assume !(~r1~0 < 4); {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:41,697 INFO L290 TraceCheckUtils]: 3: Hoare triple {3542#(not (<= ~r1~0 3))} ~mode1~0 := 1; {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:41,697 INFO L290 TraceCheckUtils]: 4: Hoare triple {3542#(not (<= ~r1~0 3))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite8#1, node2_#t~ite9#1, node2_#t~ite10#1, node2_#t~ite11#1; {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:41,698 INFO L290 TraceCheckUtils]: 5: Hoare triple {3542#(not (<= ~r1~0 3))} assume !(0 != ~mode2~0 % 256); {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:41,698 INFO L290 TraceCheckUtils]: 6: Hoare triple {3542#(not (<= ~r1~0 3))} assume !(~r2~0 < 4); {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:41,699 INFO L290 TraceCheckUtils]: 7: Hoare triple {3542#(not (<= ~r1~0 3))} ~mode2~0 := 1; {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:41,699 INFO L290 TraceCheckUtils]: 8: Hoare triple {3542#(not (<= ~r1~0 3))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite12#1, node3_#t~ite13#1, node3_#t~ite14#1, node3_#t~ite15#1; {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:41,699 INFO L290 TraceCheckUtils]: 9: Hoare triple {3542#(not (<= ~r1~0 3))} assume !(0 != ~mode3~0 % 256); {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:41,700 INFO L290 TraceCheckUtils]: 10: Hoare triple {3542#(not (<= ~r1~0 3))} assume !(~r3~0 < 4); {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:41,700 INFO L290 TraceCheckUtils]: 11: Hoare triple {3542#(not (<= ~r1~0 3))} ~mode3~0 := 1; {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:41,701 INFO L290 TraceCheckUtils]: 12: Hoare triple {3542#(not (<= ~r1~0 3))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite16#1, node4_#t~ite17#1, node4_#t~ite18#1, node4_#t~ite19#1; {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:41,701 INFO L290 TraceCheckUtils]: 13: Hoare triple {3542#(not (<= ~r1~0 3))} assume !(0 != ~mode4~0 % 256); {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:41,701 INFO L290 TraceCheckUtils]: 14: Hoare triple {3542#(not (<= ~r1~0 3))} assume !(~r4~0 < 4); {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:41,702 INFO L290 TraceCheckUtils]: 15: Hoare triple {3542#(not (<= ~r1~0 3))} ~mode4~0 := 1; {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:41,702 INFO L290 TraceCheckUtils]: 16: Hoare triple {3542#(not (<= ~r1~0 3))} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite20#1, node5_#t~ite21#1, node5_#t~ite22#1, node5_#t~ite23#1; {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:41,703 INFO L290 TraceCheckUtils]: 17: Hoare triple {3542#(not (<= ~r1~0 3))} assume !(0 != ~mode5~0 % 256); {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:41,703 INFO L290 TraceCheckUtils]: 18: Hoare triple {3542#(not (<= ~r1~0 3))} assume !(~r5~0 < 4); {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:41,703 INFO L290 TraceCheckUtils]: 19: Hoare triple {3542#(not (<= ~r1~0 3))} ~mode5~0 := 1; {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:41,704 INFO L290 TraceCheckUtils]: 20: Hoare triple {3542#(not (<= ~r1~0 3))} assume { :end_inline_node5 } 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;~p15_old~0 := ~p15_new~0;~p15_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;~p25_old~0 := ~p25_new~0;~p25_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;~p35_old~0 := ~p35_new~0;~p35_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;~p45_old~0 := ~p45_new~0;~p45_new~0 := ~nomsg~0;~p51_old~0 := ~p51_new~0;~p51_new~0 := ~nomsg~0;~p52_old~0 := ~p52_new~0;~p52_new~0 := ~nomsg~0;~p53_old~0 := ~p53_new~0;~p53_new~0 := ~nomsg~0;~p54_old~0 := ~p54_new~0;~p54_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:41,704 INFO L290 TraceCheckUtils]: 21: Hoare triple {3542#(not (<= ~r1~0 3))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:41,705 INFO L290 TraceCheckUtils]: 22: Hoare triple {3542#(not (<= ~r1~0 3))} assume ~st1~0 + ~nl1~0 <= 1; {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:41,706 INFO L290 TraceCheckUtils]: 23: Hoare triple {3542#(not (<= ~r1~0 3))} assume ~st2~0 + ~nl2~0 <= 1; {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:41,706 INFO L290 TraceCheckUtils]: 24: Hoare triple {3542#(not (<= ~r1~0 3))} assume ~st3~0 + ~nl3~0 <= 1; {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:41,707 INFO L290 TraceCheckUtils]: 25: Hoare triple {3542#(not (<= ~r1~0 3))} assume ~st4~0 + ~nl4~0 <= 1; {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:41,708 INFO L290 TraceCheckUtils]: 26: Hoare triple {3542#(not (<= ~r1~0 3))} assume ~st5~0 + ~nl5~0 <= 1; {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:41,709 INFO L290 TraceCheckUtils]: 27: Hoare triple {3542#(not (<= ~r1~0 3))} assume ~r1~0 >= 4; {3542#(not (<= ~r1~0 3))} is VALID [2022-02-21 04:27:41,709 INFO L290 TraceCheckUtils]: 28: Hoare triple {3542#(not (<= ~r1~0 3))} assume ~r1~0 < 4; {3541#false} is VALID [2022-02-21 04:27:41,709 INFO L290 TraceCheckUtils]: 29: Hoare triple {3541#false} assume ~r1~0 >= 4; {3541#false} is VALID [2022-02-21 04:27:41,709 INFO L290 TraceCheckUtils]: 30: Hoare triple {3541#false} assume ~r1~0 < 4;check_~tmp~1#1 := 1; {3541#false} is VALID [2022-02-21 04:27:41,710 INFO L290 TraceCheckUtils]: 31: Hoare triple {3541#false} check_#res#1 := check_~tmp~1#1; {3541#false} is VALID [2022-02-21 04:27:41,710 INFO L290 TraceCheckUtils]: 32: Hoare triple {3541#false} main_#t~ret80#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret80#1;havoc main_#t~ret80#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; {3541#false} is VALID [2022-02-21 04:27:41,710 INFO L290 TraceCheckUtils]: 33: Hoare triple {3541#false} assume !(0 == assert_~arg#1 % 256); {3541#false} is VALID [2022-02-21 04:27:41,710 INFO L290 TraceCheckUtils]: 34: Hoare triple {3541#false} assume { :end_inline_assert } true;main_#t~post81#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post81#1;havoc main_#t~post81#1; {3541#false} is VALID [2022-02-21 04:27:41,711 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:27:41,711 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:27:41,711 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1160557568] [2022-02-21 04:27:41,711 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1160557568] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:27:41,711 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:27:41,712 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:27:41,712 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [496481192] [2022-02-21 04:27:41,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:27:41,712 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:27:41,712 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:27:41,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:27:41,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:27:41,714 INFO L87 Difference]: Start difference. First operand 700 states and 1284 transitions. cyclomatic complexity: 585 Second operand has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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:27:42,813 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:27:42,814 INFO L93 Difference]: Finished difference Result 828 states and 1493 transitions. [2022-02-21 04:27:42,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:27:42,814 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 11.666666666666666) internal successors, (35), 3 states have internal predecessors, (35), 0 states have call successors, (0), 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:27:42,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:27:42,842 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 828 states and 1493 transitions. [2022-02-21 04:27:42,878 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 282 [2022-02-21 04:27:42,906 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 828 states to 828 states and 1493 transitions. [2022-02-21 04:27:42,907 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 828 [2022-02-21 04:27:42,908 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 828 [2022-02-21 04:27:42,908 INFO L73 IsDeterministic]: Start isDeterministic. Operand 828 states and 1493 transitions. [2022-02-21 04:27:42,908 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:27:42,909 INFO L681 BuchiCegarLoop]: Abstraction has 828 states and 1493 transitions. [2022-02-21 04:27:42,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states and 1493 transitions. [2022-02-21 04:27:42,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 828. [2022-02-21 04:27:42,937 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:27:42,939 INFO L82 GeneralOperation]: Start isEquivalent. First operand 828 states and 1493 transitions. Second operand has 828 states, 828 states have (on average 1.8031400966183575) internal successors, (1493), 827 states have internal predecessors, (1493), 0 states have call successors, (0), 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:27:42,955 INFO L74 IsIncluded]: Start isIncluded. First operand 828 states and 1493 transitions. Second operand has 828 states, 828 states have (on average 1.8031400966183575) internal successors, (1493), 827 states have internal predecessors, (1493), 0 states have call successors, (0), 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:27:42,957 INFO L87 Difference]: Start difference. First operand 828 states and 1493 transitions. Second operand has 828 states, 828 states have (on average 1.8031400966183575) internal successors, (1493), 827 states have internal predecessors, (1493), 0 states have call successors, (0), 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:27:42,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:27:42,986 INFO L93 Difference]: Finished difference Result 828 states and 1493 transitions. [2022-02-21 04:27:42,986 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1493 transitions. [2022-02-21 04:27:42,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:27:42,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:27:42,989 INFO L74 IsIncluded]: Start isIncluded. First operand has 828 states, 828 states have (on average 1.8031400966183575) internal successors, (1493), 827 states have internal predecessors, (1493), 0 states have call successors, (0), 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 828 states and 1493 transitions. [2022-02-21 04:27:42,991 INFO L87 Difference]: Start difference. First operand has 828 states, 828 states have (on average 1.8031400966183575) internal successors, (1493), 827 states have internal predecessors, (1493), 0 states have call successors, (0), 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 828 states and 1493 transitions. [2022-02-21 04:27:43,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:27:43,012 INFO L93 Difference]: Finished difference Result 828 states and 1493 transitions. [2022-02-21 04:27:43,012 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1493 transitions. [2022-02-21 04:27:43,013 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:27:43,014 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:27:43,014 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:27:43,014 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:27:43,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 828 states, 828 states have (on average 1.8031400966183575) internal successors, (1493), 827 states have internal predecessors, (1493), 0 states have call successors, (0), 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:27:43,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 828 states to 828 states and 1493 transitions. [2022-02-21 04:27:43,037 INFO L704 BuchiCegarLoop]: Abstraction has 828 states and 1493 transitions. [2022-02-21 04:27:43,037 INFO L587 BuchiCegarLoop]: Abstraction has 828 states and 1493 transitions. [2022-02-21 04:27:43,037 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:27:43,037 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 828 states and 1493 transitions. [2022-02-21 04:27:43,040 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 282 [2022-02-21 04:27:43,041 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:27:43,041 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:27:43,043 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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:27:43,043 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:27:43,043 INFO L791 eck$LassoCheckResult]: Stem: 5077#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(40, 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;~p15~0 := 0;~p15_old~0 := 0;~p15_new~0 := 0;~ep15~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;~p25~0 := 0;~p25_old~0 := 0;~p25_new~0 := 0;~ep25~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;~p35~0 := 0;~p35_old~0 := 0;~p35_new~0 := 0;~ep35~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;~p45~0 := 0;~p45_old~0 := 0;~p45_new~0 := 0;~ep45~0 := 0;~p51~0 := 0;~p51_old~0 := 0;~p51_new~0 := 0;~ep51~0 := 0;~p52~0 := 0;~p52_old~0 := 0;~p52_new~0 := 0;~ep52~0 := 0;~p53~0 := 0;~p53_old~0 := 0;~p53_new~0 := 0;~ep53~0 := 0;~p54~0 := 0;~p54_old~0 := 0;~p54_new~0 := 0;~ep54~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~id5~0 := 0;~r5~0 := 0;~st5~0 := 0;~nl5~0 := 0;~m5~0 := 0;~max5~0 := 0;~mode5~0 := 0; 5062#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet60#1, main_#t~nondet61#1, main_#t~nondet62#1, main_#t~nondet63#1, main_#t~nondet64#1, main_#t~nondet65#1, main_#t~nondet66#1, main_#t~nondet67#1, main_#t~nondet68#1, main_#t~nondet69#1, main_#t~nondet70#1, main_#t~nondet71#1, main_#t~nondet72#1, main_#t~nondet73#1, main_#t~nondet74#1, main_#t~nondet75#1, main_#t~nondet76#1, main_#t~nondet77#1, main_#t~nondet78#1, main_#t~ret79#1, main_#t~ret80#1, main_#t~post81#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~nondet24#1;havoc main_#t~nondet24#1;~ep13~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep14~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep15~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~ep21~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~ep23~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~ep24~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~ep25~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~ep31~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~ep32~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~ep34~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~ep35~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~ep41~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~ep42~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~ep43~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~ep45~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~ep51~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~ep52~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~ep53~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~ep54~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~id1~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~r1~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~st1~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~nl1~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~m1~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~max1~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~mode1~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~id2~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~r2~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~st2~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~nl2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~m2~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;~max2~0 := main_#t~nondet56#1;havoc main_#t~nondet56#1;~mode2~0 := main_#t~nondet57#1;havoc main_#t~nondet57#1;~id3~0 := main_#t~nondet58#1;havoc main_#t~nondet58#1;~r3~0 := main_#t~nondet59#1;havoc main_#t~nondet59#1;~st3~0 := main_#t~nondet60#1;havoc main_#t~nondet60#1;~nl3~0 := main_#t~nondet61#1;havoc main_#t~nondet61#1;~m3~0 := main_#t~nondet62#1;havoc main_#t~nondet62#1;~max3~0 := main_#t~nondet63#1;havoc main_#t~nondet63#1;~mode3~0 := main_#t~nondet64#1;havoc main_#t~nondet64#1;~id4~0 := main_#t~nondet65#1;havoc main_#t~nondet65#1;~r4~0 := main_#t~nondet66#1;havoc main_#t~nondet66#1;~st4~0 := main_#t~nondet67#1;havoc main_#t~nondet67#1;~nl4~0 := main_#t~nondet68#1;havoc main_#t~nondet68#1;~m4~0 := main_#t~nondet69#1;havoc main_#t~nondet69#1;~max4~0 := main_#t~nondet70#1;havoc main_#t~nondet70#1;~mode4~0 := main_#t~nondet71#1;havoc main_#t~nondet71#1;~id5~0 := main_#t~nondet72#1;havoc main_#t~nondet72#1;~r5~0 := main_#t~nondet73#1;havoc main_#t~nondet73#1;~st5~0 := main_#t~nondet74#1;havoc main_#t~nondet74#1;~nl5~0 := main_#t~nondet75#1;havoc main_#t~nondet75#1;~m5~0 := main_#t~nondet76#1;havoc main_#t~nondet76#1;~max5~0 := main_#t~nondet77#1;havoc main_#t~nondet77#1;~mode5~0 := main_#t~nondet78#1;havoc main_#t~nondet78#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r151~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r251~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r351~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r451~0#1, init_~r511~0#1, init_~r521~0#1, init_~r531~0#1, init_~r541~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_~r152~0#1, init_~tmp___2~0#1, init_~r212~0#1, init_~tmp___3~0#1, init_~r232~0#1, init_~tmp___4~0#1, init_~r242~0#1, init_~tmp___5~0#1, init_~r252~0#1, init_~tmp___6~0#1, init_~r312~0#1, init_~tmp___7~0#1, init_~r322~0#1, init_~tmp___8~0#1, init_~r342~0#1, init_~tmp___9~0#1, init_~r352~0#1, init_~tmp___10~0#1, init_~r412~0#1, init_~tmp___11~0#1, init_~r422~0#1, init_~tmp___12~0#1, init_~r432~0#1, init_~tmp___13~0#1, init_~r452~0#1, init_~tmp___14~0#1, init_~r512~0#1, init_~tmp___15~0#1, init_~r522~0#1, init_~tmp___16~0#1, init_~r532~0#1, init_~tmp___17~0#1, init_~r542~0#1, init_~tmp___18~0#1, init_~r123~0#1, init_~tmp___19~0#1, init_~r133~0#1, init_~tmp___20~0#1, init_~r143~0#1, init_~tmp___21~0#1, init_~r153~0#1, init_~tmp___22~0#1, init_~r213~0#1, init_~tmp___23~0#1, init_~r233~0#1, init_~tmp___24~0#1, init_~r243~0#1, init_~tmp___25~0#1, init_~r253~0#1, init_~tmp___26~0#1, init_~r313~0#1, init_~tmp___27~0#1, init_~r323~0#1, init_~tmp___28~0#1, init_~r343~0#1, init_~tmp___29~0#1, init_~r353~0#1, init_~tmp___30~0#1, init_~r413~0#1, init_~tmp___31~0#1, init_~r423~0#1, init_~tmp___32~0#1, init_~r433~0#1, init_~tmp___33~0#1, init_~r453~0#1, init_~tmp___34~0#1, init_~r513~0#1, init_~tmp___35~0#1, init_~r523~0#1, init_~tmp___36~0#1, init_~r533~0#1, init_~tmp___37~0#1, init_~r543~0#1, init_~tmp___38~0#1, init_~r124~0#1, init_~tmp___39~0#1, init_~r134~0#1, init_~tmp___40~0#1, init_~r144~0#1, init_~tmp___41~0#1, init_~r154~0#1, init_~tmp___42~0#1, init_~r214~0#1, init_~tmp___43~0#1, init_~r234~0#1, init_~tmp___44~0#1, init_~r244~0#1, init_~tmp___45~0#1, init_~r254~0#1, init_~tmp___46~0#1, init_~r314~0#1, init_~tmp___47~0#1, init_~r324~0#1, init_~tmp___48~0#1, init_~r344~0#1, init_~tmp___49~0#1, init_~r354~0#1, init_~tmp___50~0#1, init_~r414~0#1, init_~tmp___51~0#1, init_~r424~0#1, init_~tmp___52~0#1, init_~r434~0#1, init_~tmp___53~0#1, init_~r454~0#1, init_~tmp___54~0#1, init_~r514~0#1, init_~tmp___55~0#1, init_~r524~0#1, init_~tmp___56~0#1, init_~r534~0#1, init_~tmp___57~0#1, init_~r544~0#1, init_~tmp___58~0#1, init_~tmp___59~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r151~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r251~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r351~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r451~0#1;havoc init_~r511~0#1;havoc init_~r521~0#1;havoc init_~r531~0#1;havoc init_~r541~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_~r152~0#1;havoc init_~tmp___2~0#1;havoc init_~r212~0#1;havoc init_~tmp___3~0#1;havoc init_~r232~0#1;havoc init_~tmp___4~0#1;havoc init_~r242~0#1;havoc init_~tmp___5~0#1;havoc init_~r252~0#1;havoc init_~tmp___6~0#1;havoc init_~r312~0#1;havoc init_~tmp___7~0#1;havoc init_~r322~0#1;havoc init_~tmp___8~0#1;havoc init_~r342~0#1;havoc init_~tmp___9~0#1;havoc init_~r352~0#1;havoc init_~tmp___10~0#1;havoc init_~r412~0#1;havoc init_~tmp___11~0#1;havoc init_~r422~0#1;havoc init_~tmp___12~0#1;havoc init_~r432~0#1;havoc init_~tmp___13~0#1;havoc init_~r452~0#1;havoc init_~tmp___14~0#1;havoc init_~r512~0#1;havoc init_~tmp___15~0#1;havoc init_~r522~0#1;havoc init_~tmp___16~0#1;havoc init_~r532~0#1;havoc init_~tmp___17~0#1;havoc init_~r542~0#1;havoc init_~tmp___18~0#1;havoc init_~r123~0#1;havoc init_~tmp___19~0#1;havoc init_~r133~0#1;havoc init_~tmp___20~0#1;havoc init_~r143~0#1;havoc init_~tmp___21~0#1;havoc init_~r153~0#1;havoc init_~tmp___22~0#1;havoc init_~r213~0#1;havoc init_~tmp___23~0#1;havoc init_~r233~0#1;havoc init_~tmp___24~0#1;havoc init_~r243~0#1;havoc init_~tmp___25~0#1;havoc init_~r253~0#1;havoc init_~tmp___26~0#1;havoc init_~r313~0#1;havoc init_~tmp___27~0#1;havoc init_~r323~0#1;havoc init_~tmp___28~0#1;havoc init_~r343~0#1;havoc init_~tmp___29~0#1;havoc init_~r353~0#1;havoc init_~tmp___30~0#1;havoc init_~r413~0#1;havoc init_~tmp___31~0#1;havoc init_~r423~0#1;havoc init_~tmp___32~0#1;havoc init_~r433~0#1;havoc init_~tmp___33~0#1;havoc init_~r453~0#1;havoc init_~tmp___34~0#1;havoc init_~r513~0#1;havoc init_~tmp___35~0#1;havoc init_~r523~0#1;havoc init_~tmp___36~0#1;havoc init_~r533~0#1;havoc init_~tmp___37~0#1;havoc init_~r543~0#1;havoc init_~tmp___38~0#1;havoc init_~r124~0#1;havoc init_~tmp___39~0#1;havoc init_~r134~0#1;havoc init_~tmp___40~0#1;havoc init_~r144~0#1;havoc init_~tmp___41~0#1;havoc init_~r154~0#1;havoc init_~tmp___42~0#1;havoc init_~r214~0#1;havoc init_~tmp___43~0#1;havoc init_~r234~0#1;havoc init_~tmp___44~0#1;havoc init_~r244~0#1;havoc init_~tmp___45~0#1;havoc init_~r254~0#1;havoc init_~tmp___46~0#1;havoc init_~r314~0#1;havoc init_~tmp___47~0#1;havoc init_~r324~0#1;havoc init_~tmp___48~0#1;havoc init_~r344~0#1;havoc init_~tmp___49~0#1;havoc init_~r354~0#1;havoc init_~tmp___50~0#1;havoc init_~r414~0#1;havoc init_~tmp___51~0#1;havoc init_~r424~0#1;havoc init_~tmp___52~0#1;havoc init_~r434~0#1;havoc init_~tmp___53~0#1;havoc init_~r454~0#1;havoc init_~tmp___54~0#1;havoc init_~r514~0#1;havoc init_~tmp___55~0#1;havoc init_~r524~0#1;havoc init_~tmp___56~0#1;havoc init_~r534~0#1;havoc init_~tmp___57~0#1;havoc init_~r544~0#1;havoc init_~tmp___58~0#1;havoc init_~tmp___59~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r151~0#1 := ~ep15~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r251~0#1 := ~ep25~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r351~0#1 := ~ep35~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0;init_~r451~0#1 := ~ep45~0;init_~r511~0#1 := ~ep51~0;init_~r521~0#1 := ~ep52~0;init_~r531~0#1 := ~ep53~0;init_~r541~0#1 := ~ep54~0; 4944#L623 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 4461#L642 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 4527#L652 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 4937#L671 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 5041#L681 assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; 4798#L700 init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 4587#L710 assume 0 != init_~r151~0#1 % 256;init_~tmp___2~0#1 := 1; 4574#L729 init_~r152~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 4787#L739 assume 0 != init_~r211~0#1 % 256;init_~tmp___3~0#1 := 1; 4458#L758 init_~r212~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 4405#L768 assume 0 != init_~r231~0#1 % 256;init_~tmp___4~0#1 := 1; 4406#L787 init_~r232~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 4882#L797 assume 0 != init_~r241~0#1 % 256;init_~tmp___5~0#1 := 1; 4553#L816 init_~r242~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); 4991#L826 assume 0 != init_~r251~0#1 % 256;init_~tmp___6~0#1 := 1; 4602#L845 init_~r252~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); 4958#L855 assume 0 != init_~r311~0#1 % 256;init_~tmp___7~0#1 := 1; 4415#L874 init_~r312~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); 4874#L884 assume 0 != init_~r321~0#1 % 256;init_~tmp___8~0#1 := 1; 4444#L903 init_~r322~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); 4704#L913 assume 0 != init_~r341~0#1 % 256;init_~tmp___9~0#1 := 1; 4390#L932 init_~r342~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); 5014#L942 assume 0 != init_~r351~0#1 % 256;init_~tmp___10~0#1 := 1; 4783#L961 init_~r352~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); 4784#L971 assume 0 != init_~r411~0#1 % 256;init_~tmp___11~0#1 := 1; 4413#L990 init_~r412~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); 4660#L1000 assume 0 != init_~r421~0#1 % 256;init_~tmp___12~0#1 := 1; 4709#L1019 init_~r422~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); 5074#L1029 assume 0 != init_~r431~0#1 % 256;init_~tmp___13~0#1 := 1; 4565#L1048 init_~r432~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); 4778#L1058 assume 0 != init_~r451~0#1 % 256;init_~tmp___14~0#1 := 1; 4420#L1077 init_~r452~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); 4730#L1087 assume 0 != init_~r511~0#1 % 256;init_~tmp___15~0#1 := 1; 4568#L1106 init_~r512~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); 4901#L1116 assume 0 != init_~r521~0#1 % 256;init_~tmp___16~0#1 := 1; 4548#L1135 init_~r522~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); 4966#L1145 assume 0 != init_~r531~0#1 % 256;init_~tmp___17~0#1 := 1; 4417#L1164 init_~r532~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); 4908#L1174 assume 0 != init_~r541~0#1 % 256;init_~tmp___18~0#1 := 1; 4532#L1193 init_~r542~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); 4861#L1203 assume 0 != init_~r122~0#1 % 256;init_~tmp___19~0#1 := 1; 4612#L1222 init_~r123~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); 4788#L1232 assume 0 != init_~r132~0#1 % 256;init_~tmp___20~0#1 := 1; 4849#L1251 init_~r133~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); 4850#L1261 assume 0 != init_~r142~0#1 % 256;init_~tmp___21~0#1 := 1; 4832#L1280 init_~r143~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); 4860#L1290 assume 0 != init_~r152~0#1 % 256;init_~tmp___22~0#1 := 1; 4610#L1309 init_~r153~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); 4931#L1319 assume 0 != init_~r212~0#1 % 256;init_~tmp___23~0#1 := 1; 4692#L1338 init_~r213~0#1 := (if 0 == init_~tmp___23~0#1 then 0 else 1); 4790#L1348 assume 0 != init_~r232~0#1 % 256;init_~tmp___24~0#1 := 1; 4480#L1367 init_~r233~0#1 := (if 0 == init_~tmp___24~0#1 then 0 else 1); 5007#L1377 assume 0 != init_~r242~0#1 % 256;init_~tmp___25~0#1 := 1; 4536#L1396 init_~r243~0#1 := (if 0 == init_~tmp___25~0#1 then 0 else 1); 4581#L1406 assume 0 != init_~r252~0#1 % 256;init_~tmp___26~0#1 := 1; 4680#L1425 init_~r253~0#1 := (if 0 == init_~tmp___26~0#1 then 0 else 1); 5023#L1435 assume 0 != init_~r312~0#1 % 256;init_~tmp___27~0#1 := 1; 4481#L1454 init_~r313~0#1 := (if 0 == init_~tmp___27~0#1 then 0 else 1); 4865#L1464 assume 0 != init_~r322~0#1 % 256;init_~tmp___28~0#1 := 1; 4765#L1483 init_~r323~0#1 := (if 0 == init_~tmp___28~0#1 then 0 else 1); 5050#L1493 assume 0 != init_~r342~0#1 % 256;init_~tmp___29~0#1 := 1; 4669#L1512 init_~r343~0#1 := (if 0 == init_~tmp___29~0#1 then 0 else 1); 4672#L1522 assume 0 != init_~r352~0#1 % 256;init_~tmp___30~0#1 := 1; 4380#L1541 init_~r353~0#1 := (if 0 == init_~tmp___30~0#1 then 0 else 1); 4511#L1551 assume 0 != init_~r412~0#1 % 256;init_~tmp___31~0#1 := 1; 4577#L1570 init_~r413~0#1 := (if 0 == init_~tmp___31~0#1 then 0 else 1); 4578#L1580 assume 0 != init_~r422~0#1 % 256;init_~tmp___32~0#1 := 1; 4715#L1599 init_~r423~0#1 := (if 0 == init_~tmp___32~0#1 then 0 else 1); 4446#L1609 assume 0 != init_~r432~0#1 % 256;init_~tmp___33~0#1 := 1; 4447#L1628 init_~r433~0#1 := (if 0 == init_~tmp___33~0#1 then 0 else 1); 4808#L1638 assume 0 != init_~r452~0#1 % 256;init_~tmp___34~0#1 := 1; 4384#L1657 init_~r453~0#1 := (if 0 == init_~tmp___34~0#1 then 0 else 1); 4666#L1667 assume 0 != init_~r512~0#1 % 256;init_~tmp___35~0#1 := 1; 4557#L1686 init_~r513~0#1 := (if 0 == init_~tmp___35~0#1 then 0 else 1); 4799#L1696 assume 0 != init_~r522~0#1 % 256;init_~tmp___36~0#1 := 1; 4759#L1715 init_~r523~0#1 := (if 0 == init_~tmp___36~0#1 then 0 else 1); 4821#L1725 assume 0 != init_~r532~0#1 % 256;init_~tmp___37~0#1 := 1; 4822#L1744 init_~r533~0#1 := (if 0 == init_~tmp___37~0#1 then 0 else 1); 5012#L1754 assume 0 != init_~r542~0#1 % 256;init_~tmp___38~0#1 := 1; 4791#L1773 init_~r543~0#1 := (if 0 == init_~tmp___38~0#1 then 0 else 1); 4792#L1783 assume 0 != init_~r123~0#1 % 256;init_~tmp___39~0#1 := 1; 4472#L1802 init_~r124~0#1 := (if 0 == init_~tmp___39~0#1 then 0 else 1); 4970#L1812 assume 0 != init_~r133~0#1 % 256;init_~tmp___40~0#1 := 1; 4873#L1831 init_~r134~0#1 := (if 0 == init_~tmp___40~0#1 then 0 else 1); 4627#L1841 assume 0 != init_~r143~0#1 % 256;init_~tmp___41~0#1 := 1; 4515#L1860 init_~r144~0#1 := (if 0 == init_~tmp___41~0#1 then 0 else 1); 4570#L1870 assume 0 != init_~r153~0#1 % 256;init_~tmp___42~0#1 := 1; 4571#L1889 init_~r154~0#1 := (if 0 == init_~tmp___42~0#1 then 0 else 1); 4785#L1899 assume 0 != init_~r213~0#1 % 256;init_~tmp___43~0#1 := 1; 4475#L1918 init_~r214~0#1 := (if 0 == init_~tmp___43~0#1 then 0 else 1); 4781#L1928 assume 0 != init_~r233~0#1 % 256;init_~tmp___44~0#1 := 1; 4782#L1947 init_~r234~0#1 := (if 0 == init_~tmp___44~0#1 then 0 else 1); 4997#L1957 assume 0 != init_~r243~0#1 % 256;init_~tmp___45~0#1 := 1; 5038#L1976 init_~r244~0#1 := (if 0 == init_~tmp___45~0#1 then 0 else 1); 4753#L1986 assume 0 != init_~r253~0#1 % 256;init_~tmp___46~0#1 := 1; 4640#L2005 init_~r254~0#1 := (if 0 == init_~tmp___46~0#1 then 0 else 1); 4795#L2015 assume 0 != init_~r313~0#1 % 256;init_~tmp___47~0#1 := 1; 4540#L2034 init_~r314~0#1 := (if 0 == init_~tmp___47~0#1 then 0 else 1); 5020#L2044 assume 0 != init_~r323~0#1 % 256;init_~tmp___48~0#1 := 1; 4492#L2063 init_~r324~0#1 := (if 0 == init_~tmp___48~0#1 then 0 else 1); 4840#L2073 assume 0 != init_~r343~0#1 % 256;init_~tmp___49~0#1 := 1; 4652#L2092 init_~r344~0#1 := (if 0 == init_~tmp___49~0#1 then 0 else 1); 4642#L2102 assume 0 != init_~r353~0#1 % 256;init_~tmp___50~0#1 := 1; 4529#L2121 init_~r354~0#1 := (if 0 == init_~tmp___50~0#1 then 0 else 1); 4726#L2131 assume 0 != init_~r413~0#1 % 256;init_~tmp___51~0#1 := 1; 4489#L2150 init_~r414~0#1 := (if 0 == init_~tmp___51~0#1 then 0 else 1); 4775#L2160 assume 0 != init_~r423~0#1 % 256;init_~tmp___52~0#1 := 1; 4499#L2179 init_~r424~0#1 := (if 0 == init_~tmp___52~0#1 then 0 else 1); 4500#L2189 assume 0 != init_~r433~0#1 % 256;init_~tmp___53~0#1 := 1; 4777#L2208 init_~r434~0#1 := (if 0 == init_~tmp___53~0#1 then 0 else 1); 4847#L2218 assume 0 != init_~r453~0#1 % 256;init_~tmp___54~0#1 := 1; 4470#L2237 init_~r454~0#1 := (if 0 == init_~tmp___54~0#1 then 0 else 1); 4939#L2247 assume 0 != init_~r513~0#1 % 256;init_~tmp___55~0#1 := 1; 4922#L2266 init_~r514~0#1 := (if 0 == init_~tmp___55~0#1 then 0 else 1); 4598#L2276 assume 0 != init_~r523~0#1 % 256;init_~tmp___56~0#1 := 1; 4600#L2295 init_~r524~0#1 := (if 0 == init_~tmp___56~0#1 then 0 else 1); 4789#L2305 assume 0 != init_~r533~0#1 % 256;init_~tmp___57~0#1 := 1; 4546#L2324 init_~r534~0#1 := (if 0 == init_~tmp___57~0#1 then 0 else 1); 4768#L2334 assume 0 != init_~r543~0#1 % 256;init_~tmp___58~0#1 := 1; 4422#L2353 init_~r544~0#1 := (if 0 == init_~tmp___58~0#1 then 0 else 1); 4423#L2363 assume !(~id1~0 != ~id2~0);init_~tmp___59~0#1 := 0; 4375#L2363-1 init_#res#1 := init_~tmp___59~0#1; 5025#L2604 main_#t~ret79#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret79#1;havoc main_#t~ret79#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; 5030#L21 assume !(0 == assume_abort_if_not_~cond#1); 4762#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;~p15_old~0 := ~nomsg~0;~p15_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;~p25_old~0 := ~nomsg~0;~p25_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;~p35_old~0 := ~nomsg~0;~p35_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;~p45_old~0 := ~nomsg~0;~p45_new~0 := ~nomsg~0;~p51_old~0 := ~nomsg~0;~p51_new~0 := ~nomsg~0;~p52_old~0 := ~nomsg~0;~p52_new~0 := ~nomsg~0;~p53_old~0 := ~nomsg~0;~p53_new~0 := ~nomsg~0;~p54_old~0 := ~nomsg~0;~p54_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 4763#L2776-2 [2022-02-21 04:27:43,044 INFO L793 eck$LassoCheckResult]: Loop: 4763#L2776-2 assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1, node1_#t~ite7#1; 5196#L148 assume !(0 != ~mode1~0 % 256); 5195#L187 assume ~r1~0 < 4; 4432#L188 assume !(0 != ~ep12~0 % 256); 4433#L188-2 assume !(0 != ~ep13~0 % 256); 4686#L191-1 assume !(0 != ~ep14~0 % 256); 4687#L194-1 assume !(0 != ~ep15~0 % 256); 4951#L187-1 ~mode1~0 := 1; 5175#L148-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite8#1, node2_#t~ite9#1, node2_#t~ite10#1, node2_#t~ite11#1; 5174#L211 assume !(0 != ~mode2~0 % 256); 5158#L250 assume !(~r2~0 < 4); 5154#L250-1 ~mode2~0 := 1; 5153#L211-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite12#1, node3_#t~ite13#1, node3_#t~ite14#1, node3_#t~ite15#1; 5151#L274 assume !(0 != ~mode3~0 % 256); 5152#L313 assume !(~r3~0 < 4); 5134#L313-1 ~mode3~0 := 1; 5133#L274-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite16#1, node4_#t~ite17#1, node4_#t~ite18#1, node4_#t~ite19#1; 5132#L337 assume !(0 != ~mode4~0 % 256); 5116#L376 assume !(~r4~0 < 4); 5112#L376-1 ~mode4~0 := 1; 5111#L337-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite20#1, node5_#t~ite21#1, node5_#t~ite22#1, node5_#t~ite23#1; 5109#L400 assume !(0 != ~mode5~0 % 256); 5090#L439 assume !(~r5~0 < 4); 5086#L439-1 ~mode5~0 := 1; 5085#L400-2 assume { :end_inline_node5 } 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;~p15_old~0 := ~p15_new~0;~p15_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;~p25_old~0 := ~p25_new~0;~p25_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;~p35_old~0 := ~p35_new~0;~p35_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;~p45_old~0 := ~p45_new~0;~p45_new~0 := ~nomsg~0;~p51_old~0 := ~p51_new~0;~p51_new~0 := ~nomsg~0;~p52_old~0 := ~p52_new~0;~p52_new~0 := ~nomsg~0;~p53_old~0 := ~p53_new~0;~p53_new~0 := ~nomsg~0;~p54_old~0 := ~p54_new~0;~p54_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 5084#L2612 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 5083#L2613 assume ~st1~0 + ~nl1~0 <= 1; 5082#L2614 assume ~st2~0 + ~nl2~0 <= 1; 5081#L2615 assume ~st3~0 + ~nl3~0 <= 1; 5080#L2616 assume ~st4~0 + ~nl4~0 <= 1; 5079#L2617 assume ~st5~0 + ~nl5~0 <= 1; 5078#L2618 assume !(~r1~0 >= 4); 4754#L2621 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; 4755#L2622 assume ~r1~0 < 4; 5193#L2627 assume !(~r1~0 >= 4); 4803#L2631 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0 + ~nl5~0; 4804#L2632 assume ~r1~0 < 4;check_~tmp~1#1 := 1; 4892#L2612-1 check_#res#1 := check_~tmp~1#1; 4893#L2668 main_#t~ret80#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret80#1;havoc main_#t~ret80#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; 4915#L2836 assume !(0 == assert_~arg#1 % 256); 5197#L2831 assume { :end_inline_assert } true;main_#t~post81#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post81#1;havoc main_#t~post81#1; 4763#L2776-2 [2022-02-21 04:27:43,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:27:43,044 INFO L85 PathProgramCache]: Analyzing trace with hash -1593308194, now seen corresponding path program 3 times [2022-02-21 04:27:43,045 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:27:43,045 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978119967] [2022-02-21 04:27:43,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:27:43,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:27:43,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:27:43,121 INFO L290 TraceCheckUtils]: 0: Hoare triple {6858#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(40, 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;~p15~0 := 0;~p15_old~0 := 0;~p15_new~0 := 0;~ep15~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;~p25~0 := 0;~p25_old~0 := 0;~p25_new~0 := 0;~ep25~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;~p35~0 := 0;~p35_old~0 := 0;~p35_new~0 := 0;~ep35~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;~p45~0 := 0;~p45_old~0 := 0;~p45_new~0 := 0;~ep45~0 := 0;~p51~0 := 0;~p51_old~0 := 0;~p51_new~0 := 0;~ep51~0 := 0;~p52~0 := 0;~p52_old~0 := 0;~p52_new~0 := 0;~ep52~0 := 0;~p53~0 := 0;~p53_old~0 := 0;~p53_new~0 := 0;~ep53~0 := 0;~p54~0 := 0;~p54_old~0 := 0;~p54_new~0 := 0;~ep54~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~id5~0 := 0;~r5~0 := 0;~st5~0 := 0;~nl5~0 := 0;~m5~0 := 0;~max5~0 := 0;~mode5~0 := 0; {6858#true} is VALID [2022-02-21 04:27:43,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {6858#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet60#1, main_#t~nondet61#1, main_#t~nondet62#1, main_#t~nondet63#1, main_#t~nondet64#1, main_#t~nondet65#1, main_#t~nondet66#1, main_#t~nondet67#1, main_#t~nondet68#1, main_#t~nondet69#1, main_#t~nondet70#1, main_#t~nondet71#1, main_#t~nondet72#1, main_#t~nondet73#1, main_#t~nondet74#1, main_#t~nondet75#1, main_#t~nondet76#1, main_#t~nondet77#1, main_#t~nondet78#1, main_#t~ret79#1, main_#t~ret80#1, main_#t~post81#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~nondet24#1;havoc main_#t~nondet24#1;~ep13~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep14~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep15~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~ep21~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~ep23~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~ep24~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~ep25~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~ep31~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~ep32~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~ep34~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~ep35~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~ep41~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~ep42~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~ep43~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~ep45~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~ep51~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~ep52~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~ep53~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~ep54~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~id1~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~r1~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~st1~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~nl1~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~m1~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~max1~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~mode1~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~id2~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~r2~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~st2~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~nl2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~m2~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;~max2~0 := main_#t~nondet56#1;havoc main_#t~nondet56#1;~mode2~0 := main_#t~nondet57#1;havoc main_#t~nondet57#1;~id3~0 := main_#t~nondet58#1;havoc main_#t~nondet58#1;~r3~0 := main_#t~nondet59#1;havoc main_#t~nondet59#1;~st3~0 := main_#t~nondet60#1;havoc main_#t~nondet60#1;~nl3~0 := main_#t~nondet61#1;havoc main_#t~nondet61#1;~m3~0 := main_#t~nondet62#1;havoc main_#t~nondet62#1;~max3~0 := main_#t~nondet63#1;havoc main_#t~nondet63#1;~mode3~0 := main_#t~nondet64#1;havoc main_#t~nondet64#1;~id4~0 := main_#t~nondet65#1;havoc main_#t~nondet65#1;~r4~0 := main_#t~nondet66#1;havoc main_#t~nondet66#1;~st4~0 := main_#t~nondet67#1;havoc main_#t~nondet67#1;~nl4~0 := main_#t~nondet68#1;havoc main_#t~nondet68#1;~m4~0 := main_#t~nondet69#1;havoc main_#t~nondet69#1;~max4~0 := main_#t~nondet70#1;havoc main_#t~nondet70#1;~mode4~0 := main_#t~nondet71#1;havoc main_#t~nondet71#1;~id5~0 := main_#t~nondet72#1;havoc main_#t~nondet72#1;~r5~0 := main_#t~nondet73#1;havoc main_#t~nondet73#1;~st5~0 := main_#t~nondet74#1;havoc main_#t~nondet74#1;~nl5~0 := main_#t~nondet75#1;havoc main_#t~nondet75#1;~m5~0 := main_#t~nondet76#1;havoc main_#t~nondet76#1;~max5~0 := main_#t~nondet77#1;havoc main_#t~nondet77#1;~mode5~0 := main_#t~nondet78#1;havoc main_#t~nondet78#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r151~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r251~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r351~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r451~0#1, init_~r511~0#1, init_~r521~0#1, init_~r531~0#1, init_~r541~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_~r152~0#1, init_~tmp___2~0#1, init_~r212~0#1, init_~tmp___3~0#1, init_~r232~0#1, init_~tmp___4~0#1, init_~r242~0#1, init_~tmp___5~0#1, init_~r252~0#1, init_~tmp___6~0#1, init_~r312~0#1, init_~tmp___7~0#1, init_~r322~0#1, init_~tmp___8~0#1, init_~r342~0#1, init_~tmp___9~0#1, init_~r352~0#1, init_~tmp___10~0#1, init_~r412~0#1, init_~tmp___11~0#1, init_~r422~0#1, init_~tmp___12~0#1, init_~r432~0#1, init_~tmp___13~0#1, init_~r452~0#1, init_~tmp___14~0#1, init_~r512~0#1, init_~tmp___15~0#1, init_~r522~0#1, init_~tmp___16~0#1, init_~r532~0#1, init_~tmp___17~0#1, init_~r542~0#1, init_~tmp___18~0#1, init_~r123~0#1, init_~tmp___19~0#1, init_~r133~0#1, init_~tmp___20~0#1, init_~r143~0#1, init_~tmp___21~0#1, init_~r153~0#1, init_~tmp___22~0#1, init_~r213~0#1, init_~tmp___23~0#1, init_~r233~0#1, init_~tmp___24~0#1, init_~r243~0#1, init_~tmp___25~0#1, init_~r253~0#1, init_~tmp___26~0#1, init_~r313~0#1, init_~tmp___27~0#1, init_~r323~0#1, init_~tmp___28~0#1, init_~r343~0#1, init_~tmp___29~0#1, init_~r353~0#1, init_~tmp___30~0#1, init_~r413~0#1, init_~tmp___31~0#1, init_~r423~0#1, init_~tmp___32~0#1, init_~r433~0#1, init_~tmp___33~0#1, init_~r453~0#1, init_~tmp___34~0#1, init_~r513~0#1, init_~tmp___35~0#1, init_~r523~0#1, init_~tmp___36~0#1, init_~r533~0#1, init_~tmp___37~0#1, init_~r543~0#1, init_~tmp___38~0#1, init_~r124~0#1, init_~tmp___39~0#1, init_~r134~0#1, init_~tmp___40~0#1, init_~r144~0#1, init_~tmp___41~0#1, init_~r154~0#1, init_~tmp___42~0#1, init_~r214~0#1, init_~tmp___43~0#1, init_~r234~0#1, init_~tmp___44~0#1, init_~r244~0#1, init_~tmp___45~0#1, init_~r254~0#1, init_~tmp___46~0#1, init_~r314~0#1, init_~tmp___47~0#1, init_~r324~0#1, init_~tmp___48~0#1, init_~r344~0#1, init_~tmp___49~0#1, init_~r354~0#1, init_~tmp___50~0#1, init_~r414~0#1, init_~tmp___51~0#1, init_~r424~0#1, init_~tmp___52~0#1, init_~r434~0#1, init_~tmp___53~0#1, init_~r454~0#1, init_~tmp___54~0#1, init_~r514~0#1, init_~tmp___55~0#1, init_~r524~0#1, init_~tmp___56~0#1, init_~r534~0#1, init_~tmp___57~0#1, init_~r544~0#1, init_~tmp___58~0#1, init_~tmp___59~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r151~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r251~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r351~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r451~0#1;havoc init_~r511~0#1;havoc init_~r521~0#1;havoc init_~r531~0#1;havoc init_~r541~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_~r152~0#1;havoc init_~tmp___2~0#1;havoc init_~r212~0#1;havoc init_~tmp___3~0#1;havoc init_~r232~0#1;havoc init_~tmp___4~0#1;havoc init_~r242~0#1;havoc init_~tmp___5~0#1;havoc init_~r252~0#1;havoc init_~tmp___6~0#1;havoc init_~r312~0#1;havoc init_~tmp___7~0#1;havoc init_~r322~0#1;havoc init_~tmp___8~0#1;havoc init_~r342~0#1;havoc init_~tmp___9~0#1;havoc init_~r352~0#1;havoc init_~tmp___10~0#1;havoc init_~r412~0#1;havoc init_~tmp___11~0#1;havoc init_~r422~0#1;havoc init_~tmp___12~0#1;havoc init_~r432~0#1;havoc init_~tmp___13~0#1;havoc init_~r452~0#1;havoc init_~tmp___14~0#1;havoc init_~r512~0#1;havoc init_~tmp___15~0#1;havoc init_~r522~0#1;havoc init_~tmp___16~0#1;havoc init_~r532~0#1;havoc init_~tmp___17~0#1;havoc init_~r542~0#1;havoc init_~tmp___18~0#1;havoc init_~r123~0#1;havoc init_~tmp___19~0#1;havoc init_~r133~0#1;havoc init_~tmp___20~0#1;havoc init_~r143~0#1;havoc init_~tmp___21~0#1;havoc init_~r153~0#1;havoc init_~tmp___22~0#1;havoc init_~r213~0#1;havoc init_~tmp___23~0#1;havoc init_~r233~0#1;havoc init_~tmp___24~0#1;havoc init_~r243~0#1;havoc init_~tmp___25~0#1;havoc init_~r253~0#1;havoc init_~tmp___26~0#1;havoc init_~r313~0#1;havoc init_~tmp___27~0#1;havoc init_~r323~0#1;havoc init_~tmp___28~0#1;havoc init_~r343~0#1;havoc init_~tmp___29~0#1;havoc init_~r353~0#1;havoc init_~tmp___30~0#1;havoc init_~r413~0#1;havoc init_~tmp___31~0#1;havoc init_~r423~0#1;havoc init_~tmp___32~0#1;havoc init_~r433~0#1;havoc init_~tmp___33~0#1;havoc init_~r453~0#1;havoc init_~tmp___34~0#1;havoc init_~r513~0#1;havoc init_~tmp___35~0#1;havoc init_~r523~0#1;havoc init_~tmp___36~0#1;havoc init_~r533~0#1;havoc init_~tmp___37~0#1;havoc init_~r543~0#1;havoc init_~tmp___38~0#1;havoc init_~r124~0#1;havoc init_~tmp___39~0#1;havoc init_~r134~0#1;havoc init_~tmp___40~0#1;havoc init_~r144~0#1;havoc init_~tmp___41~0#1;havoc init_~r154~0#1;havoc init_~tmp___42~0#1;havoc init_~r214~0#1;havoc init_~tmp___43~0#1;havoc init_~r234~0#1;havoc init_~tmp___44~0#1;havoc init_~r244~0#1;havoc init_~tmp___45~0#1;havoc init_~r254~0#1;havoc init_~tmp___46~0#1;havoc init_~r314~0#1;havoc init_~tmp___47~0#1;havoc init_~r324~0#1;havoc init_~tmp___48~0#1;havoc init_~r344~0#1;havoc init_~tmp___49~0#1;havoc init_~r354~0#1;havoc init_~tmp___50~0#1;havoc init_~r414~0#1;havoc init_~tmp___51~0#1;havoc init_~r424~0#1;havoc init_~tmp___52~0#1;havoc init_~r434~0#1;havoc init_~tmp___53~0#1;havoc init_~r454~0#1;havoc init_~tmp___54~0#1;havoc init_~r514~0#1;havoc init_~tmp___55~0#1;havoc init_~r524~0#1;havoc init_~tmp___56~0#1;havoc init_~r534~0#1;havoc init_~tmp___57~0#1;havoc init_~r544~0#1;havoc init_~tmp___58~0#1;havoc init_~tmp___59~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r151~0#1 := ~ep15~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r251~0#1 := ~ep25~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r351~0#1 := ~ep35~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0;init_~r451~0#1 := ~ep45~0;init_~r511~0#1 := ~ep51~0;init_~r521~0#1 := ~ep52~0;init_~r531~0#1 := ~ep53~0;init_~r541~0#1 := ~ep54~0; {6858#true} is VALID [2022-02-21 04:27:43,121 INFO L290 TraceCheckUtils]: 2: Hoare triple {6858#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,121 INFO L290 TraceCheckUtils]: 3: Hoare triple {6858#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,121 INFO L290 TraceCheckUtils]: 4: Hoare triple {6858#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {6858#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {6858#true} assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,122 INFO L290 TraceCheckUtils]: 7: Hoare triple {6858#true} init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,122 INFO L290 TraceCheckUtils]: 8: Hoare triple {6858#true} assume 0 != init_~r151~0#1 % 256;init_~tmp___2~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,122 INFO L290 TraceCheckUtils]: 9: Hoare triple {6858#true} init_~r152~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,122 INFO L290 TraceCheckUtils]: 10: Hoare triple {6858#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___3~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,122 INFO L290 TraceCheckUtils]: 11: Hoare triple {6858#true} init_~r212~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,122 INFO L290 TraceCheckUtils]: 12: Hoare triple {6858#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___4~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,123 INFO L290 TraceCheckUtils]: 13: Hoare triple {6858#true} init_~r232~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,123 INFO L290 TraceCheckUtils]: 14: Hoare triple {6858#true} assume 0 != init_~r241~0#1 % 256;init_~tmp___5~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,123 INFO L290 TraceCheckUtils]: 15: Hoare triple {6858#true} init_~r242~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {6858#true} assume 0 != init_~r251~0#1 % 256;init_~tmp___6~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,123 INFO L290 TraceCheckUtils]: 17: Hoare triple {6858#true} init_~r252~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {6858#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___7~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,123 INFO L290 TraceCheckUtils]: 19: Hoare triple {6858#true} init_~r312~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,123 INFO L290 TraceCheckUtils]: 20: Hoare triple {6858#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___8~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,124 INFO L290 TraceCheckUtils]: 21: Hoare triple {6858#true} init_~r322~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,124 INFO L290 TraceCheckUtils]: 22: Hoare triple {6858#true} assume 0 != init_~r341~0#1 % 256;init_~tmp___9~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,124 INFO L290 TraceCheckUtils]: 23: Hoare triple {6858#true} init_~r342~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,124 INFO L290 TraceCheckUtils]: 24: Hoare triple {6858#true} assume 0 != init_~r351~0#1 % 256;init_~tmp___10~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,124 INFO L290 TraceCheckUtils]: 25: Hoare triple {6858#true} init_~r352~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,124 INFO L290 TraceCheckUtils]: 26: Hoare triple {6858#true} assume 0 != init_~r411~0#1 % 256;init_~tmp___11~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,124 INFO L290 TraceCheckUtils]: 27: Hoare triple {6858#true} init_~r412~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,124 INFO L290 TraceCheckUtils]: 28: Hoare triple {6858#true} assume 0 != init_~r421~0#1 % 256;init_~tmp___12~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,125 INFO L290 TraceCheckUtils]: 29: Hoare triple {6858#true} init_~r422~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,125 INFO L290 TraceCheckUtils]: 30: Hoare triple {6858#true} assume 0 != init_~r431~0#1 % 256;init_~tmp___13~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,125 INFO L290 TraceCheckUtils]: 31: Hoare triple {6858#true} init_~r432~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,125 INFO L290 TraceCheckUtils]: 32: Hoare triple {6858#true} assume 0 != init_~r451~0#1 % 256;init_~tmp___14~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,125 INFO L290 TraceCheckUtils]: 33: Hoare triple {6858#true} init_~r452~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,125 INFO L290 TraceCheckUtils]: 34: Hoare triple {6858#true} assume 0 != init_~r511~0#1 % 256;init_~tmp___15~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,125 INFO L290 TraceCheckUtils]: 35: Hoare triple {6858#true} init_~r512~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,125 INFO L290 TraceCheckUtils]: 36: Hoare triple {6858#true} assume 0 != init_~r521~0#1 % 256;init_~tmp___16~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,125 INFO L290 TraceCheckUtils]: 37: Hoare triple {6858#true} init_~r522~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,126 INFO L290 TraceCheckUtils]: 38: Hoare triple {6858#true} assume 0 != init_~r531~0#1 % 256;init_~tmp___17~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,126 INFO L290 TraceCheckUtils]: 39: Hoare triple {6858#true} init_~r532~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,126 INFO L290 TraceCheckUtils]: 40: Hoare triple {6858#true} assume 0 != init_~r541~0#1 % 256;init_~tmp___18~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,126 INFO L290 TraceCheckUtils]: 41: Hoare triple {6858#true} init_~r542~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,126 INFO L290 TraceCheckUtils]: 42: Hoare triple {6858#true} assume 0 != init_~r122~0#1 % 256;init_~tmp___19~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,126 INFO L290 TraceCheckUtils]: 43: Hoare triple {6858#true} init_~r123~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,126 INFO L290 TraceCheckUtils]: 44: Hoare triple {6858#true} assume 0 != init_~r132~0#1 % 256;init_~tmp___20~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,126 INFO L290 TraceCheckUtils]: 45: Hoare triple {6858#true} init_~r133~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,127 INFO L290 TraceCheckUtils]: 46: Hoare triple {6858#true} assume 0 != init_~r142~0#1 % 256;init_~tmp___21~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,127 INFO L290 TraceCheckUtils]: 47: Hoare triple {6858#true} init_~r143~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,127 INFO L290 TraceCheckUtils]: 48: Hoare triple {6858#true} assume 0 != init_~r152~0#1 % 256;init_~tmp___22~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,127 INFO L290 TraceCheckUtils]: 49: Hoare triple {6858#true} init_~r153~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,127 INFO L290 TraceCheckUtils]: 50: Hoare triple {6858#true} assume 0 != init_~r212~0#1 % 256;init_~tmp___23~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,127 INFO L290 TraceCheckUtils]: 51: Hoare triple {6858#true} init_~r213~0#1 := (if 0 == init_~tmp___23~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,127 INFO L290 TraceCheckUtils]: 52: Hoare triple {6858#true} assume 0 != init_~r232~0#1 % 256;init_~tmp___24~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,127 INFO L290 TraceCheckUtils]: 53: Hoare triple {6858#true} init_~r233~0#1 := (if 0 == init_~tmp___24~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,127 INFO L290 TraceCheckUtils]: 54: Hoare triple {6858#true} assume 0 != init_~r242~0#1 % 256;init_~tmp___25~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,128 INFO L290 TraceCheckUtils]: 55: Hoare triple {6858#true} init_~r243~0#1 := (if 0 == init_~tmp___25~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,128 INFO L290 TraceCheckUtils]: 56: Hoare triple {6858#true} assume 0 != init_~r252~0#1 % 256;init_~tmp___26~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,128 INFO L290 TraceCheckUtils]: 57: Hoare triple {6858#true} init_~r253~0#1 := (if 0 == init_~tmp___26~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,128 INFO L290 TraceCheckUtils]: 58: Hoare triple {6858#true} assume 0 != init_~r312~0#1 % 256;init_~tmp___27~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,128 INFO L290 TraceCheckUtils]: 59: Hoare triple {6858#true} init_~r313~0#1 := (if 0 == init_~tmp___27~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,128 INFO L290 TraceCheckUtils]: 60: Hoare triple {6858#true} assume 0 != init_~r322~0#1 % 256;init_~tmp___28~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,128 INFO L290 TraceCheckUtils]: 61: Hoare triple {6858#true} init_~r323~0#1 := (if 0 == init_~tmp___28~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,128 INFO L290 TraceCheckUtils]: 62: Hoare triple {6858#true} assume 0 != init_~r342~0#1 % 256;init_~tmp___29~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,129 INFO L290 TraceCheckUtils]: 63: Hoare triple {6858#true} init_~r343~0#1 := (if 0 == init_~tmp___29~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,129 INFO L290 TraceCheckUtils]: 64: Hoare triple {6858#true} assume 0 != init_~r352~0#1 % 256;init_~tmp___30~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,129 INFO L290 TraceCheckUtils]: 65: Hoare triple {6858#true} init_~r353~0#1 := (if 0 == init_~tmp___30~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,129 INFO L290 TraceCheckUtils]: 66: Hoare triple {6858#true} assume 0 != init_~r412~0#1 % 256;init_~tmp___31~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,129 INFO L290 TraceCheckUtils]: 67: Hoare triple {6858#true} init_~r413~0#1 := (if 0 == init_~tmp___31~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,129 INFO L290 TraceCheckUtils]: 68: Hoare triple {6858#true} assume 0 != init_~r422~0#1 % 256;init_~tmp___32~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,129 INFO L290 TraceCheckUtils]: 69: Hoare triple {6858#true} init_~r423~0#1 := (if 0 == init_~tmp___32~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,129 INFO L290 TraceCheckUtils]: 70: Hoare triple {6858#true} assume 0 != init_~r432~0#1 % 256;init_~tmp___33~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,130 INFO L290 TraceCheckUtils]: 71: Hoare triple {6858#true} init_~r433~0#1 := (if 0 == init_~tmp___33~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,130 INFO L290 TraceCheckUtils]: 72: Hoare triple {6858#true} assume 0 != init_~r452~0#1 % 256;init_~tmp___34~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,130 INFO L290 TraceCheckUtils]: 73: Hoare triple {6858#true} init_~r453~0#1 := (if 0 == init_~tmp___34~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,130 INFO L290 TraceCheckUtils]: 74: Hoare triple {6858#true} assume 0 != init_~r512~0#1 % 256;init_~tmp___35~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,130 INFO L290 TraceCheckUtils]: 75: Hoare triple {6858#true} init_~r513~0#1 := (if 0 == init_~tmp___35~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,130 INFO L290 TraceCheckUtils]: 76: Hoare triple {6858#true} assume 0 != init_~r522~0#1 % 256;init_~tmp___36~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,130 INFO L290 TraceCheckUtils]: 77: Hoare triple {6858#true} init_~r523~0#1 := (if 0 == init_~tmp___36~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,130 INFO L290 TraceCheckUtils]: 78: Hoare triple {6858#true} assume 0 != init_~r532~0#1 % 256;init_~tmp___37~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,131 INFO L290 TraceCheckUtils]: 79: Hoare triple {6858#true} init_~r533~0#1 := (if 0 == init_~tmp___37~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,131 INFO L290 TraceCheckUtils]: 80: Hoare triple {6858#true} assume 0 != init_~r542~0#1 % 256;init_~tmp___38~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,131 INFO L290 TraceCheckUtils]: 81: Hoare triple {6858#true} init_~r543~0#1 := (if 0 == init_~tmp___38~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,131 INFO L290 TraceCheckUtils]: 82: Hoare triple {6858#true} assume 0 != init_~r123~0#1 % 256;init_~tmp___39~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,131 INFO L290 TraceCheckUtils]: 83: Hoare triple {6858#true} init_~r124~0#1 := (if 0 == init_~tmp___39~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,131 INFO L290 TraceCheckUtils]: 84: Hoare triple {6858#true} assume 0 != init_~r133~0#1 % 256;init_~tmp___40~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,131 INFO L290 TraceCheckUtils]: 85: Hoare triple {6858#true} init_~r134~0#1 := (if 0 == init_~tmp___40~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,131 INFO L290 TraceCheckUtils]: 86: Hoare triple {6858#true} assume 0 != init_~r143~0#1 % 256;init_~tmp___41~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,132 INFO L290 TraceCheckUtils]: 87: Hoare triple {6858#true} init_~r144~0#1 := (if 0 == init_~tmp___41~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,132 INFO L290 TraceCheckUtils]: 88: Hoare triple {6858#true} assume 0 != init_~r153~0#1 % 256;init_~tmp___42~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,132 INFO L290 TraceCheckUtils]: 89: Hoare triple {6858#true} init_~r154~0#1 := (if 0 == init_~tmp___42~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,132 INFO L290 TraceCheckUtils]: 90: Hoare triple {6858#true} assume 0 != init_~r213~0#1 % 256;init_~tmp___43~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,132 INFO L290 TraceCheckUtils]: 91: Hoare triple {6858#true} init_~r214~0#1 := (if 0 == init_~tmp___43~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,132 INFO L290 TraceCheckUtils]: 92: Hoare triple {6858#true} assume 0 != init_~r233~0#1 % 256;init_~tmp___44~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,132 INFO L290 TraceCheckUtils]: 93: Hoare triple {6858#true} init_~r234~0#1 := (if 0 == init_~tmp___44~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,132 INFO L290 TraceCheckUtils]: 94: Hoare triple {6858#true} assume 0 != init_~r243~0#1 % 256;init_~tmp___45~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,132 INFO L290 TraceCheckUtils]: 95: Hoare triple {6858#true} init_~r244~0#1 := (if 0 == init_~tmp___45~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,133 INFO L290 TraceCheckUtils]: 96: Hoare triple {6858#true} assume 0 != init_~r253~0#1 % 256;init_~tmp___46~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,133 INFO L290 TraceCheckUtils]: 97: Hoare triple {6858#true} init_~r254~0#1 := (if 0 == init_~tmp___46~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,133 INFO L290 TraceCheckUtils]: 98: Hoare triple {6858#true} assume 0 != init_~r313~0#1 % 256;init_~tmp___47~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,133 INFO L290 TraceCheckUtils]: 99: Hoare triple {6858#true} init_~r314~0#1 := (if 0 == init_~tmp___47~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,133 INFO L290 TraceCheckUtils]: 100: Hoare triple {6858#true} assume 0 != init_~r323~0#1 % 256;init_~tmp___48~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,133 INFO L290 TraceCheckUtils]: 101: Hoare triple {6858#true} init_~r324~0#1 := (if 0 == init_~tmp___48~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,133 INFO L290 TraceCheckUtils]: 102: Hoare triple {6858#true} assume 0 != init_~r343~0#1 % 256;init_~tmp___49~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,133 INFO L290 TraceCheckUtils]: 103: Hoare triple {6858#true} init_~r344~0#1 := (if 0 == init_~tmp___49~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,134 INFO L290 TraceCheckUtils]: 104: Hoare triple {6858#true} assume 0 != init_~r353~0#1 % 256;init_~tmp___50~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,134 INFO L290 TraceCheckUtils]: 105: Hoare triple {6858#true} init_~r354~0#1 := (if 0 == init_~tmp___50~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,134 INFO L290 TraceCheckUtils]: 106: Hoare triple {6858#true} assume 0 != init_~r413~0#1 % 256;init_~tmp___51~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,134 INFO L290 TraceCheckUtils]: 107: Hoare triple {6858#true} init_~r414~0#1 := (if 0 == init_~tmp___51~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,134 INFO L290 TraceCheckUtils]: 108: Hoare triple {6858#true} assume 0 != init_~r423~0#1 % 256;init_~tmp___52~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,134 INFO L290 TraceCheckUtils]: 109: Hoare triple {6858#true} init_~r424~0#1 := (if 0 == init_~tmp___52~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,134 INFO L290 TraceCheckUtils]: 110: Hoare triple {6858#true} assume 0 != init_~r433~0#1 % 256;init_~tmp___53~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,134 INFO L290 TraceCheckUtils]: 111: Hoare triple {6858#true} init_~r434~0#1 := (if 0 == init_~tmp___53~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,134 INFO L290 TraceCheckUtils]: 112: Hoare triple {6858#true} assume 0 != init_~r453~0#1 % 256;init_~tmp___54~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,135 INFO L290 TraceCheckUtils]: 113: Hoare triple {6858#true} init_~r454~0#1 := (if 0 == init_~tmp___54~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,135 INFO L290 TraceCheckUtils]: 114: Hoare triple {6858#true} assume 0 != init_~r513~0#1 % 256;init_~tmp___55~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,135 INFO L290 TraceCheckUtils]: 115: Hoare triple {6858#true} init_~r514~0#1 := (if 0 == init_~tmp___55~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,135 INFO L290 TraceCheckUtils]: 116: Hoare triple {6858#true} assume 0 != init_~r523~0#1 % 256;init_~tmp___56~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,135 INFO L290 TraceCheckUtils]: 117: Hoare triple {6858#true} init_~r524~0#1 := (if 0 == init_~tmp___56~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,135 INFO L290 TraceCheckUtils]: 118: Hoare triple {6858#true} assume 0 != init_~r533~0#1 % 256;init_~tmp___57~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,135 INFO L290 TraceCheckUtils]: 119: Hoare triple {6858#true} init_~r534~0#1 := (if 0 == init_~tmp___57~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,135 INFO L290 TraceCheckUtils]: 120: Hoare triple {6858#true} assume 0 != init_~r543~0#1 % 256;init_~tmp___58~0#1 := 1; {6858#true} is VALID [2022-02-21 04:27:43,136 INFO L290 TraceCheckUtils]: 121: Hoare triple {6858#true} init_~r544~0#1 := (if 0 == init_~tmp___58~0#1 then 0 else 1); {6858#true} is VALID [2022-02-21 04:27:43,136 INFO L290 TraceCheckUtils]: 122: Hoare triple {6858#true} assume !(~id1~0 != ~id2~0);init_~tmp___59~0#1 := 0; {6860#(= |ULTIMATE.start_init_~tmp___59~0#1| 0)} is VALID [2022-02-21 04:27:43,136 INFO L290 TraceCheckUtils]: 123: Hoare triple {6860#(= |ULTIMATE.start_init_~tmp___59~0#1| 0)} init_#res#1 := init_~tmp___59~0#1; {6861#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:27:43,137 INFO L290 TraceCheckUtils]: 124: Hoare triple {6861#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret79#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret79#1;havoc main_#t~ret79#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; {6862#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:27:43,137 INFO L290 TraceCheckUtils]: 125: Hoare triple {6862#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {6859#false} is VALID [2022-02-21 04:27:43,137 INFO L290 TraceCheckUtils]: 126: Hoare triple {6859#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;~p15_old~0 := ~nomsg~0;~p15_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;~p25_old~0 := ~nomsg~0;~p25_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;~p35_old~0 := ~nomsg~0;~p35_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;~p45_old~0 := ~nomsg~0;~p45_new~0 := ~nomsg~0;~p51_old~0 := ~nomsg~0;~p51_new~0 := ~nomsg~0;~p52_old~0 := ~nomsg~0;~p52_new~0 := ~nomsg~0;~p53_old~0 := ~nomsg~0;~p53_new~0 := ~nomsg~0;~p54_old~0 := ~nomsg~0;~p54_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {6859#false} is VALID [2022-02-21 04:27:43,138 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:27:43,138 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:27:43,138 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978119967] [2022-02-21 04:27:43,138 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978119967] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:27:43,138 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:27:43,138 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:27:43,138 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [773266793] [2022-02-21 04:27:43,139 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:27:43,139 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:27:43,139 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:27:43,139 INFO L85 PathProgramCache]: Analyzing trace with hash -991631005, now seen corresponding path program 1 times [2022-02-21 04:27:43,139 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:27:43,140 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448474075] [2022-02-21 04:27:43,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:27:43,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:27:43,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:27:43,152 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:27:43,157 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:27:43,180 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:27:45,113 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:27:45,114 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:27:45,114 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:27:45,114 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:27:45,114 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:27:45,114 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:45,114 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:27:45,114 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:27:45,115 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.5.3.ufo.BOUNDED-10.pals.c_Iteration3_Loop [2022-02-21 04:27:45,115 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:27:45,115 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:27:45,133 INFO L141 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:27:45,138 INFO L141 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:27:45,140 INFO L141 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:27:45,142 INFO L141 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:27:45,145 INFO L141 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:27:45,150 INFO L141 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:27:45,152 INFO L141 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:27:45,153 INFO L141 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:27:45,157 INFO L141 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:27:45,159 INFO L141 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:27:45,161 INFO L141 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:27:45,163 INFO L141 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:27:45,165 INFO L141 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:27:45,167 INFO L141 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:27:45,170 INFO L141 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:27:45,172 INFO L141 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:27:45,174 INFO L141 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:27:45,176 INFO L141 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:27:45,179 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:45,181 INFO L141 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:27:45,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:45,187 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:45,189 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:45,275 INFO L141 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:27:45,279 INFO L141 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:27:45,283 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:45,285 INFO L141 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:27:45,286 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:45,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:45,294 INFO L141 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:27:45,296 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:45,297 INFO L141 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:27:45,299 INFO L141 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:27:45,302 INFO L141 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:27:45,303 INFO L141 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:27:45,314 INFO L141 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:27:45,318 INFO L141 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:27:45,320 INFO L141 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:27:45,322 INFO L141 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:27:45,324 INFO L141 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:27:45,328 INFO L141 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:27:46,667 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:27:46,668 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:27:46,670 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:46,670 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:46,671 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:27:46,685 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:27:46,686 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:27:46,696 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:27:46,696 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_node5_#t~ite23#1=0} Honda state: {ULTIMATE.start_node5_#t~ite23#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:27:46,708 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:27:46,715 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:27:46,716 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:46,716 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:46,721 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:27:46,726 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:27:46,728 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:27:46,728 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:27:46,749 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:27:46,749 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_node1_#t~ite7#1=0} Honda state: {ULTIMATE.start_node1_#t~ite7#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:27:46,779 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:46,779 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:46,779 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:46,780 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:27:46,782 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:27:46,783 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:27:46,783 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:27:46,808 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:27:46,808 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_node5_#t~ite22#1=0} Honda state: {ULTIMATE.start_node5_#t~ite22#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:27:46,853 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:27:46,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:46,854 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:46,865 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:27:46,871 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:27:46,871 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:27:46,893 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:27:46,906 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:27:46,906 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_node3_#t~ite14#1=0} Honda state: {ULTIMATE.start_node3_#t~ite14#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:27:46,941 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:27:46,942 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:46,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:46,943 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:27:46,976 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:27:46,977 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:27:46,986 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:27:47,053 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:27:47,053 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:47,053 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:47,055 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:27:47,070 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:27:47,071 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:27:47,071 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:27:47,255 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:27:47,258 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:27:47,259 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:27:47,259 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:27:47,259 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:27:47,259 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:27:47,259 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:27:47,259 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:47,259 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:27:47,259 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:27:47,259 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.5.3.ufo.BOUNDED-10.pals.c_Iteration3_Loop [2022-02-21 04:27:47,259 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:27:47,259 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:27:47,262 INFO L141 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:27:47,273 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:47,284 INFO L141 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:27:47,288 INFO L141 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:27:47,290 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:47,291 INFO L141 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:27:47,292 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:47,294 INFO L141 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:27:47,295 INFO L141 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:27:47,297 INFO L141 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:27:47,299 INFO L141 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:27:47,301 INFO L141 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:27:47,303 INFO L141 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:27:47,305 INFO L141 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:27:47,308 INFO L141 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:27:47,309 INFO L141 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:27:47,311 INFO L141 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:27:47,312 INFO L141 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:27:47,314 INFO L141 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:27:47,317 INFO L141 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:27:47,318 INFO L141 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:27:47,321 INFO L141 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:27:47,323 INFO L141 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:27:47,327 INFO L141 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:27:47,346 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:47,347 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:47,349 INFO L141 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:27:47,350 INFO L141 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:27:47,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:47,356 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:47,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:47,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:47,443 INFO L141 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:27:47,446 INFO L141 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:27:47,448 INFO L141 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:27:47,450 INFO L141 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:27:47,461 INFO L141 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:27:47,466 INFO L141 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:27:47,469 INFO L141 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:27:47,470 INFO L141 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:27:47,473 INFO L141 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:27:48,652 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:27:48,656 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:27:48,657 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:48,657 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:48,658 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:27:48,667 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:27:48,676 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:48,676 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:48,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:48,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:48,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:48,682 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:48,682 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:48,684 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:27:48,693 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:48,711 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:27:48,711 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:48,711 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:48,720 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:27:48,721 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:27:48,723 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:27:48,728 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:48,728 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:48,728 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:48,728 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:48,728 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:48,729 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:48,730 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:48,745 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:48,769 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:27:48,770 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:48,770 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:48,771 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:27:48,778 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:27:48,779 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:27:48,786 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:48,787 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:48,787 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:48,787 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:48,787 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:48,789 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:48,789 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:48,798 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:48,818 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:27:48,819 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:48,819 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:48,820 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:27:48,822 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:27:48,822 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:27:48,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:48,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:48,831 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:48,831 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:48,831 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:48,847 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:48,847 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:48,850 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:48,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:48,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:48,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:48,879 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:27:48,880 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:27:48,881 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:27:48,888 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:48,888 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:48,888 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:48,888 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:48,888 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:48,889 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:48,889 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:48,902 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:48,920 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:27:48,921 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:48,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:48,930 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:27:48,931 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:27:48,933 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:27:48,938 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:48,939 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:48,939 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:48,939 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:48,939 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:48,939 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:48,939 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:48,948 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:48,964 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:27:48,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:48,965 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:48,966 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:27:48,967 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:27:48,968 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:27:48,974 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:48,974 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:48,974 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:48,974 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:48,975 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:48,975 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:48,975 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:48,989 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:49,007 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:27:49,008 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:49,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:49,009 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:27:49,010 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:27:49,012 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:27:49,018 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:49,018 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:49,018 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:49,018 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:49,019 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:49,019 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:49,019 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:49,021 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:49,036 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:49,037 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:49,037 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:49,038 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:27:49,042 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:27:49,048 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:49,049 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:49,049 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:49,049 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:49,049 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:49,049 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:49,049 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:49,050 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:49,065 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 04:27:49,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:49,069 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:49,069 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:49,076 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:27:49,077 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:27:49,077 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:27:49,084 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:49,085 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:49,085 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:49,085 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:49,085 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:49,085 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:49,085 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:49,086 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:49,102 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-02-21 04:27:49,103 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:49,103 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:49,104 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:27:49,105 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:27:49,106 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:27:49,114 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:49,115 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:49,115 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:49,115 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:49,115 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:49,115 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:49,115 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:49,117 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:49,139 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-02-21 04:27:49,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:49,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:49,140 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:27:49,142 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:27:49,143 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:27:49,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:49,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:49,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:49,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:49,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:49,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:49,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:49,157 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:49,181 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:27:49,182 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:49,182 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:49,183 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:27:49,185 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:27:49,186 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:27:49,194 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:49,194 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:49,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:49,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:49,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:49,195 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:49,195 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:49,205 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:49,230 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:27:49,231 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:49,231 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:49,232 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:27:49,237 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:27:49,238 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:27:49,246 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:49,246 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:49,246 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:49,246 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:49,246 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:49,249 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:49,249 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:49,251 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:49,272 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2022-02-21 04:27:49,272 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:49,273 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:49,274 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:27:49,275 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:27:49,276 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:27:49,283 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:49,283 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:49,284 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:49,284 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:49,284 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:49,284 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:49,284 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:49,290 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:49,307 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Ended with exit code 0 [2022-02-21 04:27:49,307 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:49,308 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:49,309 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:27:49,310 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:27:49,311 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:27:49,317 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:49,317 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:49,317 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:49,318 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:49,318 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:49,318 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:49,318 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:49,322 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:49,340 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:27:49,341 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:49,341 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:49,342 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:49,343 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 04:27:49,345 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:27:49,351 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:49,352 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:49,352 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:49,352 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:49,352 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:49,353 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:49,353 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:49,359 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:49,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:49,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:49,379 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:49,380 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:49,382 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 04:27:49,422 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:27:49,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:49,436 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:49,436 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:49,436 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:49,436 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:49,447 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:49,448 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:49,456 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:49,483 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:49,484 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:49,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:49,486 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:49,487 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-02-21 04:27:49,488 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:27:49,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:49,497 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:49,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:49,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:49,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:49,498 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:49,498 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:49,500 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:27:49,502 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:27:49,502 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:27:49,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:49,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:49,515 INFO L229 MonitoredProcess]: Starting monitored process 27 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:49,530 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-02-21 04:27:49,531 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:27:49,531 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:27:49,531 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:27:49,532 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 19 Supporting invariants [] [2022-02-21 04:27:49,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:49,603 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:27:49,620 INFO L390 LassoCheck]: Loop: "assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1, node1_#t~ite7#1;" "assume !(0 != ~mode1~0 % 256);" "assume ~r1~0 < 4;" "assume !(0 != ~ep12~0 % 256);" "assume !(0 != ~ep13~0 % 256);" "assume !(0 != ~ep14~0 % 256);" "assume !(0 != ~ep15~0 % 256);" "~mode1~0 := 1;" "assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite8#1, node2_#t~ite9#1, node2_#t~ite10#1, node2_#t~ite11#1;" "assume !(0 != ~mode2~0 % 256);" "assume !(~r2~0 < 4);" "~mode2~0 := 1;" "assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite12#1, node3_#t~ite13#1, node3_#t~ite14#1, node3_#t~ite15#1;" "assume !(0 != ~mode3~0 % 256);" "assume !(~r3~0 < 4);" "~mode3~0 := 1;" "assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite16#1, node4_#t~ite17#1, node4_#t~ite18#1, node4_#t~ite19#1;" "assume !(0 != ~mode4~0 % 256);" "assume !(~r4~0 < 4);" "~mode4~0 := 1;" "assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite20#1, node5_#t~ite21#1, node5_#t~ite22#1, node5_#t~ite23#1;" "assume !(0 != ~mode5~0 % 256);" "assume !(~r5~0 < 4);" "~mode5~0 := 1;" "assume { :end_inline_node5 } 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;~p15_old~0 := ~p15_new~0;~p15_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;~p25_old~0 := ~p25_new~0;~p25_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;~p35_old~0 := ~p35_new~0;~p35_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;~p45_old~0 := ~p45_new~0;~p45_new~0 := ~nomsg~0;~p51_old~0 := ~p51_new~0;~p51_new~0 := ~nomsg~0;~p52_old~0 := ~p52_new~0;~p52_new~0 := ~nomsg~0;~p53_old~0 := ~p53_new~0;~p53_new~0 := ~nomsg~0;~p54_old~0 := ~p54_new~0;~p54_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 + ~st5~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 ~st5~0 + ~nl5~0 <= 1;" "assume !(~r1~0 >= 4);" "assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0;" "assume ~r1~0 < 4;" "assume !(~r1~0 >= 4);" "assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0 + ~nl5~0;" "assume ~r1~0 < 4;check_~tmp~1#1 := 1;" "check_#res#1 := check_~tmp~1#1;" "main_#t~ret80#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret80#1;havoc main_#t~ret80#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~post81#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post81#1;havoc main_#t~post81#1;" [2022-02-21 04:27:49,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:27:49,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:27:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:27:49,778 INFO L263 TraceCheckSpWp]: Trace formula consists of 694 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:27:49,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:27:49,824 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:27:50,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {6865#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(40, 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;~p15~0 := 0;~p15_old~0 := 0;~p15_new~0 := 0;~ep15~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;~p25~0 := 0;~p25_old~0 := 0;~p25_new~0 := 0;~ep25~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;~p35~0 := 0;~p35_old~0 := 0;~p35_new~0 := 0;~ep35~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;~p45~0 := 0;~p45_old~0 := 0;~p45_new~0 := 0;~ep45~0 := 0;~p51~0 := 0;~p51_old~0 := 0;~p51_new~0 := 0;~ep51~0 := 0;~p52~0 := 0;~p52_old~0 := 0;~p52_new~0 := 0;~ep52~0 := 0;~p53~0 := 0;~p53_old~0 := 0;~p53_new~0 := 0;~ep53~0 := 0;~p54~0 := 0;~p54_old~0 := 0;~p54_new~0 := 0;~ep54~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0;~id5~0 := 0;~r5~0 := 0;~st5~0 := 0;~nl5~0 := 0;~m5~0 := 0;~max5~0 := 0;~mode5~0 := 0; {6865#unseeded} is VALID [2022-02-21 04:27:50,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {6865#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc 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~nondet60#1, main_#t~nondet61#1, main_#t~nondet62#1, main_#t~nondet63#1, main_#t~nondet64#1, main_#t~nondet65#1, main_#t~nondet66#1, main_#t~nondet67#1, main_#t~nondet68#1, main_#t~nondet69#1, main_#t~nondet70#1, main_#t~nondet71#1, main_#t~nondet72#1, main_#t~nondet73#1, main_#t~nondet74#1, main_#t~nondet75#1, main_#t~nondet76#1, main_#t~nondet77#1, main_#t~nondet78#1, main_#t~ret79#1, main_#t~ret80#1, main_#t~post81#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~nondet24#1;havoc main_#t~nondet24#1;~ep13~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep14~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep15~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~ep21~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~ep23~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~ep24~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~ep25~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~ep31~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~ep32~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~ep34~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~ep35~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~ep41~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~ep42~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~ep43~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~ep45~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~ep51~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~ep52~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~ep53~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~ep54~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~id1~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~r1~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~st1~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~nl1~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~m1~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~max1~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~mode1~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~id2~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~r2~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~st2~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~nl2~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~m2~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;~max2~0 := main_#t~nondet56#1;havoc main_#t~nondet56#1;~mode2~0 := main_#t~nondet57#1;havoc main_#t~nondet57#1;~id3~0 := main_#t~nondet58#1;havoc main_#t~nondet58#1;~r3~0 := main_#t~nondet59#1;havoc main_#t~nondet59#1;~st3~0 := main_#t~nondet60#1;havoc main_#t~nondet60#1;~nl3~0 := main_#t~nondet61#1;havoc main_#t~nondet61#1;~m3~0 := main_#t~nondet62#1;havoc main_#t~nondet62#1;~max3~0 := main_#t~nondet63#1;havoc main_#t~nondet63#1;~mode3~0 := main_#t~nondet64#1;havoc main_#t~nondet64#1;~id4~0 := main_#t~nondet65#1;havoc main_#t~nondet65#1;~r4~0 := main_#t~nondet66#1;havoc main_#t~nondet66#1;~st4~0 := main_#t~nondet67#1;havoc main_#t~nondet67#1;~nl4~0 := main_#t~nondet68#1;havoc main_#t~nondet68#1;~m4~0 := main_#t~nondet69#1;havoc main_#t~nondet69#1;~max4~0 := main_#t~nondet70#1;havoc main_#t~nondet70#1;~mode4~0 := main_#t~nondet71#1;havoc main_#t~nondet71#1;~id5~0 := main_#t~nondet72#1;havoc main_#t~nondet72#1;~r5~0 := main_#t~nondet73#1;havoc main_#t~nondet73#1;~st5~0 := main_#t~nondet74#1;havoc main_#t~nondet74#1;~nl5~0 := main_#t~nondet75#1;havoc main_#t~nondet75#1;~m5~0 := main_#t~nondet76#1;havoc main_#t~nondet76#1;~max5~0 := main_#t~nondet77#1;havoc main_#t~nondet77#1;~mode5~0 := main_#t~nondet78#1;havoc main_#t~nondet78#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r151~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r251~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r351~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r451~0#1, init_~r511~0#1, init_~r521~0#1, init_~r531~0#1, init_~r541~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_~r152~0#1, init_~tmp___2~0#1, init_~r212~0#1, init_~tmp___3~0#1, init_~r232~0#1, init_~tmp___4~0#1, init_~r242~0#1, init_~tmp___5~0#1, init_~r252~0#1, init_~tmp___6~0#1, init_~r312~0#1, init_~tmp___7~0#1, init_~r322~0#1, init_~tmp___8~0#1, init_~r342~0#1, init_~tmp___9~0#1, init_~r352~0#1, init_~tmp___10~0#1, init_~r412~0#1, init_~tmp___11~0#1, init_~r422~0#1, init_~tmp___12~0#1, init_~r432~0#1, init_~tmp___13~0#1, init_~r452~0#1, init_~tmp___14~0#1, init_~r512~0#1, init_~tmp___15~0#1, init_~r522~0#1, init_~tmp___16~0#1, init_~r532~0#1, init_~tmp___17~0#1, init_~r542~0#1, init_~tmp___18~0#1, init_~r123~0#1, init_~tmp___19~0#1, init_~r133~0#1, init_~tmp___20~0#1, init_~r143~0#1, init_~tmp___21~0#1, init_~r153~0#1, init_~tmp___22~0#1, init_~r213~0#1, init_~tmp___23~0#1, init_~r233~0#1, init_~tmp___24~0#1, init_~r243~0#1, init_~tmp___25~0#1, init_~r253~0#1, init_~tmp___26~0#1, init_~r313~0#1, init_~tmp___27~0#1, init_~r323~0#1, init_~tmp___28~0#1, init_~r343~0#1, init_~tmp___29~0#1, init_~r353~0#1, init_~tmp___30~0#1, init_~r413~0#1, init_~tmp___31~0#1, init_~r423~0#1, init_~tmp___32~0#1, init_~r433~0#1, init_~tmp___33~0#1, init_~r453~0#1, init_~tmp___34~0#1, init_~r513~0#1, init_~tmp___35~0#1, init_~r523~0#1, init_~tmp___36~0#1, init_~r533~0#1, init_~tmp___37~0#1, init_~r543~0#1, init_~tmp___38~0#1, init_~r124~0#1, init_~tmp___39~0#1, init_~r134~0#1, init_~tmp___40~0#1, init_~r144~0#1, init_~tmp___41~0#1, init_~r154~0#1, init_~tmp___42~0#1, init_~r214~0#1, init_~tmp___43~0#1, init_~r234~0#1, init_~tmp___44~0#1, init_~r244~0#1, init_~tmp___45~0#1, init_~r254~0#1, init_~tmp___46~0#1, init_~r314~0#1, init_~tmp___47~0#1, init_~r324~0#1, init_~tmp___48~0#1, init_~r344~0#1, init_~tmp___49~0#1, init_~r354~0#1, init_~tmp___50~0#1, init_~r414~0#1, init_~tmp___51~0#1, init_~r424~0#1, init_~tmp___52~0#1, init_~r434~0#1, init_~tmp___53~0#1, init_~r454~0#1, init_~tmp___54~0#1, init_~r514~0#1, init_~tmp___55~0#1, init_~r524~0#1, init_~tmp___56~0#1, init_~r534~0#1, init_~tmp___57~0#1, init_~r544~0#1, init_~tmp___58~0#1, init_~tmp___59~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r151~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r251~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r351~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r451~0#1;havoc init_~r511~0#1;havoc init_~r521~0#1;havoc init_~r531~0#1;havoc init_~r541~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_~r152~0#1;havoc init_~tmp___2~0#1;havoc init_~r212~0#1;havoc init_~tmp___3~0#1;havoc init_~r232~0#1;havoc init_~tmp___4~0#1;havoc init_~r242~0#1;havoc init_~tmp___5~0#1;havoc init_~r252~0#1;havoc init_~tmp___6~0#1;havoc init_~r312~0#1;havoc init_~tmp___7~0#1;havoc init_~r322~0#1;havoc init_~tmp___8~0#1;havoc init_~r342~0#1;havoc init_~tmp___9~0#1;havoc init_~r352~0#1;havoc init_~tmp___10~0#1;havoc init_~r412~0#1;havoc init_~tmp___11~0#1;havoc init_~r422~0#1;havoc init_~tmp___12~0#1;havoc init_~r432~0#1;havoc init_~tmp___13~0#1;havoc init_~r452~0#1;havoc init_~tmp___14~0#1;havoc init_~r512~0#1;havoc init_~tmp___15~0#1;havoc init_~r522~0#1;havoc init_~tmp___16~0#1;havoc init_~r532~0#1;havoc init_~tmp___17~0#1;havoc init_~r542~0#1;havoc init_~tmp___18~0#1;havoc init_~r123~0#1;havoc init_~tmp___19~0#1;havoc init_~r133~0#1;havoc init_~tmp___20~0#1;havoc init_~r143~0#1;havoc init_~tmp___21~0#1;havoc init_~r153~0#1;havoc init_~tmp___22~0#1;havoc init_~r213~0#1;havoc init_~tmp___23~0#1;havoc init_~r233~0#1;havoc init_~tmp___24~0#1;havoc init_~r243~0#1;havoc init_~tmp___25~0#1;havoc init_~r253~0#1;havoc init_~tmp___26~0#1;havoc init_~r313~0#1;havoc init_~tmp___27~0#1;havoc init_~r323~0#1;havoc init_~tmp___28~0#1;havoc init_~r343~0#1;havoc init_~tmp___29~0#1;havoc init_~r353~0#1;havoc init_~tmp___30~0#1;havoc init_~r413~0#1;havoc init_~tmp___31~0#1;havoc init_~r423~0#1;havoc init_~tmp___32~0#1;havoc init_~r433~0#1;havoc init_~tmp___33~0#1;havoc init_~r453~0#1;havoc init_~tmp___34~0#1;havoc init_~r513~0#1;havoc init_~tmp___35~0#1;havoc init_~r523~0#1;havoc init_~tmp___36~0#1;havoc init_~r533~0#1;havoc init_~tmp___37~0#1;havoc init_~r543~0#1;havoc init_~tmp___38~0#1;havoc init_~r124~0#1;havoc init_~tmp___39~0#1;havoc init_~r134~0#1;havoc init_~tmp___40~0#1;havoc init_~r144~0#1;havoc init_~tmp___41~0#1;havoc init_~r154~0#1;havoc init_~tmp___42~0#1;havoc init_~r214~0#1;havoc init_~tmp___43~0#1;havoc init_~r234~0#1;havoc init_~tmp___44~0#1;havoc init_~r244~0#1;havoc init_~tmp___45~0#1;havoc init_~r254~0#1;havoc init_~tmp___46~0#1;havoc init_~r314~0#1;havoc init_~tmp___47~0#1;havoc init_~r324~0#1;havoc init_~tmp___48~0#1;havoc init_~r344~0#1;havoc init_~tmp___49~0#1;havoc init_~r354~0#1;havoc init_~tmp___50~0#1;havoc init_~r414~0#1;havoc init_~tmp___51~0#1;havoc init_~r424~0#1;havoc init_~tmp___52~0#1;havoc init_~r434~0#1;havoc init_~tmp___53~0#1;havoc init_~r454~0#1;havoc init_~tmp___54~0#1;havoc init_~r514~0#1;havoc init_~tmp___55~0#1;havoc init_~r524~0#1;havoc init_~tmp___56~0#1;havoc init_~r534~0#1;havoc init_~tmp___57~0#1;havoc init_~r544~0#1;havoc init_~tmp___58~0#1;havoc init_~tmp___59~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r151~0#1 := ~ep15~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r251~0#1 := ~ep25~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r351~0#1 := ~ep35~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0;init_~r451~0#1 := ~ep45~0;init_~r511~0#1 := ~ep51~0;init_~r521~0#1 := ~ep52~0;init_~r531~0#1 := ~ep53~0;init_~r541~0#1 := ~ep54~0; {6865#unseeded} is VALID [2022-02-21 04:27:50,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {6865#unseeded} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,057 INFO L290 TraceCheckUtils]: 3: Hoare triple {6865#unseeded} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,058 INFO L290 TraceCheckUtils]: 4: Hoare triple {6865#unseeded} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,058 INFO L290 TraceCheckUtils]: 5: Hoare triple {6865#unseeded} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,059 INFO L290 TraceCheckUtils]: 6: Hoare triple {6865#unseeded} assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {6865#unseeded} init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,059 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:50,062 INFO L290 TraceCheckUtils]: 8: Hoare triple {6865#unseeded} assume 0 != init_~r151~0#1 % 256;init_~tmp___2~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,062 INFO L290 TraceCheckUtils]: 9: Hoare triple {6865#unseeded} init_~r152~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,062 INFO L290 TraceCheckUtils]: 10: Hoare triple {6865#unseeded} assume 0 != init_~r211~0#1 % 256;init_~tmp___3~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,063 INFO L290 TraceCheckUtils]: 11: Hoare triple {6865#unseeded} init_~r212~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {6865#unseeded} assume 0 != init_~r231~0#1 % 256;init_~tmp___4~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {6865#unseeded} init_~r232~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,063 INFO L290 TraceCheckUtils]: 14: Hoare triple {6865#unseeded} assume 0 != init_~r241~0#1 % 256;init_~tmp___5~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,064 INFO L290 TraceCheckUtils]: 15: Hoare triple {6865#unseeded} init_~r242~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,064 INFO L290 TraceCheckUtils]: 16: Hoare triple {6865#unseeded} assume 0 != init_~r251~0#1 % 256;init_~tmp___6~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,064 INFO L290 TraceCheckUtils]: 17: Hoare triple {6865#unseeded} init_~r252~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,065 INFO L290 TraceCheckUtils]: 18: Hoare triple {6865#unseeded} assume 0 != init_~r311~0#1 % 256;init_~tmp___7~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,065 INFO L290 TraceCheckUtils]: 19: Hoare triple {6865#unseeded} init_~r312~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,065 INFO L290 TraceCheckUtils]: 20: Hoare triple {6865#unseeded} assume 0 != init_~r321~0#1 % 256;init_~tmp___8~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,065 INFO L290 TraceCheckUtils]: 21: Hoare triple {6865#unseeded} init_~r322~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,066 INFO L290 TraceCheckUtils]: 22: Hoare triple {6865#unseeded} assume 0 != init_~r341~0#1 % 256;init_~tmp___9~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,066 INFO L290 TraceCheckUtils]: 23: Hoare triple {6865#unseeded} init_~r342~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,066 INFO L290 TraceCheckUtils]: 24: Hoare triple {6865#unseeded} assume 0 != init_~r351~0#1 % 256;init_~tmp___10~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,066 INFO L290 TraceCheckUtils]: 25: Hoare triple {6865#unseeded} init_~r352~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,067 INFO L290 TraceCheckUtils]: 26: Hoare triple {6865#unseeded} assume 0 != init_~r411~0#1 % 256;init_~tmp___11~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,067 INFO L290 TraceCheckUtils]: 27: Hoare triple {6865#unseeded} init_~r412~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,067 INFO L290 TraceCheckUtils]: 28: Hoare triple {6865#unseeded} assume 0 != init_~r421~0#1 % 256;init_~tmp___12~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,067 INFO L290 TraceCheckUtils]: 29: Hoare triple {6865#unseeded} init_~r422~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,068 INFO L290 TraceCheckUtils]: 30: Hoare triple {6865#unseeded} assume 0 != init_~r431~0#1 % 256;init_~tmp___13~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,068 INFO L290 TraceCheckUtils]: 31: Hoare triple {6865#unseeded} init_~r432~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,068 INFO L290 TraceCheckUtils]: 32: Hoare triple {6865#unseeded} assume 0 != init_~r451~0#1 % 256;init_~tmp___14~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,069 INFO L290 TraceCheckUtils]: 33: Hoare triple {6865#unseeded} init_~r452~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,069 INFO L290 TraceCheckUtils]: 34: Hoare triple {6865#unseeded} assume 0 != init_~r511~0#1 % 256;init_~tmp___15~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,069 INFO L290 TraceCheckUtils]: 35: Hoare triple {6865#unseeded} init_~r512~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,069 INFO L290 TraceCheckUtils]: 36: Hoare triple {6865#unseeded} assume 0 != init_~r521~0#1 % 256;init_~tmp___16~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,070 INFO L290 TraceCheckUtils]: 37: Hoare triple {6865#unseeded} init_~r522~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,070 INFO L290 TraceCheckUtils]: 38: Hoare triple {6865#unseeded} assume 0 != init_~r531~0#1 % 256;init_~tmp___17~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,071 INFO L290 TraceCheckUtils]: 39: Hoare triple {6865#unseeded} init_~r532~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,071 INFO L290 TraceCheckUtils]: 40: Hoare triple {6865#unseeded} assume 0 != init_~r541~0#1 % 256;init_~tmp___18~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,071 INFO L290 TraceCheckUtils]: 41: Hoare triple {6865#unseeded} init_~r542~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,071 INFO L290 TraceCheckUtils]: 42: Hoare triple {6865#unseeded} assume 0 != init_~r122~0#1 % 256;init_~tmp___19~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,072 INFO L290 TraceCheckUtils]: 43: Hoare triple {6865#unseeded} init_~r123~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,072 INFO L290 TraceCheckUtils]: 44: Hoare triple {6865#unseeded} assume 0 != init_~r132~0#1 % 256;init_~tmp___20~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,072 INFO L290 TraceCheckUtils]: 45: Hoare triple {6865#unseeded} init_~r133~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,073 INFO L290 TraceCheckUtils]: 46: Hoare triple {6865#unseeded} assume 0 != init_~r142~0#1 % 256;init_~tmp___21~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,073 INFO L290 TraceCheckUtils]: 47: Hoare triple {6865#unseeded} init_~r143~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,073 INFO L290 TraceCheckUtils]: 48: Hoare triple {6865#unseeded} assume 0 != init_~r152~0#1 % 256;init_~tmp___22~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,073 INFO L290 TraceCheckUtils]: 49: Hoare triple {6865#unseeded} init_~r153~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,074 INFO L290 TraceCheckUtils]: 50: Hoare triple {6865#unseeded} assume 0 != init_~r212~0#1 % 256;init_~tmp___23~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,074 INFO L290 TraceCheckUtils]: 51: Hoare triple {6865#unseeded} init_~r213~0#1 := (if 0 == init_~tmp___23~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,074 INFO L290 TraceCheckUtils]: 52: Hoare triple {6865#unseeded} assume 0 != init_~r232~0#1 % 256;init_~tmp___24~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,074 INFO L290 TraceCheckUtils]: 53: Hoare triple {6865#unseeded} init_~r233~0#1 := (if 0 == init_~tmp___24~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,075 INFO L290 TraceCheckUtils]: 54: Hoare triple {6865#unseeded} assume 0 != init_~r242~0#1 % 256;init_~tmp___25~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,079 INFO L290 TraceCheckUtils]: 55: Hoare triple {6865#unseeded} init_~r243~0#1 := (if 0 == init_~tmp___25~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,079 INFO L290 TraceCheckUtils]: 56: Hoare triple {6865#unseeded} assume 0 != init_~r252~0#1 % 256;init_~tmp___26~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,080 INFO L290 TraceCheckUtils]: 57: Hoare triple {6865#unseeded} init_~r253~0#1 := (if 0 == init_~tmp___26~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,080 INFO L290 TraceCheckUtils]: 58: Hoare triple {6865#unseeded} assume 0 != init_~r312~0#1 % 256;init_~tmp___27~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,080 INFO L290 TraceCheckUtils]: 59: Hoare triple {6865#unseeded} init_~r313~0#1 := (if 0 == init_~tmp___27~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,080 INFO L290 TraceCheckUtils]: 60: Hoare triple {6865#unseeded} assume 0 != init_~r322~0#1 % 256;init_~tmp___28~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,081 INFO L290 TraceCheckUtils]: 61: Hoare triple {6865#unseeded} init_~r323~0#1 := (if 0 == init_~tmp___28~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,082 INFO L290 TraceCheckUtils]: 62: Hoare triple {6865#unseeded} assume 0 != init_~r342~0#1 % 256;init_~tmp___29~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,083 INFO L290 TraceCheckUtils]: 63: Hoare triple {6865#unseeded} init_~r343~0#1 := (if 0 == init_~tmp___29~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,084 INFO L290 TraceCheckUtils]: 64: Hoare triple {6865#unseeded} assume 0 != init_~r352~0#1 % 256;init_~tmp___30~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,084 INFO L290 TraceCheckUtils]: 65: Hoare triple {6865#unseeded} init_~r353~0#1 := (if 0 == init_~tmp___30~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,085 INFO L290 TraceCheckUtils]: 66: Hoare triple {6865#unseeded} assume 0 != init_~r412~0#1 % 256;init_~tmp___31~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,085 INFO L290 TraceCheckUtils]: 67: Hoare triple {6865#unseeded} init_~r413~0#1 := (if 0 == init_~tmp___31~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,085 INFO L290 TraceCheckUtils]: 68: Hoare triple {6865#unseeded} assume 0 != init_~r422~0#1 % 256;init_~tmp___32~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,087 INFO L290 TraceCheckUtils]: 69: Hoare triple {6865#unseeded} init_~r423~0#1 := (if 0 == init_~tmp___32~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,087 INFO L290 TraceCheckUtils]: 70: Hoare triple {6865#unseeded} assume 0 != init_~r432~0#1 % 256;init_~tmp___33~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,088 INFO L290 TraceCheckUtils]: 71: Hoare triple {6865#unseeded} init_~r433~0#1 := (if 0 == init_~tmp___33~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,088 INFO L290 TraceCheckUtils]: 72: Hoare triple {6865#unseeded} assume 0 != init_~r452~0#1 % 256;init_~tmp___34~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,088 INFO L290 TraceCheckUtils]: 73: Hoare triple {6865#unseeded} init_~r453~0#1 := (if 0 == init_~tmp___34~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,089 INFO L290 TraceCheckUtils]: 74: Hoare triple {6865#unseeded} assume 0 != init_~r512~0#1 % 256;init_~tmp___35~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,089 INFO L290 TraceCheckUtils]: 75: Hoare triple {6865#unseeded} init_~r513~0#1 := (if 0 == init_~tmp___35~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,089 INFO L290 TraceCheckUtils]: 76: Hoare triple {6865#unseeded} assume 0 != init_~r522~0#1 % 256;init_~tmp___36~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,089 INFO L290 TraceCheckUtils]: 77: Hoare triple {6865#unseeded} init_~r523~0#1 := (if 0 == init_~tmp___36~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,090 INFO L290 TraceCheckUtils]: 78: Hoare triple {6865#unseeded} assume 0 != init_~r532~0#1 % 256;init_~tmp___37~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,090 INFO L290 TraceCheckUtils]: 79: Hoare triple {6865#unseeded} init_~r533~0#1 := (if 0 == init_~tmp___37~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,090 INFO L290 TraceCheckUtils]: 80: Hoare triple {6865#unseeded} assume 0 != init_~r542~0#1 % 256;init_~tmp___38~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,090 INFO L290 TraceCheckUtils]: 81: Hoare triple {6865#unseeded} init_~r543~0#1 := (if 0 == init_~tmp___38~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,091 INFO L290 TraceCheckUtils]: 82: Hoare triple {6865#unseeded} assume 0 != init_~r123~0#1 % 256;init_~tmp___39~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,091 INFO L290 TraceCheckUtils]: 83: Hoare triple {6865#unseeded} init_~r124~0#1 := (if 0 == init_~tmp___39~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,091 INFO L290 TraceCheckUtils]: 84: Hoare triple {6865#unseeded} assume 0 != init_~r133~0#1 % 256;init_~tmp___40~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,091 INFO L290 TraceCheckUtils]: 85: Hoare triple {6865#unseeded} init_~r134~0#1 := (if 0 == init_~tmp___40~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,092 INFO L290 TraceCheckUtils]: 86: Hoare triple {6865#unseeded} assume 0 != init_~r143~0#1 % 256;init_~tmp___41~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,092 INFO L290 TraceCheckUtils]: 87: Hoare triple {6865#unseeded} init_~r144~0#1 := (if 0 == init_~tmp___41~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,092 INFO L290 TraceCheckUtils]: 88: Hoare triple {6865#unseeded} assume 0 != init_~r153~0#1 % 256;init_~tmp___42~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,092 INFO L290 TraceCheckUtils]: 89: Hoare triple {6865#unseeded} init_~r154~0#1 := (if 0 == init_~tmp___42~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,093 INFO L290 TraceCheckUtils]: 90: Hoare triple {6865#unseeded} assume 0 != init_~r213~0#1 % 256;init_~tmp___43~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,093 INFO L290 TraceCheckUtils]: 91: Hoare triple {6865#unseeded} init_~r214~0#1 := (if 0 == init_~tmp___43~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,093 INFO L290 TraceCheckUtils]: 92: Hoare triple {6865#unseeded} assume 0 != init_~r233~0#1 % 256;init_~tmp___44~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,093 INFO L290 TraceCheckUtils]: 93: Hoare triple {6865#unseeded} init_~r234~0#1 := (if 0 == init_~tmp___44~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,094 INFO L290 TraceCheckUtils]: 94: Hoare triple {6865#unseeded} assume 0 != init_~r243~0#1 % 256;init_~tmp___45~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,094 INFO L290 TraceCheckUtils]: 95: Hoare triple {6865#unseeded} init_~r244~0#1 := (if 0 == init_~tmp___45~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,094 INFO L290 TraceCheckUtils]: 96: Hoare triple {6865#unseeded} assume 0 != init_~r253~0#1 % 256;init_~tmp___46~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,094 INFO L290 TraceCheckUtils]: 97: Hoare triple {6865#unseeded} init_~r254~0#1 := (if 0 == init_~tmp___46~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,095 INFO L290 TraceCheckUtils]: 98: Hoare triple {6865#unseeded} assume 0 != init_~r313~0#1 % 256;init_~tmp___47~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,095 INFO L290 TraceCheckUtils]: 99: Hoare triple {6865#unseeded} init_~r314~0#1 := (if 0 == init_~tmp___47~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,095 INFO L290 TraceCheckUtils]: 100: Hoare triple {6865#unseeded} assume 0 != init_~r323~0#1 % 256;init_~tmp___48~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,095 INFO L290 TraceCheckUtils]: 101: Hoare triple {6865#unseeded} init_~r324~0#1 := (if 0 == init_~tmp___48~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,096 INFO L290 TraceCheckUtils]: 102: Hoare triple {6865#unseeded} assume 0 != init_~r343~0#1 % 256;init_~tmp___49~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,096 INFO L290 TraceCheckUtils]: 103: Hoare triple {6865#unseeded} init_~r344~0#1 := (if 0 == init_~tmp___49~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,096 INFO L290 TraceCheckUtils]: 104: Hoare triple {6865#unseeded} assume 0 != init_~r353~0#1 % 256;init_~tmp___50~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,096 INFO L290 TraceCheckUtils]: 105: Hoare triple {6865#unseeded} init_~r354~0#1 := (if 0 == init_~tmp___50~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,097 INFO L290 TraceCheckUtils]: 106: Hoare triple {6865#unseeded} assume 0 != init_~r413~0#1 % 256;init_~tmp___51~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,097 INFO L290 TraceCheckUtils]: 107: Hoare triple {6865#unseeded} init_~r414~0#1 := (if 0 == init_~tmp___51~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,097 INFO L290 TraceCheckUtils]: 108: Hoare triple {6865#unseeded} assume 0 != init_~r423~0#1 % 256;init_~tmp___52~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,097 INFO L290 TraceCheckUtils]: 109: Hoare triple {6865#unseeded} init_~r424~0#1 := (if 0 == init_~tmp___52~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,098 INFO L290 TraceCheckUtils]: 110: Hoare triple {6865#unseeded} assume 0 != init_~r433~0#1 % 256;init_~tmp___53~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,098 INFO L290 TraceCheckUtils]: 111: Hoare triple {6865#unseeded} init_~r434~0#1 := (if 0 == init_~tmp___53~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,098 INFO L290 TraceCheckUtils]: 112: Hoare triple {6865#unseeded} assume 0 != init_~r453~0#1 % 256;init_~tmp___54~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,099 INFO L290 TraceCheckUtils]: 113: Hoare triple {6865#unseeded} init_~r454~0#1 := (if 0 == init_~tmp___54~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,099 INFO L290 TraceCheckUtils]: 114: Hoare triple {6865#unseeded} assume 0 != init_~r513~0#1 % 256;init_~tmp___55~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,099 INFO L290 TraceCheckUtils]: 115: Hoare triple {6865#unseeded} init_~r514~0#1 := (if 0 == init_~tmp___55~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,099 INFO L290 TraceCheckUtils]: 116: Hoare triple {6865#unseeded} assume 0 != init_~r523~0#1 % 256;init_~tmp___56~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,100 INFO L290 TraceCheckUtils]: 117: Hoare triple {6865#unseeded} init_~r524~0#1 := (if 0 == init_~tmp___56~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,100 INFO L290 TraceCheckUtils]: 118: Hoare triple {6865#unseeded} assume 0 != init_~r533~0#1 % 256;init_~tmp___57~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,100 INFO L290 TraceCheckUtils]: 119: Hoare triple {6865#unseeded} init_~r534~0#1 := (if 0 == init_~tmp___57~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,100 INFO L290 TraceCheckUtils]: 120: Hoare triple {6865#unseeded} assume 0 != init_~r543~0#1 % 256;init_~tmp___58~0#1 := 1; {6865#unseeded} is VALID [2022-02-21 04:27:50,101 INFO L290 TraceCheckUtils]: 121: Hoare triple {6865#unseeded} init_~r544~0#1 := (if 0 == init_~tmp___58~0#1 then 0 else 1); {6865#unseeded} is VALID [2022-02-21 04:27:50,101 INFO L290 TraceCheckUtils]: 122: Hoare triple {6865#unseeded} assume !(~id1~0 != ~id2~0);init_~tmp___59~0#1 := 0; {6865#unseeded} is VALID [2022-02-21 04:27:50,101 INFO L290 TraceCheckUtils]: 123: Hoare triple {6865#unseeded} init_#res#1 := init_~tmp___59~0#1; {6865#unseeded} is VALID [2022-02-21 04:27:50,101 INFO L290 TraceCheckUtils]: 124: Hoare triple {6865#unseeded} main_#t~ret79#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret79#1;havoc main_#t~ret79#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; {6865#unseeded} is VALID [2022-02-21 04:27:50,102 INFO L290 TraceCheckUtils]: 125: Hoare triple {6865#unseeded} assume !(0 == assume_abort_if_not_~cond#1); {6865#unseeded} is VALID [2022-02-21 04:27:50,102 INFO L290 TraceCheckUtils]: 126: Hoare triple {6865#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;~p15_old~0 := ~nomsg~0;~p15_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;~p25_old~0 := ~nomsg~0;~p25_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;~p35_old~0 := ~nomsg~0;~p35_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;~p45_old~0 := ~nomsg~0;~p45_new~0 := ~nomsg~0;~p51_old~0 := ~nomsg~0;~p51_new~0 := ~nomsg~0;~p52_old~0 := ~nomsg~0;~p52_new~0 := ~nomsg~0;~p53_old~0 := ~nomsg~0;~p53_new~0 := ~nomsg~0;~p54_old~0 := ~nomsg~0;~p54_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {6865#unseeded} is VALID [2022-02-21 04:27:50,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:27:50,133 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:27:50,153 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:27:50,154 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:27:50,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {6868#(>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|)))} assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1, node1_#t~ite7#1; {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:50,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(0 != ~mode1~0 % 256); {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:50,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume ~r1~0 < 4; {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:50,468 INFO L290 TraceCheckUtils]: 3: Hoare triple {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(0 != ~ep12~0 % 256); {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:50,468 INFO L290 TraceCheckUtils]: 4: Hoare triple {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(0 != ~ep13~0 % 256); {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:50,469 INFO L290 TraceCheckUtils]: 5: Hoare triple {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(0 != ~ep14~0 % 256); {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:50,469 INFO L290 TraceCheckUtils]: 6: Hoare triple {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(0 != ~ep15~0 % 256); {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:50,470 INFO L290 TraceCheckUtils]: 7: Hoare triple {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} ~mode1~0 := 1; {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:50,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite8#1, node2_#t~ite9#1, node2_#t~ite10#1, node2_#t~ite11#1; {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:50,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(0 != ~mode2~0 % 256); {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:50,471 INFO L290 TraceCheckUtils]: 10: Hoare triple {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(~r2~0 < 4); {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:50,471 INFO L290 TraceCheckUtils]: 11: Hoare triple {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} ~mode2~0 := 1; {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:50,471 INFO L290 TraceCheckUtils]: 12: Hoare triple {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite12#1, node3_#t~ite13#1, node3_#t~ite14#1, node3_#t~ite15#1; {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:50,472 INFO L290 TraceCheckUtils]: 13: Hoare triple {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(0 != ~mode3~0 % 256); {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:50,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(~r3~0 < 4); {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:50,472 INFO L290 TraceCheckUtils]: 15: Hoare triple {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} ~mode3~0 := 1; {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:50,473 INFO L290 TraceCheckUtils]: 16: Hoare triple {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite16#1, node4_#t~ite17#1, node4_#t~ite18#1, node4_#t~ite19#1; {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:50,473 INFO L290 TraceCheckUtils]: 17: Hoare triple {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(0 != ~mode4~0 % 256); {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:50,474 INFO L290 TraceCheckUtils]: 18: Hoare triple {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(~r4~0 < 4); {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:50,474 INFO L290 TraceCheckUtils]: 19: Hoare triple {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} ~mode4~0 := 1; {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:50,474 INFO L290 TraceCheckUtils]: 20: Hoare triple {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite20#1, node5_#t~ite21#1, node5_#t~ite22#1, node5_#t~ite23#1; {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:50,475 INFO L290 TraceCheckUtils]: 21: Hoare triple {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(0 != ~mode5~0 % 256); {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:50,475 INFO L290 TraceCheckUtils]: 22: Hoare triple {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(~r5~0 < 4); {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:50,475 INFO L290 TraceCheckUtils]: 23: Hoare triple {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} ~mode5~0 := 1; {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:50,476 INFO L290 TraceCheckUtils]: 24: Hoare triple {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume { :end_inline_node5 } 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;~p15_old~0 := ~p15_new~0;~p15_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;~p25_old~0 := ~p25_new~0;~p25_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;~p35_old~0 := ~p35_new~0;~p35_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;~p45_old~0 := ~p45_new~0;~p45_new~0 := ~nomsg~0;~p51_old~0 := ~p51_new~0;~p51_new~0 := ~nomsg~0;~p52_old~0 := ~p52_new~0;~p52_new~0 := ~nomsg~0;~p53_old~0 := ~p53_new~0;~p53_new~0 := ~nomsg~0;~p54_old~0 := ~p54_new~0;~p54_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:50,476 INFO L290 TraceCheckUtils]: 25: Hoare triple {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:50,477 INFO L290 TraceCheckUtils]: 26: Hoare triple {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume ~st1~0 + ~nl1~0 <= 1; {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:50,477 INFO L290 TraceCheckUtils]: 27: Hoare triple {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume ~st2~0 + ~nl2~0 <= 1; {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:50,477 INFO L290 TraceCheckUtils]: 28: Hoare triple {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume ~st3~0 + ~nl3~0 <= 1; {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:50,478 INFO L290 TraceCheckUtils]: 29: Hoare triple {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume ~st4~0 + ~nl4~0 <= 1; {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:50,478 INFO L290 TraceCheckUtils]: 30: Hoare triple {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume ~st5~0 + ~nl5~0 <= 1; {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:50,478 INFO L290 TraceCheckUtils]: 31: Hoare triple {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(~r1~0 >= 4); {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:50,479 INFO L290 TraceCheckUtils]: 32: Hoare triple {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:50,479 INFO L290 TraceCheckUtils]: 33: Hoare triple {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume ~r1~0 < 4; {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:50,479 INFO L290 TraceCheckUtils]: 34: Hoare triple {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(~r1~0 >= 4); {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:50,480 INFO L290 TraceCheckUtils]: 35: Hoare triple {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0 + ~nl5~0; {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:50,480 INFO L290 TraceCheckUtils]: 36: Hoare triple {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume ~r1~0 < 4;check_~tmp~1#1 := 1; {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:50,481 INFO L290 TraceCheckUtils]: 37: Hoare triple {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} check_#res#1 := check_~tmp~1#1; {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:50,481 INFO L290 TraceCheckUtils]: 38: Hoare triple {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} main_#t~ret80#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret80#1;havoc main_#t~ret80#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; {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:50,481 INFO L290 TraceCheckUtils]: 39: Hoare triple {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(0 == assert_~arg#1 % 256); {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:27:50,482 INFO L290 TraceCheckUtils]: 40: Hoare triple {7261#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume { :end_inline_assert } true;main_#t~post81#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post81#1;havoc main_#t~post81#1; {6878#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|)))))} is VALID [2022-02-21 04:27:50,482 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:27:50,483 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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:27:50,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 168 edges. 168 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:27:50,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 127 letters. Loop has 41 letters. [2022-02-21 04:27:50,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:50,524 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:27:50,525 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 828 states and 1493 transitions. cyclomatic complexity: 666 Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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:27:51,473 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 828 states and 1493 transitions. cyclomatic complexity: 666. Second operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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 1109 states and 1960 transitions. Complement of second has 4 states. [2022-02-21 04:27:51,474 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:27:51,474 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:27:51,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 828 states and 1493 transitions. cyclomatic complexity: 666 [2022-02-21 04:27:51,474 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:27:51,474 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:27:51,474 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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:27:51,485 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:27:51,499 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:27:51,499 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:27:51,499 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1109 states and 1960 transitions. [2022-02-21 04:27:51,508 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:27:51,523 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:27:51,526 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 828 states and 1493 transitions. cyclomatic complexity: 666 [2022-02-21 04:27:51,781 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 282 examples of accepted words. [2022-02-21 04:27:51,782 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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:27:51,789 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:27:51,790 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:27:51,790 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 [2022-02-21 04:27:51,790 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 [2022-02-21 04:27:51,790 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:27:51,790 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:27:51,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 127 letters. Loop has 41 letters. [2022-02-21 04:27:51,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 127 letters. Loop has 41 letters. [2022-02-21 04:27:51,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 127 letters. Loop has 41 letters. [2022-02-21 04:27:51,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:27:51,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states 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:27:51,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:27:51,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 1109 letters. Loop has 1109 letters. [2022-02-21 04:27:51,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1109 letters. Loop has 1109 letters. [2022-02-21 04:27:51,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 1109 letters. Loop has 1109 letters. [2022-02-21 04:27:51,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 828 letters. Loop has 828 letters. [2022-02-21 04:27:51,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 828 letters. Loop has 828 letters. [2022-02-21 04:27:51,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 828 letters. Loop has 828 letters. [2022-02-21 04:27:51,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:27:51,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states 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:27:51,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:27:51,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 150 letters. Loop has 47 letters. [2022-02-21 04:27:51,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 150 letters. Loop has 47 letters. [2022-02-21 04:27:51,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 150 letters. Loop has 47 letters. [2022-02-21 04:27:51,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 149 letters. Loop has 46 letters. [2022-02-21 04:27:51,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 149 letters. Loop has 46 letters. [2022-02-21 04:27:51,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 149 letters. Loop has 46 letters. [2022-02-21 04:27:51,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 148 letters. Loop has 45 letters. [2022-02-21 04:27:51,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 148 letters. Loop has 45 letters. [2022-02-21 04:27:51,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 148 letters. Loop has 45 letters. [2022-02-21 04:27:51,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 148 letters. Loop has 45 letters. [2022-02-21 04:27:51,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 148 letters. Loop has 45 letters. [2022-02-21 04:27:51,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 148 letters. Loop has 45 letters. [2022-02-21 04:27:51,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 149 letters. Loop has 47 letters. [2022-02-21 04:27:51,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 149 letters. Loop has 47 letters. [2022-02-21 04:27:51,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 149 letters. Loop has 47 letters. [2022-02-21 04:27:51,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 150 letters. Loop has 47 letters. [2022-02-21 04:27:51,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 150 letters. Loop has 47 letters. [2022-02-21 04:27:51,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 150 letters. Loop has 47 letters. [2022-02-21 04:27:51,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 148 letters. Loop has 46 letters. [2022-02-21 04:27:51,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 148 letters. Loop has 46 letters. [2022-02-21 04:27:51,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 148 letters. Loop has 46 letters. [2022-02-21 04:27:51,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 147 letters. Loop has 45 letters. [2022-02-21 04:27:51,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 147 letters. Loop has 45 letters. [2022-02-21 04:27:51,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 147 letters. Loop has 45 letters. [2022-02-21 04:27:51,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 147 letters. Loop has 46 letters. [2022-02-21 04:27:51,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 147 letters. Loop has 46 letters. [2022-02-21 04:27:51,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 147 letters. Loop has 46 letters. [2022-02-21 04:27:51,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 146 letters. Loop has 45 letters. [2022-02-21 04:27:51,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 146 letters. Loop has 45 letters. [2022-02-21 04:27:51,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 146 letters. Loop has 45 letters. [2022-02-21 04:27:51,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 146 letters. Loop has 46 letters. [2022-02-21 04:27:51,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 146 letters. Loop has 46 letters. [2022-02-21 04:27:51,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 146 letters. Loop has 46 letters. [2022-02-21 04:27:51,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 144 letters. Loop has 41 letters. [2022-02-21 04:27:51,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 144 letters. Loop has 41 letters. [2022-02-21 04:27:51,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 144 letters. Loop has 41 letters. [2022-02-21 04:27:51,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 145 letters. Loop has 45 letters. [2022-02-21 04:27:51,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 145 letters. Loop has 45 letters. [2022-02-21 04:27:51,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 145 letters. Loop has 45 letters. [2022-02-21 04:27:51,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 144 letters. Loop has 41 letters. [2022-02-21 04:27:51,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 144 letters. Loop has 41 letters. [2022-02-21 04:27:51,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 144 letters. Loop has 41 letters. [2022-02-21 04:27:51,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 143 letters. Loop has 41 letters. [2022-02-21 04:27:51,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 143 letters. Loop has 41 letters. [2022-02-21 04:27:51,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 143 letters. Loop has 41 letters. [2022-02-21 04:27:51,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 142 letters. Loop has 41 letters. [2022-02-21 04:27:51,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 142 letters. Loop has 41 letters. [2022-02-21 04:27:51,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 142 letters. Loop has 41 letters. [2022-02-21 04:27:51,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 146 letters. Loop has 45 letters. [2022-02-21 04:27:51,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 146 letters. Loop has 45 letters. [2022-02-21 04:27:51,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 146 letters. Loop has 45 letters. [2022-02-21 04:27:51,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 149 letters. Loop has 47 letters. [2022-02-21 04:27:51,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 149 letters. Loop has 47 letters. [2022-02-21 04:27:51,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 149 letters. Loop has 47 letters. [2022-02-21 04:27:51,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 147 letters. Loop has 45 letters. [2022-02-21 04:27:51,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 147 letters. Loop has 45 letters. [2022-02-21 04:27:51,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 147 letters. Loop has 45 letters. [2022-02-21 04:27:51,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 148 letters. Loop has 47 letters. [2022-02-21 04:27:51,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 148 letters. Loop has 47 letters. [2022-02-21 04:27:51,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 148 letters. Loop has 47 letters. [2022-02-21 04:27:51,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 146 letters. Loop has 46 letters. [2022-02-21 04:27:51,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 146 letters. Loop has 46 letters. [2022-02-21 04:27:51,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 146 letters. Loop has 46 letters. [2022-02-21 04:27:51,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 145 letters. Loop has 45 letters. [2022-02-21 04:27:51,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 145 letters. Loop has 45 letters. [2022-02-21 04:27:51,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,823 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 145 letters. Loop has 45 letters. [2022-02-21 04:27:51,823 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 148 letters. Loop has 47 letters. [2022-02-21 04:27:51,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 148 letters. Loop has 47 letters. [2022-02-21 04:27:51,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 148 letters. Loop has 47 letters. [2022-02-21 04:27:51,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 135 letters. Loop has 37 letters. [2022-02-21 04:27:51,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 135 letters. Loop has 37 letters. [2022-02-21 04:27:51,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 135 letters. Loop has 37 letters. [2022-02-21 04:27:51,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 147 letters. Loop has 47 letters. [2022-02-21 04:27:51,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 147 letters. Loop has 47 letters. [2022-02-21 04:27:51,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 147 letters. Loop has 47 letters. [2022-02-21 04:27:51,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 136 letters. Loop has 37 letters. [2022-02-21 04:27:51,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 136 letters. Loop has 37 letters. [2022-02-21 04:27:51,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 136 letters. Loop has 37 letters. [2022-02-21 04:27:51,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 145 letters. Loop has 46 letters. [2022-02-21 04:27:51,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 145 letters. Loop has 46 letters. [2022-02-21 04:27:51,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 145 letters. Loop has 46 letters. [2022-02-21 04:27:51,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 143 letters. Loop has 42 letters. [2022-02-21 04:27:51,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 143 letters. Loop has 42 letters. [2022-02-21 04:27:51,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 143 letters. Loop has 42 letters. [2022-02-21 04:27:51,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 144 letters. Loop has 45 letters. [2022-02-21 04:27:51,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 144 letters. Loop has 45 letters. [2022-02-21 04:27:51,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 144 letters. Loop has 45 letters. [2022-02-21 04:27:51,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 144 letters. Loop has 46 letters. [2022-02-21 04:27:51,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 144 letters. Loop has 46 letters. [2022-02-21 04:27:51,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 144 letters. Loop has 46 letters. [2022-02-21 04:27:51,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 143 letters. Loop has 45 letters. [2022-02-21 04:27:51,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 143 letters. Loop has 45 letters. [2022-02-21 04:27:51,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 143 letters. Loop has 45 letters. [2022-02-21 04:27:51,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 145 letters. Loop has 41 letters. [2022-02-21 04:27:51,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 145 letters. Loop has 41 letters. [2022-02-21 04:27:51,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 145 letters. Loop has 41 letters. [2022-02-21 04:27:51,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 143 letters. Loop has 46 letters. [2022-02-21 04:27:51,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 143 letters. Loop has 46 letters. [2022-02-21 04:27:51,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 143 letters. Loop has 46 letters. [2022-02-21 04:27:51,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 146 letters. Loop has 41 letters. [2022-02-21 04:27:51,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 146 letters. Loop has 41 letters. [2022-02-21 04:27:51,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 146 letters. Loop has 41 letters. [2022-02-21 04:27:51,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 142 letters. Loop has 45 letters. [2022-02-21 04:27:51,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 142 letters. Loop has 45 letters. [2022-02-21 04:27:51,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 142 letters. Loop has 45 letters. [2022-02-21 04:27:51,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 146 letters. Loop has 42 letters. [2022-02-21 04:27:51,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 146 letters. Loop has 42 letters. [2022-02-21 04:27:51,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 146 letters. Loop has 42 letters. [2022-02-21 04:27:51,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 142 letters. Loop has 46 letters. [2022-02-21 04:27:51,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 142 letters. Loop has 46 letters. [2022-02-21 04:27:51,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 142 letters. Loop has 46 letters. [2022-02-21 04:27:51,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 137 letters. Loop has 41 letters. [2022-02-21 04:27:51,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 137 letters. Loop has 41 letters. [2022-02-21 04:27:51,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 137 letters. Loop has 41 letters. [2022-02-21 04:27:51,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 141 letters. Loop has 45 letters. [2022-02-21 04:27:51,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 141 letters. Loop has 45 letters. [2022-02-21 04:27:51,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 141 letters. Loop has 45 letters. [2022-02-21 04:27:51,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 140 letters. Loop has 41 letters. [2022-02-21 04:27:51,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 140 letters. Loop has 41 letters. [2022-02-21 04:27:51,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 140 letters. Loop has 41 letters. [2022-02-21 04:27:51,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 141 letters. Loop has 41 letters. [2022-02-21 04:27:51,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 141 letters. Loop has 41 letters. [2022-02-21 04:27:51,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 141 letters. Loop has 41 letters. [2022-02-21 04:27:51,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 139 letters. Loop has 41 letters. [2022-02-21 04:27:51,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 139 letters. Loop has 41 letters. [2022-02-21 04:27:51,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 139 letters. Loop has 41 letters. [2022-02-21 04:27:51,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 138 letters. Loop has 41 letters. [2022-02-21 04:27:51,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 138 letters. Loop has 41 letters. [2022-02-21 04:27:51,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 138 letters. Loop has 41 letters. [2022-02-21 04:27:51,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 142 letters. Loop has 45 letters. [2022-02-21 04:27:51,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 142 letters. Loop has 45 letters. [2022-02-21 04:27:51,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 142 letters. Loop has 45 letters. [2022-02-21 04:27:51,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 142 letters. Loop has 46 letters. [2022-02-21 04:27:51,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 142 letters. Loop has 46 letters. [2022-02-21 04:27:51,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 142 letters. Loop has 46 letters. [2022-02-21 04:27:51,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 141 letters. Loop has 45 letters. [2022-02-21 04:27:51,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 141 letters. Loop has 45 letters. [2022-02-21 04:27:51,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 141 letters. Loop has 45 letters. [2022-02-21 04:27:51,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 137 letters. Loop has 41 letters. [2022-02-21 04:27:51,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 137 letters. Loop has 41 letters. [2022-02-21 04:27:51,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 137 letters. Loop has 41 letters. [2022-02-21 04:27:51,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 138 letters. Loop has 45 letters. [2022-02-21 04:27:51,857 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 138 letters. Loop has 45 letters. [2022-02-21 04:27:51,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 138 letters. Loop has 45 letters. [2022-02-21 04:27:51,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 143 letters. Loop has 47 letters. [2022-02-21 04:27:51,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 143 letters. Loop has 47 letters. [2022-02-21 04:27:51,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 143 letters. Loop has 47 letters. [2022-02-21 04:27:51,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 141 letters. Loop has 45 letters. [2022-02-21 04:27:51,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 141 letters. Loop has 45 letters. [2022-02-21 04:27:51,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 141 letters. Loop has 45 letters. [2022-02-21 04:27:51,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 142 letters. Loop has 47 letters. [2022-02-21 04:27:51,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 142 letters. Loop has 47 letters. [2022-02-21 04:27:51,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 142 letters. Loop has 47 letters. [2022-02-21 04:27:51,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 141 letters. Loop has 46 letters. [2022-02-21 04:27:51,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 141 letters. Loop has 46 letters. [2022-02-21 04:27:51,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 141 letters. Loop has 46 letters. [2022-02-21 04:27:51,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 140 letters. Loop has 45 letters. [2022-02-21 04:27:51,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 140 letters. Loop has 45 letters. [2022-02-21 04:27:51,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 140 letters. Loop has 45 letters. [2022-02-21 04:27:51,865 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 140 letters. Loop has 45 letters. [2022-02-21 04:27:51,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 140 letters. Loop has 45 letters. [2022-02-21 04:27:51,866 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,866 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 140 letters. Loop has 45 letters. [2022-02-21 04:27:51,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 150 letters. Loop has 43 letters. [2022-02-21 04:27:51,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,867 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 150 letters. Loop has 43 letters. [2022-02-21 04:27:51,867 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 150 letters. Loop has 43 letters. [2022-02-21 04:27:51,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 141 letters. Loop has 47 letters. [2022-02-21 04:27:51,868 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,868 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 141 letters. Loop has 47 letters. [2022-02-21 04:27:51,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 141 letters. Loop has 47 letters. [2022-02-21 04:27:51,869 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,869 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 151 letters. Loop has 43 letters. [2022-02-21 04:27:51,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 151 letters. Loop has 43 letters. [2022-02-21 04:27:51,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 151 letters. Loop has 43 letters. [2022-02-21 04:27:51,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 142 letters. Loop has 47 letters. [2022-02-21 04:27:51,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 142 letters. Loop has 47 letters. [2022-02-21 04:27:51,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 142 letters. Loop has 47 letters. [2022-02-21 04:27:51,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 140 letters. Loop has 46 letters. [2022-02-21 04:27:51,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 140 letters. Loop has 46 letters. [2022-02-21 04:27:51,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 140 letters. Loop has 46 letters. [2022-02-21 04:27:51,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 139 letters. Loop has 45 letters. [2022-02-21 04:27:51,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 139 letters. Loop has 45 letters. [2022-02-21 04:27:51,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 139 letters. Loop has 45 letters. [2022-02-21 04:27:51,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 139 letters. Loop has 46 letters. [2022-02-21 04:27:51,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 139 letters. Loop has 46 letters. [2022-02-21 04:27:51,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 139 letters. Loop has 46 letters. [2022-02-21 04:27:51,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 138 letters. Loop has 45 letters. [2022-02-21 04:27:51,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 138 letters. Loop has 45 letters. [2022-02-21 04:27:51,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 138 letters. Loop has 45 letters. [2022-02-21 04:27:51,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 138 letters. Loop has 46 letters. [2022-02-21 04:27:51,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 138 letters. Loop has 46 letters. [2022-02-21 04:27:51,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 138 letters. Loop has 46 letters. [2022-02-21 04:27:51,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 137 letters. Loop has 45 letters. [2022-02-21 04:27:51,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 137 letters. Loop has 45 letters. [2022-02-21 04:27:51,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 137 letters. Loop has 45 letters. [2022-02-21 04:27:51,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 145 letters. Loop has 41 letters. [2022-02-21 04:27:51,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 145 letters. Loop has 41 letters. [2022-02-21 04:27:51,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 145 letters. Loop has 41 letters. [2022-02-21 04:27:51,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 136 letters. Loop has 41 letters. [2022-02-21 04:27:51,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 136 letters. Loop has 41 letters. [2022-02-21 04:27:51,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 136 letters. Loop has 41 letters. [2022-02-21 04:27:51,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 145 letters. Loop has 42 letters. [2022-02-21 04:27:51,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 145 letters. Loop has 42 letters. [2022-02-21 04:27:51,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 145 letters. Loop has 42 letters. [2022-02-21 04:27:51,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 135 letters. Loop has 41 letters. [2022-02-21 04:27:51,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 135 letters. Loop has 41 letters. [2022-02-21 04:27:51,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 135 letters. Loop has 41 letters. [2022-02-21 04:27:51,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 136 letters. Loop has 41 letters. [2022-02-21 04:27:51,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 136 letters. Loop has 41 letters. [2022-02-21 04:27:51,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 136 letters. Loop has 41 letters. [2022-02-21 04:27:51,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 141 letters. Loop has 47 letters. [2022-02-21 04:27:51,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 141 letters. Loop has 47 letters. [2022-02-21 04:27:51,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 141 letters. Loop has 47 letters. [2022-02-21 04:27:51,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 137 letters. Loop has 41 letters. [2022-02-21 04:27:51,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 137 letters. Loop has 41 letters. [2022-02-21 04:27:51,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 137 letters. Loop has 41 letters. [2022-02-21 04:27:51,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 139 letters. Loop has 45 letters. [2022-02-21 04:27:51,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 139 letters. Loop has 45 letters. [2022-02-21 04:27:51,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 139 letters. Loop has 45 letters. [2022-02-21 04:27:51,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 137 letters. Loop has 42 letters. [2022-02-21 04:27:51,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 137 letters. Loop has 42 letters. [2022-02-21 04:27:51,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 137 letters. Loop has 42 letters. [2022-02-21 04:27:51,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 140 letters. Loop has 47 letters. [2022-02-21 04:27:51,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 140 letters. Loop has 47 letters. [2022-02-21 04:27:51,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 140 letters. Loop has 47 letters. [2022-02-21 04:27:51,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 140 letters. Loop has 47 letters. [2022-02-21 04:27:51,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 140 letters. Loop has 47 letters. [2022-02-21 04:27:51,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 140 letters. Loop has 47 letters. [2022-02-21 04:27:51,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 139 letters. Loop has 47 letters. [2022-02-21 04:27:51,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 139 letters. Loop has 47 letters. [2022-02-21 04:27:51,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 139 letters. Loop has 47 letters. [2022-02-21 04:27:51,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 142 letters. Loop has 45 letters. [2022-02-21 04:27:51,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 142 letters. Loop has 45 letters. [2022-02-21 04:27:51,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 142 letters. Loop has 45 letters. [2022-02-21 04:27:51,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 147 letters. Loop has 47 letters. [2022-02-21 04:27:51,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 147 letters. Loop has 47 letters. [2022-02-21 04:27:51,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 147 letters. Loop has 47 letters. [2022-02-21 04:27:51,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 145 letters. Loop has 45 letters. [2022-02-21 04:27:51,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 145 letters. Loop has 45 letters. [2022-02-21 04:27:51,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 145 letters. Loop has 45 letters. [2022-02-21 04:27:51,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 146 letters. Loop has 47 letters. [2022-02-21 04:27:51,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 146 letters. Loop has 47 letters. [2022-02-21 04:27:51,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 146 letters. Loop has 47 letters. [2022-02-21 04:27:51,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 144 letters. Loop has 45 letters. [2022-02-21 04:27:51,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 144 letters. Loop has 45 letters. [2022-02-21 04:27:51,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 144 letters. Loop has 45 letters. [2022-02-21 04:27:51,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 150 letters. Loop has 37 letters. [2022-02-21 04:27:51,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 150 letters. Loop has 37 letters. [2022-02-21 04:27:51,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 150 letters. Loop has 37 letters. [2022-02-21 04:27:51,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 145 letters. Loop has 47 letters. [2022-02-21 04:27:51,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 145 letters. Loop has 47 letters. [2022-02-21 04:27:51,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 145 letters. Loop has 47 letters. [2022-02-21 04:27:51,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 146 letters. Loop has 47 letters. [2022-02-21 04:27:51,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 146 letters. Loop has 47 letters. [2022-02-21 04:27:51,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 146 letters. Loop has 47 letters. [2022-02-21 04:27:51,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 148 letters. Loop has 41 letters. [2022-02-21 04:27:51,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 148 letters. Loop has 41 letters. [2022-02-21 04:27:51,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 148 letters. Loop has 41 letters. [2022-02-21 04:27:51,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 145 letters. Loop has 47 letters. [2022-02-21 04:27:51,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 145 letters. Loop has 47 letters. [2022-02-21 04:27:51,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 145 letters. Loop has 47 letters. [2022-02-21 04:27:51,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 149 letters. Loop has 41 letters. [2022-02-21 04:27:51,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 149 letters. Loop has 41 letters. [2022-02-21 04:27:51,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 149 letters. Loop has 41 letters. [2022-02-21 04:27:51,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 143 letters. Loop has 45 letters. [2022-02-21 04:27:51,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 143 letters. Loop has 45 letters. [2022-02-21 04:27:51,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 143 letters. Loop has 45 letters. [2022-02-21 04:27:51,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 149 letters. Loop has 43 letters. [2022-02-21 04:27:51,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 149 letters. Loop has 43 letters. [2022-02-21 04:27:51,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 149 letters. Loop has 43 letters. [2022-02-21 04:27:51,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 144 letters. Loop has 47 letters. [2022-02-21 04:27:51,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 144 letters. Loop has 47 letters. [2022-02-21 04:27:51,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 144 letters. Loop has 47 letters. [2022-02-21 04:27:51,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 144 letters. Loop has 47 letters. [2022-02-21 04:27:51,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 144 letters. Loop has 47 letters. [2022-02-21 04:27:51,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 144 letters. Loop has 47 letters. [2022-02-21 04:27:51,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 143 letters. Loop has 47 letters. [2022-02-21 04:27:51,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 143 letters. Loop has 47 letters. [2022-02-21 04:27:51,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 143 letters. Loop has 47 letters. [2022-02-21 04:27:51,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 161 letters. Loop has 41 letters. [2022-02-21 04:27:51,918 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 161 letters. Loop has 41 letters. [2022-02-21 04:27:51,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 161 letters. Loop has 41 letters. [2022-02-21 04:27:51,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 147 letters. Loop has 37 letters. [2022-02-21 04:27:51,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 147 letters. Loop has 37 letters. [2022-02-21 04:27:51,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 147 letters. Loop has 37 letters. [2022-02-21 04:27:51,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 150 letters. Loop has 46 letters. [2022-02-21 04:27:51,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 150 letters. Loop has 46 letters. [2022-02-21 04:27:51,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 150 letters. Loop has 46 letters. [2022-02-21 04:27:51,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 148 letters. Loop has 37 letters. [2022-02-21 04:27:51,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 148 letters. Loop has 37 letters. [2022-02-21 04:27:51,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 148 letters. Loop has 37 letters. [2022-02-21 04:27:51,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 133 letters. Loop has 43 letters. [2022-02-21 04:27:51,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 133 letters. Loop has 43 letters. [2022-02-21 04:27:51,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 133 letters. Loop has 43 letters. [2022-02-21 04:27:51,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 129 letters. Loop has 41 letters. [2022-02-21 04:27:51,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 129 letters. Loop has 41 letters. [2022-02-21 04:27:51,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 129 letters. Loop has 41 letters. [2022-02-21 04:27:51,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 134 letters. Loop has 43 letters. [2022-02-21 04:27:51,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 134 letters. Loop has 43 letters. [2022-02-21 04:27:51,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 134 letters. Loop has 43 letters. [2022-02-21 04:27:51,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 128 letters. Loop has 41 letters. [2022-02-21 04:27:51,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 128 letters. Loop has 41 letters. [2022-02-21 04:27:51,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 128 letters. Loop has 41 letters. [2022-02-21 04:27:51,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 167 letters. Loop has 41 letters. [2022-02-21 04:27:51,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 167 letters. Loop has 41 letters. [2022-02-21 04:27:51,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 167 letters. Loop has 41 letters. [2022-02-21 04:27:51,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 132 letters. Loop has 41 letters. [2022-02-21 04:27:51,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 132 letters. Loop has 41 letters. [2022-02-21 04:27:51,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 132 letters. Loop has 41 letters. [2022-02-21 04:27:51,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 161 letters. Loop has 37 letters. [2022-02-21 04:27:51,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 161 letters. Loop has 37 letters. [2022-02-21 04:27:51,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 161 letters. Loop has 37 letters. [2022-02-21 04:27:51,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 133 letters. Loop has 41 letters. [2022-02-21 04:27:51,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 133 letters. Loop has 41 letters. [2022-02-21 04:27:51,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 133 letters. Loop has 41 letters. [2022-02-21 04:27:51,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 139 letters. Loop has 37 letters. [2022-02-21 04:27:51,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 139 letters. Loop has 37 letters. [2022-02-21 04:27:51,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 139 letters. Loop has 37 letters. [2022-02-21 04:27:51,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 141 letters. Loop has 43 letters. [2022-02-21 04:27:51,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 141 letters. Loop has 43 letters. [2022-02-21 04:27:51,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 141 letters. Loop has 43 letters. [2022-02-21 04:27:51,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 140 letters. Loop has 41 letters. [2022-02-21 04:27:51,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 140 letters. Loop has 41 letters. [2022-02-21 04:27:51,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 140 letters. Loop has 41 letters. [2022-02-21 04:27:51,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 144 letters. Loop has 37 letters. [2022-02-21 04:27:51,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 144 letters. Loop has 37 letters. [2022-02-21 04:27:51,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 144 letters. Loop has 37 letters. [2022-02-21 04:27:51,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 133 letters. Loop has 41 letters. [2022-02-21 04:27:51,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 133 letters. Loop has 41 letters. [2022-02-21 04:27:51,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 133 letters. Loop has 41 letters. [2022-02-21 04:27:51,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 134 letters. Loop has 41 letters. [2022-02-21 04:27:51,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 134 letters. Loop has 41 letters. [2022-02-21 04:27:51,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 134 letters. Loop has 41 letters. [2022-02-21 04:27:51,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 134 letters. Loop has 42 letters. [2022-02-21 04:27:51,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 134 letters. Loop has 42 letters. [2022-02-21 04:27:51,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 134 letters. Loop has 42 letters. [2022-02-21 04:27:51,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 141 letters. Loop has 41 letters. [2022-02-21 04:27:51,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 141 letters. Loop has 41 letters. [2022-02-21 04:27:51,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 141 letters. Loop has 41 letters. [2022-02-21 04:27:51,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 143 letters. Loop has 43 letters. [2022-02-21 04:27:51,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 143 letters. Loop has 43 letters. [2022-02-21 04:27:51,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 143 letters. Loop has 43 letters. [2022-02-21 04:27:51,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 147 letters. Loop has 42 letters. [2022-02-21 04:27:51,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 147 letters. Loop has 42 letters. [2022-02-21 04:27:51,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 147 letters. Loop has 42 letters. [2022-02-21 04:27:51,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 147 letters. Loop has 41 letters. [2022-02-21 04:27:51,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 147 letters. Loop has 41 letters. [2022-02-21 04:27:51,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 147 letters. Loop has 41 letters. [2022-02-21 04:27:51,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 141 letters. Loop has 41 letters. [2022-02-21 04:27:51,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 141 letters. Loop has 41 letters. [2022-02-21 04:27:51,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 141 letters. Loop has 41 letters. [2022-02-21 04:27:51,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 141 letters. Loop has 43 letters. [2022-02-21 04:27:51,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 141 letters. Loop has 43 letters. [2022-02-21 04:27:51,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 141 letters. Loop has 43 letters. [2022-02-21 04:27:51,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 159 letters. Loop has 41 letters. [2022-02-21 04:27:51,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 159 letters. Loop has 41 letters. [2022-02-21 04:27:51,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 159 letters. Loop has 41 letters. [2022-02-21 04:27:51,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 160 letters. Loop has 41 letters. [2022-02-21 04:27:51,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 160 letters. Loop has 41 letters. [2022-02-21 04:27:51,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 160 letters. Loop has 41 letters. [2022-02-21 04:27:51,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 127 letters. Loop has 41 letters. [2022-02-21 04:27:51,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 127 letters. Loop has 41 letters. [2022-02-21 04:27:51,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 127 letters. Loop has 41 letters. [2022-02-21 04:27:51,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 153 letters. Loop has 37 letters. [2022-02-21 04:27:51,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 153 letters. Loop has 37 letters. [2022-02-21 04:27:51,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 153 letters. Loop has 37 letters. [2022-02-21 04:27:51,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 162 letters. Loop has 41 letters. [2022-02-21 04:27:51,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 162 letters. Loop has 41 letters. [2022-02-21 04:27:51,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 162 letters. Loop has 41 letters. [2022-02-21 04:27:51,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 163 letters. Loop has 41 letters. [2022-02-21 04:27:51,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 163 letters. Loop has 41 letters. [2022-02-21 04:27:51,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 163 letters. Loop has 41 letters. [2022-02-21 04:27:51,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 135 letters. Loop has 41 letters. [2022-02-21 04:27:51,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 135 letters. Loop has 41 letters. [2022-02-21 04:27:51,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 135 letters. Loop has 41 letters. [2022-02-21 04:27:51,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 136 letters. Loop has 41 letters. [2022-02-21 04:27:51,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 136 letters. Loop has 41 letters. [2022-02-21 04:27:51,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 136 letters. Loop has 41 letters. [2022-02-21 04:27:51,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 136 letters. Loop has 43 letters. [2022-02-21 04:27:51,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 136 letters. Loop has 43 letters. [2022-02-21 04:27:51,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 136 letters. Loop has 43 letters. [2022-02-21 04:27:51,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 135 letters. Loop has 43 letters. [2022-02-21 04:27:51,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 135 letters. Loop has 43 letters. [2022-02-21 04:27:51,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 135 letters. Loop has 43 letters. [2022-02-21 04:27:51,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 136 letters. Loop has 43 letters. [2022-02-21 04:27:51,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 136 letters. Loop has 43 letters. [2022-02-21 04:27:51,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 136 letters. Loop has 43 letters. [2022-02-21 04:27:51,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 145 letters. Loop has 37 letters. [2022-02-21 04:27:51,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 145 letters. Loop has 37 letters. [2022-02-21 04:27:51,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 145 letters. Loop has 37 letters. [2022-02-21 04:27:51,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 146 letters. Loop has 37 letters. [2022-02-21 04:27:51,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 146 letters. Loop has 37 letters. [2022-02-21 04:27:51,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 146 letters. Loop has 37 letters. [2022-02-21 04:27:51,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 146 letters. Loop has 41 letters. [2022-02-21 04:27:51,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 146 letters. Loop has 41 letters. [2022-02-21 04:27:51,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 146 letters. Loop has 41 letters. [2022-02-21 04:27:51,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 142 letters. Loop has 43 letters. [2022-02-21 04:27:51,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 142 letters. Loop has 43 letters. [2022-02-21 04:27:51,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 142 letters. Loop has 43 letters. [2022-02-21 04:27:51,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 141 letters. Loop has 42 letters. [2022-02-21 04:27:51,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,970 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 141 letters. Loop has 42 letters. [2022-02-21 04:27:51,970 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 141 letters. Loop has 42 letters. [2022-02-21 04:27:51,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 136 letters. Loop has 42 letters. [2022-02-21 04:27:51,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 136 letters. Loop has 42 letters. [2022-02-21 04:27:51,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 136 letters. Loop has 42 letters. [2022-02-21 04:27:51,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 140 letters. Loop has 37 letters. [2022-02-21 04:27:51,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 140 letters. Loop has 37 letters. [2022-02-21 04:27:51,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 140 letters. Loop has 37 letters. [2022-02-21 04:27:51,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 141 letters. Loop has 37 letters. [2022-02-21 04:27:51,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 141 letters. Loop has 37 letters. [2022-02-21 04:27:51,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 141 letters. Loop has 37 letters. [2022-02-21 04:27:51,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 144 letters. Loop has 43 letters. [2022-02-21 04:27:51,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 144 letters. Loop has 43 letters. [2022-02-21 04:27:51,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 144 letters. Loop has 43 letters. [2022-02-21 04:27:51,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 143 letters. Loop has 41 letters. [2022-02-21 04:27:51,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 143 letters. Loop has 41 letters. [2022-02-21 04:27:51,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 143 letters. Loop has 41 letters. [2022-02-21 04:27:51,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 158 letters. Loop has 37 letters. [2022-02-21 04:27:51,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 158 letters. Loop has 37 letters. [2022-02-21 04:27:51,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 158 letters. Loop has 37 letters. [2022-02-21 04:27:51,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 159 letters. Loop has 37 letters. [2022-02-21 04:27:51,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 159 letters. Loop has 37 letters. [2022-02-21 04:27:51,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 159 letters. Loop has 37 letters. [2022-02-21 04:27:51,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 133 letters. Loop has 37 letters. [2022-02-21 04:27:51,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 133 letters. Loop has 37 letters. [2022-02-21 04:27:51,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 133 letters. Loop has 37 letters. [2022-02-21 04:27:51,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 134 letters. Loop has 37 letters. [2022-02-21 04:27:51,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 134 letters. Loop has 37 letters. [2022-02-21 04:27:51,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 134 letters. Loop has 37 letters. [2022-02-21 04:27:51,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 134 letters. Loop has 41 letters. [2022-02-21 04:27:51,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 134 letters. Loop has 41 letters. [2022-02-21 04:27:51,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 134 letters. Loop has 41 letters. [2022-02-21 04:27:51,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 164 letters. Loop has 41 letters. [2022-02-21 04:27:51,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 164 letters. Loop has 41 letters. [2022-02-21 04:27:51,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 164 letters. Loop has 41 letters. [2022-02-21 04:27:51,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 165 letters. Loop has 41 letters. [2022-02-21 04:27:51,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 165 letters. Loop has 41 letters. [2022-02-21 04:27:51,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 165 letters. Loop has 41 letters. [2022-02-21 04:27:51,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 148 letters. Loop has 42 letters. [2022-02-21 04:27:51,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 148 letters. Loop has 42 letters. [2022-02-21 04:27:51,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 148 letters. Loop has 42 letters. [2022-02-21 04:27:51,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 148 letters. Loop has 41 letters. [2022-02-21 04:27:51,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 148 letters. Loop has 41 letters. [2022-02-21 04:27:51,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 148 letters. Loop has 41 letters. [2022-02-21 04:27:51,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 162 letters. Loop has 37 letters. [2022-02-21 04:27:51,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 162 letters. Loop has 37 letters. [2022-02-21 04:27:51,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 162 letters. Loop has 37 letters. [2022-02-21 04:27:51,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 163 letters. Loop has 37 letters. [2022-02-21 04:27:51,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 163 letters. Loop has 37 letters. [2022-02-21 04:27:51,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 163 letters. Loop has 37 letters. [2022-02-21 04:27:51,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 150 letters. Loop has 43 letters. [2022-02-21 04:27:51,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 150 letters. Loop has 43 letters. [2022-02-21 04:27:51,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 150 letters. Loop has 43 letters. [2022-02-21 04:27:51,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 133 letters. Loop has 43 letters. [2022-02-21 04:27:51,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 133 letters. Loop has 43 letters. [2022-02-21 04:27:51,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:51,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 133 letters. Loop has 43 letters. [2022-02-21 04:27:52,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,005 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 155 letters. Loop has 37 letters. [2022-02-21 04:27:52,005 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 155 letters. Loop has 37 letters. [2022-02-21 04:27:52,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 155 letters. Loop has 37 letters. [2022-02-21 04:27:52,006 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,006 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 156 letters. Loop has 37 letters. [2022-02-21 04:27:52,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 156 letters. Loop has 37 letters. [2022-02-21 04:27:52,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 156 letters. Loop has 37 letters. [2022-02-21 04:27:52,007 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,007 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 139 letters. Loop has 41 letters. [2022-02-21 04:27:52,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 139 letters. Loop has 41 letters. [2022-02-21 04:27:52,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 139 letters. Loop has 41 letters. [2022-02-21 04:27:52,008 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,008 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 140 letters. Loop has 42 letters. [2022-02-21 04:27:52,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 140 letters. Loop has 42 letters. [2022-02-21 04:27:52,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 140 letters. Loop has 42 letters. [2022-02-21 04:27:52,009 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,009 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 140 letters. Loop has 41 letters. [2022-02-21 04:27:52,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 140 letters. Loop has 41 letters. [2022-02-21 04:27:52,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,010 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 140 letters. Loop has 41 letters. [2022-02-21 04:27:52,010 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 131 letters. Loop has 41 letters. [2022-02-21 04:27:52,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 131 letters. Loop has 41 letters. [2022-02-21 04:27:52,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,011 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 131 letters. Loop has 41 letters. [2022-02-21 04:27:52,011 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 129 letters. Loop has 41 letters. [2022-02-21 04:27:52,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 129 letters. Loop has 41 letters. [2022-02-21 04:27:52,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,012 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 129 letters. Loop has 41 letters. [2022-02-21 04:27:52,012 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 132 letters. Loop has 42 letters. [2022-02-21 04:27:52,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 132 letters. Loop has 42 letters. [2022-02-21 04:27:52,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,013 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 132 letters. Loop has 42 letters. [2022-02-21 04:27:52,013 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 147 letters. Loop has 43 letters. [2022-02-21 04:27:52,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 147 letters. Loop has 43 letters. [2022-02-21 04:27:52,014 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,014 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 147 letters. Loop has 43 letters. [2022-02-21 04:27:52,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 132 letters. Loop has 37 letters. [2022-02-21 04:27:52,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 132 letters. Loop has 37 letters. [2022-02-21 04:27:52,015 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,015 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 132 letters. Loop has 37 letters. [2022-02-21 04:27:52,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 132 letters. Loop has 41 letters. [2022-02-21 04:27:52,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 132 letters. Loop has 41 letters. [2022-02-21 04:27:52,016 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,016 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 132 letters. Loop has 41 letters. [2022-02-21 04:27:52,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 157 letters. Loop has 37 letters. [2022-02-21 04:27:52,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 157 letters. Loop has 37 letters. [2022-02-21 04:27:52,017 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,017 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 157 letters. Loop has 37 letters. [2022-02-21 04:27:52,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 166 letters. Loop has 41 letters. [2022-02-21 04:27:52,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 166 letters. Loop has 41 letters. [2022-02-21 04:27:52,018 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,018 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 166 letters. Loop has 41 letters. [2022-02-21 04:27:52,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 151 letters. Loop has 37 letters. [2022-02-21 04:27:52,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 151 letters. Loop has 37 letters. [2022-02-21 04:27:52,019 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,019 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 151 letters. Loop has 37 letters. [2022-02-21 04:27:52,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 152 letters. Loop has 37 letters. [2022-02-21 04:27:52,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 152 letters. Loop has 37 letters. [2022-02-21 04:27:52,020 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,020 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 152 letters. Loop has 37 letters. [2022-02-21 04:27:52,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 149 letters. Loop has 37 letters. [2022-02-21 04:27:52,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 149 letters. Loop has 37 letters. [2022-02-21 04:27:52,021 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,021 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 149 letters. Loop has 37 letters. [2022-02-21 04:27:52,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 130 letters. Loop has 42 letters. [2022-02-21 04:27:52,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 130 letters. Loop has 42 letters. [2022-02-21 04:27:52,022 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,022 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 130 letters. Loop has 42 letters. [2022-02-21 04:27:52,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 130 letters. Loop has 41 letters. [2022-02-21 04:27:52,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 130 letters. Loop has 41 letters. [2022-02-21 04:27:52,023 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,023 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 130 letters. Loop has 41 letters. [2022-02-21 04:27:52,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 133 letters. Loop has 41 letters. [2022-02-21 04:27:52,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 133 letters. Loop has 41 letters. [2022-02-21 04:27:52,024 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,024 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 133 letters. Loop has 41 letters. [2022-02-21 04:27:52,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 134 letters. Loop has 41 letters. [2022-02-21 04:27:52,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 134 letters. Loop has 41 letters. [2022-02-21 04:27:52,025 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,025 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 134 letters. Loop has 41 letters. [2022-02-21 04:27:52,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 134 letters. Loop has 42 letters. [2022-02-21 04:27:52,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 134 letters. Loop has 42 letters. [2022-02-21 04:27:52,026 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,026 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 134 letters. Loop has 42 letters. [2022-02-21 04:27:52,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 149 letters. Loop has 42 letters. [2022-02-21 04:27:52,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 149 letters. Loop has 42 letters. [2022-02-21 04:27:52,027 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,027 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 149 letters. Loop has 42 letters. [2022-02-21 04:27:52,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 140 letters. Loop has 43 letters. [2022-02-21 04:27:52,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 140 letters. Loop has 43 letters. [2022-02-21 04:27:52,028 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,028 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 140 letters. Loop has 43 letters. [2022-02-21 04:27:52,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 138 letters. Loop has 42 letters. [2022-02-21 04:27:52,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 138 letters. Loop has 42 letters. [2022-02-21 04:27:52,029 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,029 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 138 letters. Loop has 42 letters. [2022-02-21 04:27:52,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 138 letters. Loop has 41 letters. [2022-02-21 04:27:52,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 138 letters. Loop has 41 letters. [2022-02-21 04:27:52,030 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,030 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 138 letters. Loop has 41 letters. [2022-02-21 04:27:52,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 154 letters. Loop has 37 letters. [2022-02-21 04:27:52,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 154 letters. Loop has 37 letters. [2022-02-21 04:27:52,031 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,031 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 154 letters. Loop has 37 letters. [2022-02-21 04:27:52,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 130 letters. Loop has 41 letters. [2022-02-21 04:27:52,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 130 letters. Loop has 41 letters. [2022-02-21 04:27:52,032 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,032 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 130 letters. Loop has 41 letters. [2022-02-21 04:27:52,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 131 letters. Loop has 41 letters. [2022-02-21 04:27:52,033 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,033 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 131 letters. Loop has 41 letters. [2022-02-21 04:27:52,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 131 letters. Loop has 41 letters. [2022-02-21 04:27:52,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,034 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 131 letters. Loop has 43 letters. [2022-02-21 04:27:52,034 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 131 letters. Loop has 43 letters. [2022-02-21 04:27:52,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 131 letters. Loop has 43 letters. [2022-02-21 04:27:52,035 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,035 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 149 letters. Loop has 41 letters. [2022-02-21 04:27:52,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 149 letters. Loop has 41 letters. [2022-02-21 04:27:52,036 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,036 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 149 letters. Loop has 41 letters. [2022-02-21 04:27:52,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 134 letters. Loop has 41 letters. [2022-02-21 04:27:52,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,037 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 134 letters. Loop has 41 letters. [2022-02-21 04:27:52,037 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 134 letters. Loop has 41 letters. [2022-02-21 04:27:52,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 150 letters. Loop has 41 letters. [2022-02-21 04:27:52,038 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,038 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 150 letters. Loop has 41 letters. [2022-02-21 04:27:52,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 150 letters. Loop has 41 letters. [2022-02-21 04:27:52,039 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,039 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 137 letters. Loop has 41 letters. [2022-02-21 04:27:52,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 137 letters. Loop has 41 letters. [2022-02-21 04:27:52,040 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,040 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 137 letters. Loop has 41 letters. [2022-02-21 04:27:52,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 150 letters. Loop has 42 letters. [2022-02-21 04:27:52,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 150 letters. Loop has 42 letters. [2022-02-21 04:27:52,041 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,041 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 150 letters. Loop has 42 letters. [2022-02-21 04:27:52,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 137 letters. Loop has 43 letters. [2022-02-21 04:27:52,042 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,042 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 137 letters. Loop has 43 letters. [2022-02-21 04:27:52,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 137 letters. Loop has 43 letters. [2022-02-21 04:27:52,043 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,043 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 145 letters. Loop has 41 letters. [2022-02-21 04:27:52,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 145 letters. Loop has 41 letters. [2022-02-21 04:27:52,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,044 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 145 letters. Loop has 41 letters. [2022-02-21 04:27:52,044 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 146 letters. Loop has 43 letters. [2022-02-21 04:27:52,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 146 letters. Loop has 43 letters. [2022-02-21 04:27:52,045 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,045 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 146 letters. Loop has 43 letters. [2022-02-21 04:27:52,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 146 letters. Loop has 41 letters. [2022-02-21 04:27:52,046 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,046 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 146 letters. Loop has 41 letters. [2022-02-21 04:27:52,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 146 letters. Loop has 41 letters. [2022-02-21 04:27:52,047 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,047 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 146 letters. Loop has 43 letters. [2022-02-21 04:27:52,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 146 letters. Loop has 43 letters. [2022-02-21 04:27:52,048 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,048 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 146 letters. Loop has 43 letters. [2022-02-21 04:27:52,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 142 letters. Loop has 43 letters. [2022-02-21 04:27:52,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 142 letters. Loop has 43 letters. [2022-02-21 04:27:52,049 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,049 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 142 letters. Loop has 43 letters. [2022-02-21 04:27:52,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 146 letters. Loop has 42 letters. [2022-02-21 04:27:52,050 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,050 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 146 letters. Loop has 42 letters. [2022-02-21 04:27:52,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 146 letters. Loop has 42 letters. [2022-02-21 04:27:52,051 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,051 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 137 letters. Loop has 43 letters. [2022-02-21 04:27:52,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 137 letters. Loop has 43 letters. [2022-02-21 04:27:52,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,052 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 137 letters. Loop has 43 letters. [2022-02-21 04:27:52,052 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 147 letters. Loop has 43 letters. [2022-02-21 04:27:52,053 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,053 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 147 letters. Loop has 43 letters. [2022-02-21 04:27:52,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 147 letters. Loop has 43 letters. [2022-02-21 04:27:52,054 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,054 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 148 letters. Loop has 43 letters. [2022-02-21 04:27:52,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 148 letters. Loop has 43 letters. [2022-02-21 04:27:52,055 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,055 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 148 letters. Loop has 43 letters. [2022-02-21 04:27:52,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 137 letters. Loop has 37 letters. [2022-02-21 04:27:52,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,056 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 137 letters. Loop has 37 letters. [2022-02-21 04:27:52,056 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 137 letters. Loop has 37 letters. [2022-02-21 04:27:52,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 138 letters. Loop has 37 letters. [2022-02-21 04:27:52,057 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,057 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 138 letters. Loop has 37 letters. [2022-02-21 04:27:52,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 138 letters. Loop has 37 letters. [2022-02-21 04:27:52,058 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,058 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 138 letters. Loop has 41 letters. [2022-02-21 04:27:52,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 138 letters. Loop has 41 letters. [2022-02-21 04:27:52,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,059 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 138 letters. Loop has 41 letters. [2022-02-21 04:27:52,059 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 135 letters. Loop has 42 letters. [2022-02-21 04:27:52,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 135 letters. Loop has 42 letters. [2022-02-21 04:27:52,060 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,060 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 135 letters. Loop has 42 letters. [2022-02-21 04:27:52,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 131 letters. Loop has 37 letters. [2022-02-21 04:27:52,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,061 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 131 letters. Loop has 37 letters. [2022-02-21 04:27:52,061 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 131 letters. Loop has 37 letters. [2022-02-21 04:27:52,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 165 letters. Loop has 37 letters. [2022-02-21 04:27:52,062 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,062 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 165 letters. Loop has 37 letters. [2022-02-21 04:27:52,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 165 letters. Loop has 37 letters. [2022-02-21 04:27:52,063 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,063 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 166 letters. Loop has 37 letters. [2022-02-21 04:27:52,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 166 letters. Loop has 37 letters. [2022-02-21 04:27:52,064 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,064 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 166 letters. Loop has 37 letters. [2022-02-21 04:27:52,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 164 letters. Loop has 37 letters. [2022-02-21 04:27:52,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 164 letters. Loop has 37 letters. [2022-02-21 04:27:52,065 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,065 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 164 letters. Loop has 37 letters. [2022-02-21 04:27:52,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 139 letters. Loop has 43 letters. [2022-02-21 04:27:52,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,066 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 139 letters. Loop has 43 letters. [2022-02-21 04:27:52,066 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 139 letters. Loop has 43 letters. [2022-02-21 04:27:52,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,067 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 141 letters. Loop has 41 letters. [2022-02-21 04:27:52,067 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 141 letters. Loop has 41 letters. [2022-02-21 04:27:52,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 141 letters. Loop has 41 letters. [2022-02-21 04:27:52,068 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,068 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 138 letters. Loop has 43 letters. [2022-02-21 04:27:52,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 138 letters. Loop has 43 letters. [2022-02-21 04:27:52,069 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,069 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 138 letters. Loop has 43 letters. [2022-02-21 04:27:52,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 142 letters. Loop has 41 letters. [2022-02-21 04:27:52,070 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,070 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 142 letters. Loop has 41 letters. [2022-02-21 04:27:52,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 142 letters. Loop has 41 letters. [2022-02-21 04:27:52,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,071 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 142 letters. Loop has 42 letters. [2022-02-21 04:27:52,071 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 142 letters. Loop has 42 letters. [2022-02-21 04:27:52,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 142 letters. Loop has 42 letters. [2022-02-21 04:27:52,072 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,072 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 142 letters. Loop has 42 letters. [2022-02-21 04:27:52,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 142 letters. Loop has 42 letters. [2022-02-21 04:27:52,073 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,073 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 142 letters. Loop has 42 letters. [2022-02-21 04:27:52,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 142 letters. Loop has 41 letters. [2022-02-21 04:27:52,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,074 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 142 letters. Loop has 41 letters. [2022-02-21 04:27:52,074 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 142 letters. Loop has 41 letters. [2022-02-21 04:27:52,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 139 letters. Loop has 42 letters. [2022-02-21 04:27:52,075 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,075 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 139 letters. Loop has 42 letters. [2022-02-21 04:27:52,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 139 letters. Loop has 42 letters. [2022-02-21 04:27:52,076 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,076 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 133 letters. Loop has 42 letters. [2022-02-21 04:27:52,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 133 letters. Loop has 42 letters. [2022-02-21 04:27:52,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,077 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 133 letters. Loop has 42 letters. [2022-02-21 04:27:52,077 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 131 letters. Loop has 42 letters. [2022-02-21 04:27:52,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 131 letters. Loop has 42 letters. [2022-02-21 04:27:52,078 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,078 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 131 letters. Loop has 42 letters. [2022-02-21 04:27:52,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 139 letters. Loop has 43 letters. [2022-02-21 04:27:52,079 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,079 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 139 letters. Loop has 43 letters. [2022-02-21 04:27:52,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 139 letters. Loop has 43 letters. [2022-02-21 04:27:52,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,080 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 147 letters. Loop has 41 letters. [2022-02-21 04:27:52,080 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 147 letters. Loop has 41 letters. [2022-02-21 04:27:52,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 147 letters. Loop has 41 letters. [2022-02-21 04:27:52,081 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 140 letters. Loop has 43 letters. [2022-02-21 04:27:52,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 140 letters. Loop has 43 letters. [2022-02-21 04:27:52,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 140 letters. Loop has 43 letters. [2022-02-21 04:27:52,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 148 letters. Loop has 43 letters. [2022-02-21 04:27:52,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,083 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 148 letters. Loop has 43 letters. [2022-02-21 04:27:52,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 148 letters. Loop has 43 letters. [2022-02-21 04:27:52,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 149 letters. Loop has 43 letters. [2022-02-21 04:27:52,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 149 letters. Loop has 43 letters. [2022-02-21 04:27:52,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 149 letters. Loop has 43 letters. [2022-02-21 04:27:52,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 143 letters. Loop has 41 letters. [2022-02-21 04:27:52,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 143 letters. Loop has 41 letters. [2022-02-21 04:27:52,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 143 letters. Loop has 41 letters. [2022-02-21 04:27:52,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 144 letters. Loop has 42 letters. [2022-02-21 04:27:52,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 144 letters. Loop has 42 letters. [2022-02-21 04:27:52,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 144 letters. Loop has 42 letters. [2022-02-21 04:27:52,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 144 letters. Loop has 41 letters. [2022-02-21 04:27:52,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 144 letters. Loop has 41 letters. [2022-02-21 04:27:52,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 144 letters. Loop has 41 letters. [2022-02-21 04:27:52,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 130 letters. Loop has 37 letters. [2022-02-21 04:27:52,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 130 letters. Loop has 37 letters. [2022-02-21 04:27:52,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 130 letters. Loop has 37 letters. [2022-02-21 04:27:52,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 142 letters. Loop has 41 letters. [2022-02-21 04:27:52,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 142 letters. Loop has 41 letters. [2022-02-21 04:27:52,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 142 letters. Loop has 41 letters. [2022-02-21 04:27:52,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 143 letters. Loop has 43 letters. [2022-02-21 04:27:52,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 143 letters. Loop has 43 letters. [2022-02-21 04:27:52,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 143 letters. Loop has 43 letters. [2022-02-21 04:27:52,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 132 letters. Loop has 43 letters. [2022-02-21 04:27:52,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 132 letters. Loop has 43 letters. [2022-02-21 04:27:52,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 132 letters. Loop has 43 letters. [2022-02-21 04:27:52,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 145 letters. Loop has 43 letters. [2022-02-21 04:27:52,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 145 letters. Loop has 43 letters. [2022-02-21 04:27:52,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 145 letters. Loop has 43 letters. [2022-02-21 04:27:52,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 132 letters. Loop has 43 letters. [2022-02-21 04:27:52,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 132 letters. Loop has 43 letters. [2022-02-21 04:27:52,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 132 letters. Loop has 43 letters. [2022-02-21 04:27:52,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 138 letters. Loop has 42 letters. [2022-02-21 04:27:52,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 138 letters. Loop has 42 letters. [2022-02-21 04:27:52,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 138 letters. Loop has 42 letters. [2022-02-21 04:27:52,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 138 letters. Loop has 41 letters. [2022-02-21 04:27:52,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 138 letters. Loop has 41 letters. [2022-02-21 04:27:52,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 138 letters. Loop has 41 letters. [2022-02-21 04:27:52,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 138 letters. Loop has 43 letters. [2022-02-21 04:27:52,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 138 letters. Loop has 43 letters. [2022-02-21 04:27:52,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 138 letters. Loop has 43 letters. [2022-02-21 04:27:52,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 160 letters. Loop has 37 letters. [2022-02-21 04:27:52,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 160 letters. Loop has 37 letters. [2022-02-21 04:27:52,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 160 letters. Loop has 37 letters. [2022-02-21 04:27:52,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 139 letters. Loop has 41 letters. [2022-02-21 04:27:52,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 139 letters. Loop has 41 letters. [2022-02-21 04:27:52,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 139 letters. Loop has 41 letters. [2022-02-21 04:27:52,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 158 letters. Loop has 41 letters. [2022-02-21 04:27:52,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 158 letters. Loop has 41 letters. [2022-02-21 04:27:52,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 158 letters. Loop has 41 letters. [2022-02-21 04:27:52,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 157 letters. Loop has 41 letters. [2022-02-21 04:27:52,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 157 letters. Loop has 41 letters. [2022-02-21 04:27:52,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 157 letters. Loop has 41 letters. [2022-02-21 04:27:52,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 156 letters. Loop has 41 letters. [2022-02-21 04:27:52,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 156 letters. Loop has 41 letters. [2022-02-21 04:27:52,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 156 letters. Loop has 41 letters. [2022-02-21 04:27:52,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 155 letters. Loop has 41 letters. [2022-02-21 04:27:52,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 155 letters. Loop has 41 letters. [2022-02-21 04:27:52,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 155 letters. Loop has 41 letters. [2022-02-21 04:27:52,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 154 letters. Loop has 41 letters. [2022-02-21 04:27:52,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 154 letters. Loop has 41 letters. [2022-02-21 04:27:52,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 154 letters. Loop has 41 letters. [2022-02-21 04:27:52,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 153 letters. Loop has 41 letters. [2022-02-21 04:27:52,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 153 letters. Loop has 41 letters. [2022-02-21 04:27:52,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 153 letters. Loop has 41 letters. [2022-02-21 04:27:52,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 152 letters. Loop has 41 letters. [2022-02-21 04:27:52,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 152 letters. Loop has 41 letters. [2022-02-21 04:27:52,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 152 letters. Loop has 41 letters. [2022-02-21 04:27:52,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 151 letters. Loop has 41 letters. [2022-02-21 04:27:52,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 151 letters. Loop has 41 letters. [2022-02-21 04:27:52,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 151 letters. Loop has 41 letters. [2022-02-21 04:27:52,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 150 letters. Loop has 41 letters. [2022-02-21 04:27:52,113 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 150 letters. Loop has 41 letters. [2022-02-21 04:27:52,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 150 letters. Loop has 41 letters. [2022-02-21 04:27:52,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 154 letters. Loop has 45 letters. [2022-02-21 04:27:52,114 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,114 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 154 letters. Loop has 45 letters. [2022-02-21 04:27:52,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 154 letters. Loop has 45 letters. [2022-02-21 04:27:52,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 142 letters. Loop has 37 letters. [2022-02-21 04:27:52,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 142 letters. Loop has 37 letters. [2022-02-21 04:27:52,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 142 letters. Loop has 37 letters. [2022-02-21 04:27:52,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,116 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 154 letters. Loop has 46 letters. [2022-02-21 04:27:52,116 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 154 letters. Loop has 46 letters. [2022-02-21 04:27:52,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 154 letters. Loop has 46 letters. [2022-02-21 04:27:52,117 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,117 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 143 letters. Loop has 37 letters. [2022-02-21 04:27:52,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 143 letters. Loop has 37 letters. [2022-02-21 04:27:52,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 143 letters. Loop has 37 letters. [2022-02-21 04:27:52,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 153 letters. Loop has 45 letters. [2022-02-21 04:27:52,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 153 letters. Loop has 45 letters. [2022-02-21 04:27:52,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 153 letters. Loop has 45 letters. [2022-02-21 04:27:52,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 149 letters. Loop has 41 letters. [2022-02-21 04:27:52,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 149 letters. Loop has 41 letters. [2022-02-21 04:27:52,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 149 letters. Loop has 41 letters. [2022-02-21 04:27:52,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 150 letters. Loop has 45 letters. [2022-02-21 04:27:52,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 150 letters. Loop has 45 letters. [2022-02-21 04:27:52,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 150 letters. Loop has 45 letters. [2022-02-21 04:27:52,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 135 letters. Loop has 42 letters. [2022-02-21 04:27:52,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 135 letters. Loop has 42 letters. [2022-02-21 04:27:52,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 135 letters. Loop has 42 letters. [2022-02-21 04:27:52,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 155 letters. Loop has 47 letters. [2022-02-21 04:27:52,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 155 letters. Loop has 47 letters. [2022-02-21 04:27:52,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 155 letters. Loop has 47 letters. [2022-02-21 04:27:52,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 135 letters. Loop has 41 letters. [2022-02-21 04:27:52,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 135 letters. Loop has 41 letters. [2022-02-21 04:27:52,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 135 letters. Loop has 41 letters. [2022-02-21 04:27:52,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 153 letters. Loop has 45 letters. [2022-02-21 04:27:52,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 153 letters. Loop has 45 letters. [2022-02-21 04:27:52,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 153 letters. Loop has 45 letters. [2022-02-21 04:27:52,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 154 letters. Loop has 47 letters. [2022-02-21 04:27:52,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 154 letters. Loop has 47 letters. [2022-02-21 04:27:52,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 154 letters. Loop has 47 letters. [2022-02-21 04:27:52,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 153 letters. Loop has 46 letters. [2022-02-21 04:27:52,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 153 letters. Loop has 46 letters. [2022-02-21 04:27:52,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 153 letters. Loop has 46 letters. [2022-02-21 04:27:52,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 152 letters. Loop has 45 letters. [2022-02-21 04:27:52,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 152 letters. Loop has 45 letters. [2022-02-21 04:27:52,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 152 letters. Loop has 45 letters. [2022-02-21 04:27:52,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 152 letters. Loop has 45 letters. [2022-02-21 04:27:52,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 152 letters. Loop has 45 letters. [2022-02-21 04:27:52,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 152 letters. Loop has 45 letters. [2022-02-21 04:27:52,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 144 letters. Loop has 43 letters. [2022-02-21 04:27:52,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 144 letters. Loop has 43 letters. [2022-02-21 04:27:52,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 144 letters. Loop has 43 letters. [2022-02-21 04:27:52,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 153 letters. Loop has 47 letters. [2022-02-21 04:27:52,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 153 letters. Loop has 47 letters. [2022-02-21 04:27:52,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 153 letters. Loop has 47 letters. [2022-02-21 04:27:52,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 145 letters. Loop has 43 letters. [2022-02-21 04:27:52,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 145 letters. Loop has 43 letters. [2022-02-21 04:27:52,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 145 letters. Loop has 43 letters. [2022-02-21 04:27:52,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 154 letters. Loop has 47 letters. [2022-02-21 04:27:52,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 154 letters. Loop has 47 letters. [2022-02-21 04:27:52,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 154 letters. Loop has 47 letters. [2022-02-21 04:27:52,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 152 letters. Loop has 46 letters. [2022-02-21 04:27:52,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 152 letters. Loop has 46 letters. [2022-02-21 04:27:52,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 152 letters. Loop has 46 letters. [2022-02-21 04:27:52,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 151 letters. Loop has 45 letters. [2022-02-21 04:27:52,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 151 letters. Loop has 45 letters. [2022-02-21 04:27:52,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 151 letters. Loop has 45 letters. [2022-02-21 04:27:52,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 151 letters. Loop has 46 letters. [2022-02-21 04:27:52,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 151 letters. Loop has 46 letters. [2022-02-21 04:27:52,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 151 letters. Loop has 46 letters. [2022-02-21 04:27:52,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 150 letters. Loop has 45 letters. [2022-02-21 04:27:52,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 150 letters. Loop has 45 letters. [2022-02-21 04:27:52,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 150 letters. Loop has 45 letters. [2022-02-21 04:27:52,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 153 letters. Loop has 47 letters. [2022-02-21 04:27:52,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 153 letters. Loop has 47 letters. [2022-02-21 04:27:52,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 153 letters. Loop has 47 letters. [2022-02-21 04:27:52,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 134 letters. Loop has 43 letters. [2022-02-21 04:27:52,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 134 letters. Loop has 43 letters. [2022-02-21 04:27:52,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 134 letters. Loop has 43 letters. [2022-02-21 04:27:52,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 151 letters. Loop has 45 letters. [2022-02-21 04:27:52,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 151 letters. Loop has 45 letters. [2022-02-21 04:27:52,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 151 letters. Loop has 45 letters. [2022-02-21 04:27:52,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 135 letters. Loop has 43 letters. [2022-02-21 04:27:52,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 135 letters. Loop has 43 letters. [2022-02-21 04:27:52,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 135 letters. Loop has 43 letters. [2022-02-21 04:27:52,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 152 letters. Loop has 47 letters. [2022-02-21 04:27:52,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 152 letters. Loop has 47 letters. [2022-02-21 04:27:52,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 152 letters. Loop has 47 letters. [2022-02-21 04:27:52,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 152 letters. Loop has 47 letters. [2022-02-21 04:27:52,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 152 letters. Loop has 47 letters. [2022-02-21 04:27:52,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 152 letters. Loop has 47 letters. [2022-02-21 04:27:52,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 151 letters. Loop has 47 letters. [2022-02-21 04:27:52,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 151 letters. Loop has 47 letters. [2022-02-21 04:27:52,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 151 letters. Loop has 47 letters. [2022-02-21 04:27:52,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 148 letters. Loop has 41 letters. [2022-02-21 04:27:52,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 148 letters. Loop has 41 letters. [2022-02-21 04:27:52,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 148 letters. Loop has 41 letters. [2022-02-21 04:27:52,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 149 letters. Loop has 45 letters. [2022-02-21 04:27:52,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 149 letters. Loop has 45 letters. [2022-02-21 04:27:52,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 149 letters. Loop has 45 letters. [2022-02-21 04:27:52,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 147 letters. Loop has 41 letters. [2022-02-21 04:27:52,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 147 letters. Loop has 41 letters. [2022-02-21 04:27:52,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 147 letters. Loop has 41 letters. [2022-02-21 04:27:52,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 146 letters. Loop has 41 letters. [2022-02-21 04:27:52,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 146 letters. Loop has 41 letters. [2022-02-21 04:27:52,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 146 letters. Loop has 41 letters. [2022-02-21 04:27:52,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 150 letters. Loop has 45 letters. [2022-02-21 04:27:52,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 150 letters. Loop has 45 letters. [2022-02-21 04:27:52,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 150 letters. Loop has 45 letters. [2022-02-21 04:27:52,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 150 letters. Loop has 46 letters. [2022-02-21 04:27:52,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 150 letters. Loop has 46 letters. [2022-02-21 04:27:52,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 150 letters. Loop has 46 letters. [2022-02-21 04:27:52,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 149 letters. Loop has 45 letters. [2022-02-21 04:27:52,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 149 letters. Loop has 45 letters. [2022-02-21 04:27:52,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 149 letters. Loop has 45 letters. [2022-02-21 04:27:52,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 145 letters. Loop has 41 letters. [2022-02-21 04:27:52,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 145 letters. Loop has 41 letters. [2022-02-21 04:27:52,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 145 letters. Loop has 41 letters. [2022-02-21 04:27:52,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,152 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 146 letters. Loop has 45 letters. [2022-02-21 04:27:52,152 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 146 letters. Loop has 45 letters. [2022-02-21 04:27:52,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 146 letters. Loop has 45 letters. [2022-02-21 04:27:52,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 151 letters. Loop has 47 letters. [2022-02-21 04:27:52,153 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,153 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 151 letters. Loop has 47 letters. [2022-02-21 04:27:52,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 151 letters. Loop has 47 letters. [2022-02-21 04:27:52,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 149 letters. Loop has 45 letters. [2022-02-21 04:27:52,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 149 letters. Loop has 45 letters. [2022-02-21 04:27:52,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 149 letters. Loop has 45 letters. [2022-02-21 04:27:52,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 828 states and 1493 transitions. cyclomatic complexity: 666 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:27:52,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 0 states 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:27:52,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:27:52,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,155 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:27:52,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 56.0) internal successors, (168), 3 states have internal predecessors, (168), 0 states have call successors, (0), 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:27:52,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 1284 transitions. [2022-02-21 04:27:52,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 1284 transitions. Stem has 127 letters. Loop has 41 letters. [2022-02-21 04:27:52,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 1284 transitions. Stem has 168 letters. Loop has 41 letters. [2022-02-21 04:27:52,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 1284 transitions. Stem has 127 letters. Loop has 82 letters. [2022-02-21 04:27:52,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:52,164 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 1109 states and 1960 transitions. cyclomatic complexity: 852 [2022-02-21 04:27:52,200 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:27:52,200 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 1109 states to 0 states and 0 transitions. [2022-02-21 04:27:52,201 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:27:52,201 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:27:52,201 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:27:52,201 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:27:52,201 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:27:52,201 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:27:52,201 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:27:52,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:27:52,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:27:52,202 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 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:27:52,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:27:52,202 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 04:27:52,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 04:27:52,202 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 25.4) internal successors, (127), 5 states have internal predecessors, (127), 0 states have call successors, (0), 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:27:52,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:27:52,313 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-02-21 04:27:52,313 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:27:52,313 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 04:27:52,314 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:27:52,314 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:27:52,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:27:52,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:27:52,314 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:27:52,314 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:27:52,314 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:27:52,314 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:27:52,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:27:52,314 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:27:52,314 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:27:52,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:27:52 BoogieIcfgContainer [2022-02-21 04:27:52,319 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:27:52,320 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:27:52,320 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:27:52,320 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:27:52,320 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:27:37" (3/4) ... [2022-02-21 04:27:52,322 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:27:52,322 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:27:52,323 INFO L158 Benchmark]: Toolchain (without parser) took 17153.23ms. Allocated memory was 98.6MB in the beginning and 281.0MB in the end (delta: 182.5MB). Free memory was 58.9MB in the beginning and 125.7MB in the end (delta: -66.9MB). Peak memory consumption was 115.7MB. Max. memory is 16.1GB. [2022-02-21 04:27:52,323 INFO L158 Benchmark]: CDTParser took 0.22ms. Allocated memory is still 98.6MB. Free memory is still 77.6MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:27:52,324 INFO L158 Benchmark]: CACSL2BoogieTranslator took 740.28ms. Allocated memory is still 98.6MB. Free memory was 58.7MB in the beginning and 41.4MB in the end (delta: 17.3MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. [2022-02-21 04:27:52,324 INFO L158 Benchmark]: Boogie Procedure Inliner took 124.21ms. Allocated memory is still 98.6MB. Free memory was 41.4MB in the beginning and 69.7MB in the end (delta: -28.3MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. [2022-02-21 04:27:52,324 INFO L158 Benchmark]: Boogie Preprocessor took 133.56ms. Allocated memory is still 98.6MB. Free memory was 69.7MB in the beginning and 60.8MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 04:27:52,324 INFO L158 Benchmark]: RCFGBuilder took 1605.52ms. Allocated memory was 98.6MB in the beginning and 130.0MB in the end (delta: 31.5MB). Free memory was 60.8MB in the beginning and 95.5MB in the end (delta: -34.7MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. [2022-02-21 04:27:52,325 INFO L158 Benchmark]: BuchiAutomizer took 14538.86ms. Allocated memory was 130.0MB in the beginning and 281.0MB in the end (delta: 151.0MB). Free memory was 95.5MB in the beginning and 125.7MB in the end (delta: -30.2MB). Peak memory consumption was 119.5MB. Max. memory is 16.1GB. [2022-02-21 04:27:52,325 INFO L158 Benchmark]: Witness Printer took 2.63ms. Allocated memory is still 281.0MB. Free memory is still 125.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:27:52,326 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.22ms. Allocated memory is still 98.6MB. Free memory is still 77.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 740.28ms. Allocated memory is still 98.6MB. Free memory was 58.7MB in the beginning and 41.4MB in the end (delta: 17.3MB). Peak memory consumption was 19.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 124.21ms. Allocated memory is still 98.6MB. Free memory was 41.4MB in the beginning and 69.7MB in the end (delta: -28.3MB). Peak memory consumption was 10.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 133.56ms. Allocated memory is still 98.6MB. Free memory was 69.7MB in the beginning and 60.8MB in the end (delta: 8.8MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * RCFGBuilder took 1605.52ms. Allocated memory was 98.6MB in the beginning and 130.0MB in the end (delta: 31.5MB). Free memory was 60.8MB in the beginning and 95.5MB in the end (delta: -34.7MB). Peak memory consumption was 47.1MB. Max. memory is 16.1GB. * BuchiAutomizer took 14538.86ms. Allocated memory was 130.0MB in the beginning and 281.0MB in the end (delta: 151.0MB). Free memory was 95.5MB in the beginning and 125.7MB in the end (delta: -30.2MB). Peak memory consumption was 119.5MB. Max. memory is 16.1GB. * Witness Printer took 2.63ms. Allocated memory is still 281.0MB. Free memory is still 125.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 19 + -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 14.5s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 7.3s. Construction of modules took 0.0s. Büchi inclusion checks took 6.2s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.3s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.1s Buchi closure took 0.0s. Biggest automaton had 828 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1474 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1474 mSDsluCounter, 9256 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 5395 mSDsCounter, 21 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 35 IncrementalHoareTripleChecker+Invalid, 56 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 21 mSolverCounterUnsat, 3861 mSDtfsCounter, 35 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI2 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital266 mio100 ax100 hnf100 lsp45 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq231 hnf85 smp100 dnf100 smp100 tf100 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 36ms VariablesStem: 0 VariablesLoop: 0 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 4 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.4s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 04:27:52,350 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