./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.2.ufo.BOUNDED-8.pals.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.2.ufo.BOUNDED-8.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 86aaf7922fe6f7f87277fe3baca1629811408ccdafec5bb956830ba2f5ff28a9 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:26:41,333 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:26:41,335 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:26:41,369 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:26:41,369 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:26:41,371 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:26:41,371 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:26:41,372 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:26:41,373 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:26:41,377 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:26:41,377 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:26:41,378 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:26:41,378 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:26:41,380 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:26:41,381 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:26:41,382 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:26:41,383 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:26:41,385 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:26:41,386 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:26:41,388 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:26:41,390 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:26:41,391 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:26:41,392 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:26:41,393 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:26:41,397 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:26:41,400 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:26:41,400 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:26:41,400 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:26:41,401 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:26:41,402 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:26:41,402 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:26:41,402 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:26:41,403 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:26:41,404 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:26:41,405 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:26:41,405 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:26:41,406 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:26:41,406 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:26:41,406 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:26:41,407 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:26:41,407 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:26:41,409 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:26:41,433 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:26:41,434 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:26:41,434 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:26:41,434 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:26:41,435 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:26:41,435 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:26:41,435 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:26:41,436 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:26:41,436 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:26:41,436 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:26:41,436 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:26:41,437 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:26:41,437 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:26:41,437 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:26:41,437 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:26:41,437 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:26:41,437 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:26:41,437 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:26:41,438 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:26:41,438 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:26:41,438 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:26:41,438 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:26:41,438 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:26:41,438 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:26:41,439 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:26:41,439 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:26:41,440 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:26:41,440 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:26:41,440 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:26:41,440 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:26:41,440 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:26:41,441 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:26:41,441 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 -> 86aaf7922fe6f7f87277fe3baca1629811408ccdafec5bb956830ba2f5ff28a9 [2022-02-21 04:26:41,641 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:26:41,659 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:26:41,661 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:26:41,662 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:26:41,662 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:26:41,663 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.2.ufo.BOUNDED-8.pals.c [2022-02-21 04:26:41,722 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa93a507f/3b5bc6fb93e646f8946a13cd593cc1ba/FLAG0099b8dc2 [2022-02-21 04:26:42,163 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:26:42,164 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.2.ufo.BOUNDED-8.pals.c [2022-02-21 04:26:42,177 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa93a507f/3b5bc6fb93e646f8946a13cd593cc1ba/FLAG0099b8dc2 [2022-02-21 04:26:42,190 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/aa93a507f/3b5bc6fb93e646f8946a13cd593cc1ba [2022-02-21 04:26:42,192 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:26:42,193 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:26:42,195 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:26:42,196 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:26:42,198 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:26:42,199 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:26:42" (1/1) ... [2022-02-21 04:26:42,199 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2aea7892 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:26:42, skipping insertion in model container [2022-02-21 04:26:42,200 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:26:42" (1/1) ... [2022-02-21 04:26:42,205 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:26:42,259 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:26:42,548 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.4.2.ufo.BOUNDED-8.pals.c[28194,28207] [2022-02-21 04:26:42,548 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:26:42,558 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:26:42,656 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.4.2.ufo.BOUNDED-8.pals.c[28194,28207] [2022-02-21 04:26:42,664 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:26:42,674 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:26:42,677 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:26:42 WrapperNode [2022-02-21 04:26:42,677 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:26:42,678 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:26:42,678 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:26:42,678 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:26:42,682 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:26:42" (1/1) ... [2022-02-21 04:26:42,702 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:26:42" (1/1) ... [2022-02-21 04:26:42,752 INFO L137 Inliner]: procedures = 23, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 925 [2022-02-21 04:26:42,763 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:26:42,764 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:26:42,765 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:26:42,765 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:26:42,771 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:26:42" (1/1) ... [2022-02-21 04:26:42,771 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:26:42" (1/1) ... [2022-02-21 04:26:42,777 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:26:42" (1/1) ... [2022-02-21 04:26:42,777 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:26:42" (1/1) ... [2022-02-21 04:26:42,790 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:26:42" (1/1) ... [2022-02-21 04:26:42,811 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:26:42" (1/1) ... [2022-02-21 04:26:42,813 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:26:42" (1/1) ... [2022-02-21 04:26:42,817 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:26:42,817 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:26:42,817 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:26:42,818 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:26:42,818 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:26:42" (1/1) ... [2022-02-21 04:26:42,835 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:42,845 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:42,870 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:26:42,920 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:26:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:26:42,921 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:26:42,921 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:26:42,911 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:26:43,069 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:26:43,071 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:26:43,781 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:26:43,795 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:26:43,795 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 04:26:43,797 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:26:43 BoogieIcfgContainer [2022-02-21 04:26:43,797 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:26:43,798 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:26:43,798 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:26:43,800 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:26:43,800 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:26:43,800 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:26:42" (1/3) ... [2022-02-21 04:26:43,801 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d4f0dd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:26:43, skipping insertion in model container [2022-02-21 04:26:43,801 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:26:43,801 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:26:42" (2/3) ... [2022-02-21 04:26:43,801 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@6d4f0dd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:26:43, skipping insertion in model container [2022-02-21 04:26:43,801 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:26:43,801 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:26:43" (3/3) ... [2022-02-21 04:26:43,802 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.4.2.ufo.BOUNDED-8.pals.c [2022-02-21 04:26:43,840 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:26:43,840 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:26:43,840 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:26:43,841 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:26:43,841 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:26:43,841 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:26:43,841 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:26:43,841 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:26:43,877 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 303 states, 302 states have (on average 1.804635761589404) internal successors, (545), 302 states have internal predecessors, (545), 0 states have call successors, (0), 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:26:43,967 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 107 [2022-02-21 04:26:43,967 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:26:43,967 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:26:43,976 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:26:43,976 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:26:43,976 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:26:43,979 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 303 states, 302 states have (on average 1.804635761589404) internal successors, (545), 302 states have internal predecessors, (545), 0 states have call successors, (0), 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:26:44,002 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 107 [2022-02-21 04:26:44,003 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:26:44,003 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:26:44,008 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:26:44,008 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:26:44,019 INFO L791 eck$LassoCheckResult]: Stem: 293#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~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; 204#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~nondet55#1, main_#t~ret56#1, main_#t~ret57#1, main_#t~post58#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~ep13~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~ep14~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~ep21~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~ep23~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~ep24~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~ep31~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~ep32~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~ep34~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~ep41~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep42~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep43~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id1~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~r1~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st1~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~nl1~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~m1~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~max1~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode1~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~id2~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~r2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~nl2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~m2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~max2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~mode2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~r3~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~st3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~nl3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~m3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~max3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~mode3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~id4~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~r4~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~st4~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~nl4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~m4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~max4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~mode4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0; 176#L393true assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 132#L404true init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 296#L414true assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 277#L425true init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 261#L435true assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; 275#L446true init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 121#L456true assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; 150#L467true init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 193#L477true assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; 67#L488true init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 85#L498true assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; 47#L509true init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 246#L519true assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; 44#L530true init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); 187#L540true assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; 194#L551true init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); 69#L561true assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; 117#L572true init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); 300#L582true assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; 74#L593true init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); 292#L603true assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; 203#L614true init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); 206#L624true assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; 24#L635true init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); 158#L645true assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; 103#L656true init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); 170#L666true assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; 8#L677true init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); 55#L687true assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; 262#L698true init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); 12#L708true assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; 233#L719true init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); 201#L729true assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; 210#L740true init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); 273#L750true assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; 98#L761true init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); 265#L771true assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; 140#L782true init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); 169#L792true assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; 22#L803true init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); 45#L813true assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; 267#L824true init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); 131#L834true assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; 134#L845true init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); 14#L855true assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; 167#L866true init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); 97#L876true assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; 143#L887true init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); 164#L897true assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; 122#L897-1true init_#res#1 := init_~tmp___23~0#1; 305#L1066true main_#t~ret56#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret56#1;havoc main_#t~ret56#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; 108#L21true assume !(0 == assume_abort_if_not_~cond#1); 173#L20true assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 101#L1203-2true [2022-02-21 04:26:44,026 INFO L793 eck$LassoCheckResult]: Loop: 101#L1203-2true assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1; 124#L109true assume !(0 != ~mode1~0 % 256); 46#L141true assume !(~r1~0 < 3); 285#L141-1true ~mode1~0 := 1; 146#L109-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1; 197#L162true assume !(0 != ~mode2~0 % 256); 263#L194true assume !(~r2~0 < 3); 6#L194-1true ~mode2~0 := 1; 58#L162-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1; 155#L215true assume !(0 != ~mode3~0 % 256); 119#L247true assume !(~r3~0 < 3); 286#L247-1true ~mode3~0 := 1; 294#L215-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1; 182#L268true assume !(0 != ~mode4~0 % 256); 231#L300true assume !(~r4~0 < 3); 48#L300-1true ~mode4~0 := 1; 270#L268-2true assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 200#L1074true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; 195#L1074-1true check_#res#1 := check_~tmp~1#1; 253#L1126true main_#t~ret57#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret57#1;havoc main_#t~ret57#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; 43#L1246true assume !(0 == assert_~arg#1 % 256); 36#L1241true assume { :end_inline_assert } true;main_#t~post58#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post58#1;havoc main_#t~post58#1; 101#L1203-2true [2022-02-21 04:26:44,031 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:26:44,031 INFO L85 PathProgramCache]: Analyzing trace with hash 2041231622, now seen corresponding path program 1 times [2022-02-21 04:26:44,039 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:26:44,039 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661566978] [2022-02-21 04:26:44,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:26:44,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:26:44,218 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:26:44,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {307#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~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; {307#true} is VALID [2022-02-21 04:26:44,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {307#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~nondet55#1, main_#t~ret56#1, main_#t~ret57#1, main_#t~post58#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~ep13~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~ep14~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~ep21~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~ep23~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~ep24~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~ep31~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~ep32~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~ep34~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~ep41~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep42~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep43~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id1~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~r1~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st1~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~nl1~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~m1~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~max1~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode1~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~id2~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~r2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~nl2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~m2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~max2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~mode2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~r3~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~st3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~nl3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~m3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~max3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~mode3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~id4~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~r4~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~st4~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~nl4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~m4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~max4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~mode4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0; {307#true} is VALID [2022-02-21 04:26:44,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {307#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {307#true} is VALID [2022-02-21 04:26:44,335 INFO L290 TraceCheckUtils]: 3: Hoare triple {307#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:26:44,335 INFO L290 TraceCheckUtils]: 4: Hoare triple {307#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {307#true} is VALID [2022-02-21 04:26:44,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {307#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:26:44,336 INFO L290 TraceCheckUtils]: 6: Hoare triple {307#true} assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; {307#true} is VALID [2022-02-21 04:26:44,336 INFO L290 TraceCheckUtils]: 7: Hoare triple {307#true} init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:26:44,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {307#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; {307#true} is VALID [2022-02-21 04:26:44,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {307#true} init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:26:44,336 INFO L290 TraceCheckUtils]: 10: Hoare triple {307#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; {307#true} is VALID [2022-02-21 04:26:44,337 INFO L290 TraceCheckUtils]: 11: Hoare triple {307#true} init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:26:44,337 INFO L290 TraceCheckUtils]: 12: Hoare triple {307#true} assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; {307#true} is VALID [2022-02-21 04:26:44,337 INFO L290 TraceCheckUtils]: 13: Hoare triple {307#true} init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:26:44,337 INFO L290 TraceCheckUtils]: 14: Hoare triple {307#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; {307#true} is VALID [2022-02-21 04:26:44,337 INFO L290 TraceCheckUtils]: 15: Hoare triple {307#true} init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:26:44,338 INFO L290 TraceCheckUtils]: 16: Hoare triple {307#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; {307#true} is VALID [2022-02-21 04:26:44,338 INFO L290 TraceCheckUtils]: 17: Hoare triple {307#true} init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:26:44,338 INFO L290 TraceCheckUtils]: 18: Hoare triple {307#true} assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; {307#true} is VALID [2022-02-21 04:26:44,338 INFO L290 TraceCheckUtils]: 19: Hoare triple {307#true} init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:26:44,339 INFO L290 TraceCheckUtils]: 20: Hoare triple {307#true} assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; {307#true} is VALID [2022-02-21 04:26:44,339 INFO L290 TraceCheckUtils]: 21: Hoare triple {307#true} init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:26:44,339 INFO L290 TraceCheckUtils]: 22: Hoare triple {307#true} assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; {307#true} is VALID [2022-02-21 04:26:44,339 INFO L290 TraceCheckUtils]: 23: Hoare triple {307#true} init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:26:44,339 INFO L290 TraceCheckUtils]: 24: Hoare triple {307#true} assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; {307#true} is VALID [2022-02-21 04:26:44,340 INFO L290 TraceCheckUtils]: 25: Hoare triple {307#true} init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:26:44,340 INFO L290 TraceCheckUtils]: 26: Hoare triple {307#true} assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; {307#true} is VALID [2022-02-21 04:26:44,340 INFO L290 TraceCheckUtils]: 27: Hoare triple {307#true} init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:26:44,340 INFO L290 TraceCheckUtils]: 28: Hoare triple {307#true} assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; {307#true} is VALID [2022-02-21 04:26:44,340 INFO L290 TraceCheckUtils]: 29: Hoare triple {307#true} init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:26:44,341 INFO L290 TraceCheckUtils]: 30: Hoare triple {307#true} assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; {307#true} is VALID [2022-02-21 04:26:44,341 INFO L290 TraceCheckUtils]: 31: Hoare triple {307#true} init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:26:44,341 INFO L290 TraceCheckUtils]: 32: Hoare triple {307#true} assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; {307#true} is VALID [2022-02-21 04:26:44,341 INFO L290 TraceCheckUtils]: 33: Hoare triple {307#true} init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:26:44,341 INFO L290 TraceCheckUtils]: 34: Hoare triple {307#true} assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; {307#true} is VALID [2022-02-21 04:26:44,342 INFO L290 TraceCheckUtils]: 35: Hoare triple {307#true} init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:26:44,342 INFO L290 TraceCheckUtils]: 36: Hoare triple {307#true} assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; {307#true} is VALID [2022-02-21 04:26:44,342 INFO L290 TraceCheckUtils]: 37: Hoare triple {307#true} init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:26:44,343 INFO L290 TraceCheckUtils]: 38: Hoare triple {307#true} assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; {307#true} is VALID [2022-02-21 04:26:44,343 INFO L290 TraceCheckUtils]: 39: Hoare triple {307#true} init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:26:44,343 INFO L290 TraceCheckUtils]: 40: Hoare triple {307#true} assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; {307#true} is VALID [2022-02-21 04:26:44,343 INFO L290 TraceCheckUtils]: 41: Hoare triple {307#true} init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:26:44,344 INFO L290 TraceCheckUtils]: 42: Hoare triple {307#true} assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; {307#true} is VALID [2022-02-21 04:26:44,344 INFO L290 TraceCheckUtils]: 43: Hoare triple {307#true} init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:26:44,344 INFO L290 TraceCheckUtils]: 44: Hoare triple {307#true} assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; {307#true} is VALID [2022-02-21 04:26:44,345 INFO L290 TraceCheckUtils]: 45: Hoare triple {307#true} init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:26:44,345 INFO L290 TraceCheckUtils]: 46: Hoare triple {307#true} assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; {307#true} is VALID [2022-02-21 04:26:44,345 INFO L290 TraceCheckUtils]: 47: Hoare triple {307#true} init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:26:44,345 INFO L290 TraceCheckUtils]: 48: Hoare triple {307#true} assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; {307#true} is VALID [2022-02-21 04:26:44,348 INFO L290 TraceCheckUtils]: 49: Hoare triple {307#true} init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:26:44,349 INFO L290 TraceCheckUtils]: 50: Hoare triple {307#true} assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; {309#(= |ULTIMATE.start_init_~tmp___23~0#1| 0)} is VALID [2022-02-21 04:26:44,350 INFO L290 TraceCheckUtils]: 51: Hoare triple {309#(= |ULTIMATE.start_init_~tmp___23~0#1| 0)} init_#res#1 := init_~tmp___23~0#1; {310#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:26:44,352 INFO L290 TraceCheckUtils]: 52: Hoare triple {310#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret56#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret56#1;havoc main_#t~ret56#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; {311#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:26:44,353 INFO L290 TraceCheckUtils]: 53: Hoare triple {311#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {308#false} is VALID [2022-02-21 04:26:44,353 INFO L290 TraceCheckUtils]: 54: Hoare triple {308#false} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {308#false} is VALID [2022-02-21 04:26:44,354 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:26:44,355 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:26:44,355 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [661566978] [2022-02-21 04:26:44,356 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [661566978] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:26:44,356 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:26:44,357 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:26:44,359 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1328902411] [2022-02-21 04:26:44,360 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:26:44,363 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:26:44,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:26:44,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1319514639, now seen corresponding path program 1 times [2022-02-21 04:26:44,367 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:26:44,367 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861876177] [2022-02-21 04:26:44,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:26:44,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:26:44,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:26:44,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {312#true} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1; {312#true} is VALID [2022-02-21 04:26:44,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {312#true} assume !(0 != ~mode1~0 % 256); {312#true} is VALID [2022-02-21 04:26:44,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {312#true} assume !(~r1~0 < 3); {312#true} is VALID [2022-02-21 04:26:44,486 INFO L290 TraceCheckUtils]: 3: Hoare triple {312#true} ~mode1~0 := 1; {312#true} is VALID [2022-02-21 04:26:44,487 INFO L290 TraceCheckUtils]: 4: Hoare triple {312#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1; {312#true} is VALID [2022-02-21 04:26:44,487 INFO L290 TraceCheckUtils]: 5: Hoare triple {312#true} assume !(0 != ~mode2~0 % 256); {312#true} is VALID [2022-02-21 04:26:44,487 INFO L290 TraceCheckUtils]: 6: Hoare triple {312#true} assume !(~r2~0 < 3); {312#true} is VALID [2022-02-21 04:26:44,487 INFO L290 TraceCheckUtils]: 7: Hoare triple {312#true} ~mode2~0 := 1; {312#true} is VALID [2022-02-21 04:26:44,488 INFO L290 TraceCheckUtils]: 8: Hoare triple {312#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1; {312#true} is VALID [2022-02-21 04:26:44,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {312#true} assume !(0 != ~mode3~0 % 256); {312#true} is VALID [2022-02-21 04:26:44,488 INFO L290 TraceCheckUtils]: 10: Hoare triple {312#true} assume !(~r3~0 < 3); {312#true} is VALID [2022-02-21 04:26:44,488 INFO L290 TraceCheckUtils]: 11: Hoare triple {312#true} ~mode3~0 := 1; {312#true} is VALID [2022-02-21 04:26:44,489 INFO L290 TraceCheckUtils]: 12: Hoare triple {312#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1; {312#true} is VALID [2022-02-21 04:26:44,489 INFO L290 TraceCheckUtils]: 13: Hoare triple {312#true} assume !(0 != ~mode4~0 % 256); {312#true} is VALID [2022-02-21 04:26:44,489 INFO L290 TraceCheckUtils]: 14: Hoare triple {312#true} assume !(~r4~0 < 3); {312#true} is VALID [2022-02-21 04:26:44,489 INFO L290 TraceCheckUtils]: 15: Hoare triple {312#true} ~mode4~0 := 1; {312#true} is VALID [2022-02-21 04:26:44,489 INFO L290 TraceCheckUtils]: 16: Hoare triple {312#true} assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {312#true} is VALID [2022-02-21 04:26:44,490 INFO L290 TraceCheckUtils]: 17: Hoare triple {312#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {314#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:26:44,491 INFO L290 TraceCheckUtils]: 18: Hoare triple {314#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {315#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:26:44,491 INFO L290 TraceCheckUtils]: 19: Hoare triple {315#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret57#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret57#1;havoc main_#t~ret57#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; {316#(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:26:44,492 INFO L290 TraceCheckUtils]: 20: Hoare triple {316#(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); {313#false} is VALID [2022-02-21 04:26:44,492 INFO L290 TraceCheckUtils]: 21: Hoare triple {313#false} assume { :end_inline_assert } true;main_#t~post58#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post58#1;havoc main_#t~post58#1; {313#false} is VALID [2022-02-21 04:26:44,493 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:26:44,494 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:26:44,494 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861876177] [2022-02-21 04:26:44,494 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861876177] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:26:44,494 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:26:44,495 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:26:44,495 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803168025] [2022-02-21 04:26:44,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:26:44,496 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:26:44,496 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:26:44,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:26:44,518 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:26:44,520 INFO L87 Difference]: Start difference. First operand has 303 states, 302 states have (on average 1.804635761589404) internal successors, (545), 302 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:26:45,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:26:45,509 INFO L93 Difference]: Finished difference Result 307 states and 545 transitions. [2022-02-21 04:26:45,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:26:45,510 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:26:45,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:26:45,533 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 307 states and 545 transitions. [2022-02-21 04:26:45,544 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2022-02-21 04:26:45,557 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 307 states to 298 states and 528 transitions. [2022-02-21 04:26:45,558 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 298 [2022-02-21 04:26:45,559 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 298 [2022-02-21 04:26:45,559 INFO L73 IsDeterministic]: Start isDeterministic. Operand 298 states and 528 transitions. [2022-02-21 04:26:45,562 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:26:45,563 INFO L681 BuchiCegarLoop]: Abstraction has 298 states and 528 transitions. [2022-02-21 04:26:45,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states and 528 transitions. [2022-02-21 04:26:45,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2022-02-21 04:26:45,608 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:26:45,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 298 states and 528 transitions. Second operand has 298 states, 298 states have (on average 1.7718120805369129) internal successors, (528), 297 states have internal predecessors, (528), 0 states have call successors, (0), 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:26:45,615 INFO L74 IsIncluded]: Start isIncluded. First operand 298 states and 528 transitions. Second operand has 298 states, 298 states have (on average 1.7718120805369129) internal successors, (528), 297 states have internal predecessors, (528), 0 states have call successors, (0), 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:26:45,617 INFO L87 Difference]: Start difference. First operand 298 states and 528 transitions. Second operand has 298 states, 298 states have (on average 1.7718120805369129) internal successors, (528), 297 states have internal predecessors, (528), 0 states have call successors, (0), 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:26:45,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:26:45,628 INFO L93 Difference]: Finished difference Result 298 states and 528 transitions. [2022-02-21 04:26:45,629 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 528 transitions. [2022-02-21 04:26:45,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:26:45,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:26:45,636 INFO L74 IsIncluded]: Start isIncluded. First operand has 298 states, 298 states have (on average 1.7718120805369129) internal successors, (528), 297 states have internal predecessors, (528), 0 states have call successors, (0), 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 298 states and 528 transitions. [2022-02-21 04:26:45,636 INFO L87 Difference]: Start difference. First operand has 298 states, 298 states have (on average 1.7718120805369129) internal successors, (528), 297 states have internal predecessors, (528), 0 states have call successors, (0), 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 298 states and 528 transitions. [2022-02-21 04:26:45,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:26:45,645 INFO L93 Difference]: Finished difference Result 298 states and 528 transitions. [2022-02-21 04:26:45,646 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 528 transitions. [2022-02-21 04:26:45,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:26:45,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:26:45,647 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:26:45,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:26:45,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 298 states have (on average 1.7718120805369129) internal successors, (528), 297 states have internal predecessors, (528), 0 states have call successors, (0), 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:26:45,655 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 528 transitions. [2022-02-21 04:26:45,656 INFO L704 BuchiCegarLoop]: Abstraction has 298 states and 528 transitions. [2022-02-21 04:26:45,656 INFO L587 BuchiCegarLoop]: Abstraction has 298 states and 528 transitions. [2022-02-21 04:26:45,656 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:26:45,657 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 298 states and 528 transitions. [2022-02-21 04:26:45,658 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2022-02-21 04:26:45,658 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:26:45,658 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:26:45,659 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:26:45,659 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:26:45,659 INFO L791 eck$LassoCheckResult]: Stem: 925#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~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; 895#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~nondet55#1, main_#t~ret56#1, main_#t~ret57#1, main_#t~post58#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~ep13~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~ep14~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~ep21~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~ep23~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~ep24~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~ep31~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~ep32~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~ep34~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~ep41~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep42~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep43~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id1~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~r1~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st1~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~nl1~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~m1~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~max1~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode1~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~id2~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~r2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~nl2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~m2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~max2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~mode2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~r3~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~st3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~nl3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~m3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~max3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~mode3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~id4~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~r4~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~st4~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~nl4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~m4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~max4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~mode4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0; 878#L393 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 779#L404 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 848#L414 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 667#L425 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 922#L435 assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; 713#L446 init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 833#L456 assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; 746#L467 init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 862#L477 assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; 756#L488 init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 757#L498 assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; 695#L509 init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 728#L519 assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; 718#L530 init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); 720#L540 assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; 832#L551 init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); 760#L561 assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; 737#L572 init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); 828#L582 assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; 671#L593 init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); 769#L603 assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; 701#L614 init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); 894#L624 assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; 680#L635 init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); 681#L645 assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; 704#L656 init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); 812#L666 assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; 641#L677 init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); 642#L687 assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; 709#L698 init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); 651#L708 assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; 652#L719 init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); 892#L729 assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; 630#L740 init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); 898#L750 assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; 805#L761 init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); 806#L771 assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; 771#L782 init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); 854#L792 assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; 647#L803 init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); 679#L813 assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; 721#L824 init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); 847#L834 assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; 698#L845 init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); 656#L855 assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; 657#L866 init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); 804#L876 assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; 675#L887 init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); 856#L897 assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; 634#L897-1 init_#res#1 := init_~tmp___23~0#1; 834#L1066 main_#t~ret56#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret56#1;havoc main_#t~ret56#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; 817#L21 assume !(0 == assume_abort_if_not_~cond#1); 818#L20 assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 707#L1203-2 [2022-02-21 04:26:45,659 INFO L793 eck$LassoCheckResult]: Loop: 707#L1203-2 assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1; 809#L109 assume !(0 != ~mode1~0 % 256); 723#L141 assume !(~r1~0 < 3); 724#L141-1 ~mode1~0 := 1; 858#L109-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1; 859#L162 assume !(0 != ~mode2~0 % 256); 889#L194 assume !(~r2~0 < 3); 636#L194-1 ~mode2~0 := 1; 637#L162-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1; 745#L215 assume !(0 != ~mode3~0 % 256); 829#L247 assume !(~r3~0 < 3); 692#L247-1 ~mode3~0 := 1; 886#L215-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1; 880#L268 assume !(0 != ~mode4~0 % 256); 881#L300 assume !(~r4~0 < 3); 726#L300-1 ~mode4~0 := 1; 727#L268-2 assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 891#L1074 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 837#L1075 assume ~st1~0 + ~nl1~0 <= 1; 838#L1076 assume ~st2~0 + ~nl2~0 <= 1; 861#L1077 assume ~st3~0 + ~nl3~0 <= 1; 735#L1078 assume ~st4~0 + ~nl4~0 <= 1; 648#L1079 assume ~r1~0 >= 3; 650#L1083 assume ~r1~0 < 3; 867#L1088 assume ~r1~0 >= 3; 884#L1093 assume ~r1~0 < 3;check_~tmp~1#1 := 1; 872#L1074-1 check_#res#1 := check_~tmp~1#1; 887#L1126 main_#t~ret57#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret57#1;havoc main_#t~ret57#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; 719#L1246 assume !(0 == assert_~arg#1 % 256); 706#L1241 assume { :end_inline_assert } true;main_#t~post58#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post58#1;havoc main_#t~post58#1; 707#L1203-2 [2022-02-21 04:26:45,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:26:45,660 INFO L85 PathProgramCache]: Analyzing trace with hash 2041231622, now seen corresponding path program 2 times [2022-02-21 04:26:45,660 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:26:45,660 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129715329] [2022-02-21 04:26:45,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:26:45,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:26:45,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:26:45,715 INFO L290 TraceCheckUtils]: 0: Hoare triple {1525#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~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; {1525#true} is VALID [2022-02-21 04:26:45,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {1525#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~nondet55#1, main_#t~ret56#1, main_#t~ret57#1, main_#t~post58#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~ep13~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~ep14~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~ep21~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~ep23~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~ep24~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~ep31~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~ep32~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~ep34~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~ep41~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep42~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep43~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id1~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~r1~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st1~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~nl1~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~m1~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~max1~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode1~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~id2~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~r2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~nl2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~m2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~max2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~mode2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~r3~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~st3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~nl3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~m3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~max3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~mode3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~id4~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~r4~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~st4~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~nl4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~m4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~max4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~mode4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0; {1525#true} is VALID [2022-02-21 04:26:45,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {1525#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {1525#true} is VALID [2022-02-21 04:26:45,716 INFO L290 TraceCheckUtils]: 3: Hoare triple {1525#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:26:45,716 INFO L290 TraceCheckUtils]: 4: Hoare triple {1525#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {1525#true} is VALID [2022-02-21 04:26:45,717 INFO L290 TraceCheckUtils]: 5: Hoare triple {1525#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:26:45,717 INFO L290 TraceCheckUtils]: 6: Hoare triple {1525#true} assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; {1525#true} is VALID [2022-02-21 04:26:45,717 INFO L290 TraceCheckUtils]: 7: Hoare triple {1525#true} init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:26:45,717 INFO L290 TraceCheckUtils]: 8: Hoare triple {1525#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; {1525#true} is VALID [2022-02-21 04:26:45,717 INFO L290 TraceCheckUtils]: 9: Hoare triple {1525#true} init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:26:45,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {1525#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; {1525#true} is VALID [2022-02-21 04:26:45,718 INFO L290 TraceCheckUtils]: 11: Hoare triple {1525#true} init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:26:45,718 INFO L290 TraceCheckUtils]: 12: Hoare triple {1525#true} assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; {1525#true} is VALID [2022-02-21 04:26:45,718 INFO L290 TraceCheckUtils]: 13: Hoare triple {1525#true} init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:26:45,718 INFO L290 TraceCheckUtils]: 14: Hoare triple {1525#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; {1525#true} is VALID [2022-02-21 04:26:45,718 INFO L290 TraceCheckUtils]: 15: Hoare triple {1525#true} init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:26:45,718 INFO L290 TraceCheckUtils]: 16: Hoare triple {1525#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; {1525#true} is VALID [2022-02-21 04:26:45,719 INFO L290 TraceCheckUtils]: 17: Hoare triple {1525#true} init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:26:45,719 INFO L290 TraceCheckUtils]: 18: Hoare triple {1525#true} assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; {1525#true} is VALID [2022-02-21 04:26:45,719 INFO L290 TraceCheckUtils]: 19: Hoare triple {1525#true} init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:26:45,719 INFO L290 TraceCheckUtils]: 20: Hoare triple {1525#true} assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; {1525#true} is VALID [2022-02-21 04:26:45,719 INFO L290 TraceCheckUtils]: 21: Hoare triple {1525#true} init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:26:45,719 INFO L290 TraceCheckUtils]: 22: Hoare triple {1525#true} assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; {1525#true} is VALID [2022-02-21 04:26:45,720 INFO L290 TraceCheckUtils]: 23: Hoare triple {1525#true} init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:26:45,720 INFO L290 TraceCheckUtils]: 24: Hoare triple {1525#true} assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; {1525#true} is VALID [2022-02-21 04:26:45,720 INFO L290 TraceCheckUtils]: 25: Hoare triple {1525#true} init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:26:45,720 INFO L290 TraceCheckUtils]: 26: Hoare triple {1525#true} assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; {1525#true} is VALID [2022-02-21 04:26:45,720 INFO L290 TraceCheckUtils]: 27: Hoare triple {1525#true} init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:26:45,720 INFO L290 TraceCheckUtils]: 28: Hoare triple {1525#true} assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; {1525#true} is VALID [2022-02-21 04:26:45,721 INFO L290 TraceCheckUtils]: 29: Hoare triple {1525#true} init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:26:45,721 INFO L290 TraceCheckUtils]: 30: Hoare triple {1525#true} assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; {1525#true} is VALID [2022-02-21 04:26:45,721 INFO L290 TraceCheckUtils]: 31: Hoare triple {1525#true} init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:26:45,721 INFO L290 TraceCheckUtils]: 32: Hoare triple {1525#true} assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; {1525#true} is VALID [2022-02-21 04:26:45,721 INFO L290 TraceCheckUtils]: 33: Hoare triple {1525#true} init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:26:45,721 INFO L290 TraceCheckUtils]: 34: Hoare triple {1525#true} assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; {1525#true} is VALID [2022-02-21 04:26:45,721 INFO L290 TraceCheckUtils]: 35: Hoare triple {1525#true} init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:26:45,722 INFO L290 TraceCheckUtils]: 36: Hoare triple {1525#true} assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; {1525#true} is VALID [2022-02-21 04:26:45,722 INFO L290 TraceCheckUtils]: 37: Hoare triple {1525#true} init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:26:45,722 INFO L290 TraceCheckUtils]: 38: Hoare triple {1525#true} assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; {1525#true} is VALID [2022-02-21 04:26:45,722 INFO L290 TraceCheckUtils]: 39: Hoare triple {1525#true} init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:26:45,722 INFO L290 TraceCheckUtils]: 40: Hoare triple {1525#true} assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; {1525#true} is VALID [2022-02-21 04:26:45,722 INFO L290 TraceCheckUtils]: 41: Hoare triple {1525#true} init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:26:45,723 INFO L290 TraceCheckUtils]: 42: Hoare triple {1525#true} assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; {1525#true} is VALID [2022-02-21 04:26:45,723 INFO L290 TraceCheckUtils]: 43: Hoare triple {1525#true} init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:26:45,723 INFO L290 TraceCheckUtils]: 44: Hoare triple {1525#true} assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; {1525#true} is VALID [2022-02-21 04:26:45,723 INFO L290 TraceCheckUtils]: 45: Hoare triple {1525#true} init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:26:45,723 INFO L290 TraceCheckUtils]: 46: Hoare triple {1525#true} assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; {1525#true} is VALID [2022-02-21 04:26:45,723 INFO L290 TraceCheckUtils]: 47: Hoare triple {1525#true} init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:26:45,724 INFO L290 TraceCheckUtils]: 48: Hoare triple {1525#true} assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; {1525#true} is VALID [2022-02-21 04:26:45,724 INFO L290 TraceCheckUtils]: 49: Hoare triple {1525#true} init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:26:45,724 INFO L290 TraceCheckUtils]: 50: Hoare triple {1525#true} assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; {1527#(= |ULTIMATE.start_init_~tmp___23~0#1| 0)} is VALID [2022-02-21 04:26:45,725 INFO L290 TraceCheckUtils]: 51: Hoare triple {1527#(= |ULTIMATE.start_init_~tmp___23~0#1| 0)} init_#res#1 := init_~tmp___23~0#1; {1528#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:26:45,725 INFO L290 TraceCheckUtils]: 52: Hoare triple {1528#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret56#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret56#1;havoc main_#t~ret56#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; {1529#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:26:45,726 INFO L290 TraceCheckUtils]: 53: Hoare triple {1529#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {1526#false} is VALID [2022-02-21 04:26:45,726 INFO L290 TraceCheckUtils]: 54: Hoare triple {1526#false} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1526#false} is VALID [2022-02-21 04:26:45,726 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:26:45,726 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:26:45,726 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129715329] [2022-02-21 04:26:45,727 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129715329] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:26:45,727 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:26:45,727 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:26:45,727 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330490787] [2022-02-21 04:26:45,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:26:45,727 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:26:45,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:26:45,728 INFO L85 PathProgramCache]: Analyzing trace with hash 94444480, now seen corresponding path program 1 times [2022-02-21 04:26:45,728 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:26:45,728 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [726596653] [2022-02-21 04:26:45,728 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:26:45,729 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:26:45,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:26:45,750 INFO L290 TraceCheckUtils]: 0: Hoare triple {1530#true} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1; {1530#true} is VALID [2022-02-21 04:26:45,751 INFO L290 TraceCheckUtils]: 1: Hoare triple {1530#true} assume !(0 != ~mode1~0 % 256); {1530#true} is VALID [2022-02-21 04:26:45,751 INFO L290 TraceCheckUtils]: 2: Hoare triple {1530#true} assume !(~r1~0 < 3); {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:26:45,752 INFO L290 TraceCheckUtils]: 3: Hoare triple {1532#(not (<= ~r1~0 2))} ~mode1~0 := 1; {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:26:45,752 INFO L290 TraceCheckUtils]: 4: Hoare triple {1532#(not (<= ~r1~0 2))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1; {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:26:45,752 INFO L290 TraceCheckUtils]: 5: Hoare triple {1532#(not (<= ~r1~0 2))} assume !(0 != ~mode2~0 % 256); {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:26:45,753 INFO L290 TraceCheckUtils]: 6: Hoare triple {1532#(not (<= ~r1~0 2))} assume !(~r2~0 < 3); {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:26:45,753 INFO L290 TraceCheckUtils]: 7: Hoare triple {1532#(not (<= ~r1~0 2))} ~mode2~0 := 1; {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:26:45,753 INFO L290 TraceCheckUtils]: 8: Hoare triple {1532#(not (<= ~r1~0 2))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1; {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:26:45,754 INFO L290 TraceCheckUtils]: 9: Hoare triple {1532#(not (<= ~r1~0 2))} assume !(0 != ~mode3~0 % 256); {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:26:45,754 INFO L290 TraceCheckUtils]: 10: Hoare triple {1532#(not (<= ~r1~0 2))} assume !(~r3~0 < 3); {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:26:45,754 INFO L290 TraceCheckUtils]: 11: Hoare triple {1532#(not (<= ~r1~0 2))} ~mode3~0 := 1; {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:26:45,754 INFO L290 TraceCheckUtils]: 12: Hoare triple {1532#(not (<= ~r1~0 2))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1; {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:26:45,755 INFO L290 TraceCheckUtils]: 13: Hoare triple {1532#(not (<= ~r1~0 2))} assume !(0 != ~mode4~0 % 256); {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:26:45,755 INFO L290 TraceCheckUtils]: 14: Hoare triple {1532#(not (<= ~r1~0 2))} assume !(~r4~0 < 3); {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:26:45,755 INFO L290 TraceCheckUtils]: 15: Hoare triple {1532#(not (<= ~r1~0 2))} ~mode4~0 := 1; {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:26:45,756 INFO L290 TraceCheckUtils]: 16: Hoare triple {1532#(not (<= ~r1~0 2))} assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:26:45,756 INFO L290 TraceCheckUtils]: 17: Hoare triple {1532#(not (<= ~r1~0 2))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:26:45,757 INFO L290 TraceCheckUtils]: 18: Hoare triple {1532#(not (<= ~r1~0 2))} assume ~st1~0 + ~nl1~0 <= 1; {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:26:45,757 INFO L290 TraceCheckUtils]: 19: Hoare triple {1532#(not (<= ~r1~0 2))} assume ~st2~0 + ~nl2~0 <= 1; {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:26:45,757 INFO L290 TraceCheckUtils]: 20: Hoare triple {1532#(not (<= ~r1~0 2))} assume ~st3~0 + ~nl3~0 <= 1; {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:26:45,757 INFO L290 TraceCheckUtils]: 21: Hoare triple {1532#(not (<= ~r1~0 2))} assume ~st4~0 + ~nl4~0 <= 1; {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:26:45,758 INFO L290 TraceCheckUtils]: 22: Hoare triple {1532#(not (<= ~r1~0 2))} assume ~r1~0 >= 3; {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:26:45,758 INFO L290 TraceCheckUtils]: 23: Hoare triple {1532#(not (<= ~r1~0 2))} assume ~r1~0 < 3; {1531#false} is VALID [2022-02-21 04:26:45,758 INFO L290 TraceCheckUtils]: 24: Hoare triple {1531#false} assume ~r1~0 >= 3; {1531#false} is VALID [2022-02-21 04:26:45,759 INFO L290 TraceCheckUtils]: 25: Hoare triple {1531#false} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {1531#false} is VALID [2022-02-21 04:26:45,759 INFO L290 TraceCheckUtils]: 26: Hoare triple {1531#false} check_#res#1 := check_~tmp~1#1; {1531#false} is VALID [2022-02-21 04:26:45,759 INFO L290 TraceCheckUtils]: 27: Hoare triple {1531#false} main_#t~ret57#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret57#1;havoc main_#t~ret57#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; {1531#false} is VALID [2022-02-21 04:26:45,759 INFO L290 TraceCheckUtils]: 28: Hoare triple {1531#false} assume !(0 == assert_~arg#1 % 256); {1531#false} is VALID [2022-02-21 04:26:45,759 INFO L290 TraceCheckUtils]: 29: Hoare triple {1531#false} assume { :end_inline_assert } true;main_#t~post58#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post58#1;havoc main_#t~post58#1; {1531#false} is VALID [2022-02-21 04:26:45,759 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:26:45,760 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:26:45,760 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [726596653] [2022-02-21 04:26:45,760 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [726596653] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:26:45,760 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:26:45,760 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:26:45,760 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559773258] [2022-02-21 04:26:45,760 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:26:45,761 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:26:45,761 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:26:45,761 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:26:45,761 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:26:45,762 INFO L87 Difference]: Start difference. First operand 298 states and 528 transitions. cyclomatic complexity: 231 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:26:46,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:26:46,180 INFO L93 Difference]: Finished difference Result 382 states and 661 transitions. [2022-02-21 04:26:46,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:26:46,181 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:26:46,204 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:26:46,205 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 382 states and 661 transitions. [2022-02-21 04:26:46,213 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 190 [2022-02-21 04:26:46,221 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 382 states to 382 states and 661 transitions. [2022-02-21 04:26:46,221 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 382 [2022-02-21 04:26:46,222 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 382 [2022-02-21 04:26:46,222 INFO L73 IsDeterministic]: Start isDeterministic. Operand 382 states and 661 transitions. [2022-02-21 04:26:46,222 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:26:46,223 INFO L681 BuchiCegarLoop]: Abstraction has 382 states and 661 transitions. [2022-02-21 04:26:46,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 382 states and 661 transitions. [2022-02-21 04:26:46,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 382 to 382. [2022-02-21 04:26:46,227 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:26:46,228 INFO L82 GeneralOperation]: Start isEquivalent. First operand 382 states and 661 transitions. Second operand has 382 states, 382 states have (on average 1.7303664921465969) internal successors, (661), 381 states have internal predecessors, (661), 0 states have call successors, (0), 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:26:46,229 INFO L74 IsIncluded]: Start isIncluded. First operand 382 states and 661 transitions. Second operand has 382 states, 382 states have (on average 1.7303664921465969) internal successors, (661), 381 states have internal predecessors, (661), 0 states have call successors, (0), 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:26:46,229 INFO L87 Difference]: Start difference. First operand 382 states and 661 transitions. Second operand has 382 states, 382 states have (on average 1.7303664921465969) internal successors, (661), 381 states have internal predecessors, (661), 0 states have call successors, (0), 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:26:46,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:26:46,237 INFO L93 Difference]: Finished difference Result 382 states and 661 transitions. [2022-02-21 04:26:46,237 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 661 transitions. [2022-02-21 04:26:46,238 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:26:46,238 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:26:46,238 INFO L74 IsIncluded]: Start isIncluded. First operand has 382 states, 382 states have (on average 1.7303664921465969) internal successors, (661), 381 states have internal predecessors, (661), 0 states have call successors, (0), 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 382 states and 661 transitions. [2022-02-21 04:26:46,239 INFO L87 Difference]: Start difference. First operand has 382 states, 382 states have (on average 1.7303664921465969) internal successors, (661), 381 states have internal predecessors, (661), 0 states have call successors, (0), 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 382 states and 661 transitions. [2022-02-21 04:26:46,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:26:46,247 INFO L93 Difference]: Finished difference Result 382 states and 661 transitions. [2022-02-21 04:26:46,247 INFO L276 IsEmpty]: Start isEmpty. Operand 382 states and 661 transitions. [2022-02-21 04:26:46,248 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:26:46,248 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:26:46,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:26:46,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:26:46,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 382 states, 382 states have (on average 1.7303664921465969) internal successors, (661), 381 states have internal predecessors, (661), 0 states have call successors, (0), 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:26:46,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 382 states to 382 states and 661 transitions. [2022-02-21 04:26:46,256 INFO L704 BuchiCegarLoop]: Abstraction has 382 states and 661 transitions. [2022-02-21 04:26:46,256 INFO L587 BuchiCegarLoop]: Abstraction has 382 states and 661 transitions. [2022-02-21 04:26:46,256 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:26:46,256 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 382 states and 661 transitions. [2022-02-21 04:26:46,257 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 190 [2022-02-21 04:26:46,257 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:26:46,257 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:26:46,258 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:26:46,258 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:26:46,258 INFO L791 eck$LassoCheckResult]: Stem: 2216#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~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; 2185#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~nondet55#1, main_#t~ret56#1, main_#t~ret57#1, main_#t~post58#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~ep13~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~ep14~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~ep21~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~ep23~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~ep24~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~ep31~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~ep32~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~ep34~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~ep41~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep42~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep43~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id1~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~r1~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st1~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~nl1~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~m1~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~max1~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode1~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~id2~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~r2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~nl2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~m2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~max2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~mode2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~r3~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~st3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~nl3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~m3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~max3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~mode3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~id4~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~r4~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~st4~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~nl4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~m4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~max4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~mode4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0; 2168#L393 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 2067#L404 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 2137#L414 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 1951#L425 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 2213#L435 assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; 1999#L446 init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 2122#L456 assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; 2031#L467 init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 2151#L477 assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; 2041#L488 init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 2042#L498 assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; 1981#L509 init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 2011#L519 assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; 2004#L530 init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); 2006#L540 assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; 2121#L551 init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); 2046#L561 assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; 2022#L572 init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); 2117#L582 assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; 1957#L593 init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); 2055#L603 assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; 1987#L614 init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); 2184#L624 assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; 1966#L635 init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); 1967#L645 assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; 1990#L656 init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); 2098#L666 assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; 1928#L677 init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); 1929#L687 assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; 1995#L698 init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); 1937#L708 assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; 1938#L719 init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); 2182#L729 assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; 1917#L740 init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); 2188#L750 assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; 2093#L761 init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); 2094#L771 assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; 2057#L782 init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); 2143#L792 assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; 1931#L803 init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); 1962#L813 assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; 2007#L824 init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); 2136#L834 assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; 1984#L845 init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); 1942#L855 assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; 1943#L866 init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); 2092#L876 assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; 1961#L887 init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); 2145#L897 assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; 1921#L897-1 init_#res#1 := init_~tmp___23~0#1; 2123#L1066 main_#t~ret56#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret56#1;havoc main_#t~ret56#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; 2105#L21 assume !(0 == assume_abort_if_not_~cond#1); 2106#L20 assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 2166#L1203-2 [2022-02-21 04:26:46,259 INFO L793 eck$LassoCheckResult]: Loop: 2166#L1203-2 assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1; 2291#L109 assume !(0 != ~mode1~0 % 256); 2290#L141 assume ~r1~0 < 3; 2110#L142 assume !(0 != ~ep12~0 % 256); 1941#L142-2 assume !(0 != ~ep13~0 % 256); 2043#L145-1 assume !(0 != ~ep14~0 % 256); 2044#L141-1 ~mode1~0 := 1; 2217#L109-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1; 2272#L162 assume !(0 != ~mode2~0 % 256); 2273#L194 assume !(~r2~0 < 3); 2259#L194-1 ~mode2~0 := 1; 2254#L162-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1; 2252#L215 assume !(0 != ~mode3~0 % 256); 2253#L247 assume !(~r3~0 < 3); 2241#L247-1 ~mode3~0 := 1; 2240#L215-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1; 2236#L268 assume !(0 != ~mode4~0 % 256); 2232#L300 assume !(~r4~0 < 3); 2225#L300-1 ~mode4~0 := 1; 2224#L268-2 assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 2223#L1074 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 2222#L1075 assume ~st1~0 + ~nl1~0 <= 1; 2221#L1076 assume ~st2~0 + ~nl2~0 <= 1; 2220#L1077 assume ~st3~0 + ~nl3~0 <= 1; 2219#L1078 assume ~st4~0 + ~nl4~0 <= 1; 2218#L1079 assume !(~r1~0 >= 3); 2060#L1082 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; 2061#L1083 assume ~r1~0 < 3; 2296#L1088 assume !(~r1~0 >= 3); 2173#L1092 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0; 2174#L1093 assume ~r1~0 < 3;check_~tmp~1#1 := 1; 2295#L1074-1 check_#res#1 := check_~tmp~1#1; 2294#L1126 main_#t~ret57#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret57#1;havoc main_#t~ret57#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; 2293#L1246 assume !(0 == assert_~arg#1 % 256); 2292#L1241 assume { :end_inline_assert } true;main_#t~post58#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post58#1;havoc main_#t~post58#1; 2166#L1203-2 [2022-02-21 04:26:46,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:26:46,259 INFO L85 PathProgramCache]: Analyzing trace with hash 2041231622, now seen corresponding path program 3 times [2022-02-21 04:26:46,259 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:26:46,260 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1785295337] [2022-02-21 04:26:46,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:26:46,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:26:46,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:26:46,304 INFO L290 TraceCheckUtils]: 0: Hoare triple {3064#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~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; {3064#true} is VALID [2022-02-21 04:26:46,304 INFO L290 TraceCheckUtils]: 1: Hoare triple {3064#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~nondet55#1, main_#t~ret56#1, main_#t~ret57#1, main_#t~post58#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~ep13~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~ep14~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~ep21~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~ep23~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~ep24~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~ep31~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~ep32~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~ep34~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~ep41~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep42~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep43~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id1~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~r1~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st1~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~nl1~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~m1~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~max1~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode1~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~id2~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~r2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~nl2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~m2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~max2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~mode2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~r3~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~st3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~nl3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~m3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~max3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~mode3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~id4~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~r4~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~st4~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~nl4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~m4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~max4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~mode4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0; {3064#true} is VALID [2022-02-21 04:26:46,304 INFO L290 TraceCheckUtils]: 2: Hoare triple {3064#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {3064#true} is VALID [2022-02-21 04:26:46,304 INFO L290 TraceCheckUtils]: 3: Hoare triple {3064#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {3064#true} is VALID [2022-02-21 04:26:46,305 INFO L290 TraceCheckUtils]: 4: Hoare triple {3064#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {3064#true} is VALID [2022-02-21 04:26:46,305 INFO L290 TraceCheckUtils]: 5: Hoare triple {3064#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {3064#true} is VALID [2022-02-21 04:26:46,305 INFO L290 TraceCheckUtils]: 6: Hoare triple {3064#true} assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; {3064#true} is VALID [2022-02-21 04:26:46,305 INFO L290 TraceCheckUtils]: 7: Hoare triple {3064#true} init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {3064#true} is VALID [2022-02-21 04:26:46,305 INFO L290 TraceCheckUtils]: 8: Hoare triple {3064#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; {3064#true} is VALID [2022-02-21 04:26:46,305 INFO L290 TraceCheckUtils]: 9: Hoare triple {3064#true} init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {3064#true} is VALID [2022-02-21 04:26:46,305 INFO L290 TraceCheckUtils]: 10: Hoare triple {3064#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; {3064#true} is VALID [2022-02-21 04:26:46,306 INFO L290 TraceCheckUtils]: 11: Hoare triple {3064#true} init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {3064#true} is VALID [2022-02-21 04:26:46,306 INFO L290 TraceCheckUtils]: 12: Hoare triple {3064#true} assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; {3064#true} is VALID [2022-02-21 04:26:46,306 INFO L290 TraceCheckUtils]: 13: Hoare triple {3064#true} init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {3064#true} is VALID [2022-02-21 04:26:46,306 INFO L290 TraceCheckUtils]: 14: Hoare triple {3064#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; {3064#true} is VALID [2022-02-21 04:26:46,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {3064#true} init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); {3064#true} is VALID [2022-02-21 04:26:46,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {3064#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; {3064#true} is VALID [2022-02-21 04:26:46,306 INFO L290 TraceCheckUtils]: 17: Hoare triple {3064#true} init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); {3064#true} is VALID [2022-02-21 04:26:46,307 INFO L290 TraceCheckUtils]: 18: Hoare triple {3064#true} assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; {3064#true} is VALID [2022-02-21 04:26:46,307 INFO L290 TraceCheckUtils]: 19: Hoare triple {3064#true} init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); {3064#true} is VALID [2022-02-21 04:26:46,307 INFO L290 TraceCheckUtils]: 20: Hoare triple {3064#true} assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; {3064#true} is VALID [2022-02-21 04:26:46,307 INFO L290 TraceCheckUtils]: 21: Hoare triple {3064#true} init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); {3064#true} is VALID [2022-02-21 04:26:46,307 INFO L290 TraceCheckUtils]: 22: Hoare triple {3064#true} assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; {3064#true} is VALID [2022-02-21 04:26:46,307 INFO L290 TraceCheckUtils]: 23: Hoare triple {3064#true} init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); {3064#true} is VALID [2022-02-21 04:26:46,307 INFO L290 TraceCheckUtils]: 24: Hoare triple {3064#true} assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; {3064#true} is VALID [2022-02-21 04:26:46,308 INFO L290 TraceCheckUtils]: 25: Hoare triple {3064#true} init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); {3064#true} is VALID [2022-02-21 04:26:46,308 INFO L290 TraceCheckUtils]: 26: Hoare triple {3064#true} assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; {3064#true} is VALID [2022-02-21 04:26:46,308 INFO L290 TraceCheckUtils]: 27: Hoare triple {3064#true} init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); {3064#true} is VALID [2022-02-21 04:26:46,308 INFO L290 TraceCheckUtils]: 28: Hoare triple {3064#true} assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; {3064#true} is VALID [2022-02-21 04:26:46,308 INFO L290 TraceCheckUtils]: 29: Hoare triple {3064#true} init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); {3064#true} is VALID [2022-02-21 04:26:46,308 INFO L290 TraceCheckUtils]: 30: Hoare triple {3064#true} assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; {3064#true} is VALID [2022-02-21 04:26:46,308 INFO L290 TraceCheckUtils]: 31: Hoare triple {3064#true} init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); {3064#true} is VALID [2022-02-21 04:26:46,309 INFO L290 TraceCheckUtils]: 32: Hoare triple {3064#true} assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; {3064#true} is VALID [2022-02-21 04:26:46,309 INFO L290 TraceCheckUtils]: 33: Hoare triple {3064#true} init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); {3064#true} is VALID [2022-02-21 04:26:46,309 INFO L290 TraceCheckUtils]: 34: Hoare triple {3064#true} assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; {3064#true} is VALID [2022-02-21 04:26:46,309 INFO L290 TraceCheckUtils]: 35: Hoare triple {3064#true} init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); {3064#true} is VALID [2022-02-21 04:26:46,309 INFO L290 TraceCheckUtils]: 36: Hoare triple {3064#true} assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; {3064#true} is VALID [2022-02-21 04:26:46,309 INFO L290 TraceCheckUtils]: 37: Hoare triple {3064#true} init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); {3064#true} is VALID [2022-02-21 04:26:46,310 INFO L290 TraceCheckUtils]: 38: Hoare triple {3064#true} assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; {3064#true} is VALID [2022-02-21 04:26:46,310 INFO L290 TraceCheckUtils]: 39: Hoare triple {3064#true} init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); {3064#true} is VALID [2022-02-21 04:26:46,310 INFO L290 TraceCheckUtils]: 40: Hoare triple {3064#true} assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; {3064#true} is VALID [2022-02-21 04:26:46,310 INFO L290 TraceCheckUtils]: 41: Hoare triple {3064#true} init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); {3064#true} is VALID [2022-02-21 04:26:46,310 INFO L290 TraceCheckUtils]: 42: Hoare triple {3064#true} assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; {3064#true} is VALID [2022-02-21 04:26:46,310 INFO L290 TraceCheckUtils]: 43: Hoare triple {3064#true} init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); {3064#true} is VALID [2022-02-21 04:26:46,311 INFO L290 TraceCheckUtils]: 44: Hoare triple {3064#true} assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; {3064#true} is VALID [2022-02-21 04:26:46,311 INFO L290 TraceCheckUtils]: 45: Hoare triple {3064#true} init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); {3064#true} is VALID [2022-02-21 04:26:46,311 INFO L290 TraceCheckUtils]: 46: Hoare triple {3064#true} assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; {3064#true} is VALID [2022-02-21 04:26:46,311 INFO L290 TraceCheckUtils]: 47: Hoare triple {3064#true} init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); {3064#true} is VALID [2022-02-21 04:26:46,311 INFO L290 TraceCheckUtils]: 48: Hoare triple {3064#true} assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; {3064#true} is VALID [2022-02-21 04:26:46,311 INFO L290 TraceCheckUtils]: 49: Hoare triple {3064#true} init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); {3064#true} is VALID [2022-02-21 04:26:46,312 INFO L290 TraceCheckUtils]: 50: Hoare triple {3064#true} assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; {3066#(= |ULTIMATE.start_init_~tmp___23~0#1| 0)} is VALID [2022-02-21 04:26:46,312 INFO L290 TraceCheckUtils]: 51: Hoare triple {3066#(= |ULTIMATE.start_init_~tmp___23~0#1| 0)} init_#res#1 := init_~tmp___23~0#1; {3067#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:26:46,313 INFO L290 TraceCheckUtils]: 52: Hoare triple {3067#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret56#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret56#1;havoc main_#t~ret56#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; {3068#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:26:46,313 INFO L290 TraceCheckUtils]: 53: Hoare triple {3068#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {3065#false} is VALID [2022-02-21 04:26:46,330 INFO L290 TraceCheckUtils]: 54: Hoare triple {3065#false} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {3065#false} is VALID [2022-02-21 04:26:46,330 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:26:46,331 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:26:46,331 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1785295337] [2022-02-21 04:26:46,331 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1785295337] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:26:46,331 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:26:46,331 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:26:46,331 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1882189760] [2022-02-21 04:26:46,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:26:46,332 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:26:46,332 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:26:46,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1683797340, now seen corresponding path program 1 times [2022-02-21 04:26:46,332 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:26:46,333 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1066039003] [2022-02-21 04:26:46,333 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:26:46,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:26:46,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:26:46,344 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:26:46,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:26:46,369 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:26:47,137 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:26:47,137 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:26:47,137 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:26:47,138 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:26:47,138 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:26:47,138 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:47,138 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:26:47,138 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:26:47,138 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.4.2.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2022-02-21 04:26:47,138 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:26:47,138 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:26:47,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:26:47,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:26:47,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:26:47,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:47,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:47,166 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:47,168 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:47,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:26:47,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:47,175 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:47,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:47,178 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:47,182 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:47,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:26:47,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:47,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:47,190 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:47,192 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:47,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:47,204 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:47,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:47,208 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:47,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:47,242 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:47,243 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:47,247 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:47,249 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:47,252 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:47,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:47,256 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:47,947 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:26:47,947 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:26:47,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:47,949 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:47,968 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:26:47,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 04:26:47,971 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:26:47,971 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:26:48,021 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:26:48,022 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:48,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:48,023 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:26:48,044 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:26:48,044 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:26:48,065 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:26:48,176 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:26:48,180 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-02-21 04:26:48,180 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:26:48,180 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:26:48,180 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:26:48,180 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:26:48,181 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:26:48,181 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:48,181 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:26:48,181 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:26:48,181 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.4.2.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2022-02-21 04:26:48,181 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:26:48,181 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:26:48,184 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:48,194 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:48,196 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:48,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:48,200 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:48,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:48,205 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:48,207 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:48,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:48,220 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:48,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:48,255 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:48,259 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:48,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:26:48,264 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:48,265 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:48,267 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:48,269 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:48,270 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:48,274 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:48,282 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:48,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:26:48,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:26:48,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:26:48,293 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:48,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:26:48,298 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:48,300 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:26:48,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:26:48,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:26:49,009 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:26:49,011 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:26:49,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:49,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:49,032 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:26:49,033 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:26:49,034 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:26:49,040 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:49,041 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:49,041 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:49,041 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:49,041 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:49,043 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:49,043 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:49,059 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:26:49,095 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:26:49,096 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:49,096 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:49,097 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:26:49,112 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:26:49,112 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:26:49,118 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:49,118 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:49,118 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:49,118 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:49,119 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:49,119 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:49,119 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:49,131 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:26:49,161 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:26:49,162 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:49,162 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:49,184 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:26:49,188 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:26:49,193 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:49,194 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:49,194 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:49,194 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:49,194 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:49,194 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:49,194 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:49,197 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:26:49,211 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:26:49,243 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:26:49,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:49,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:49,260 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:26:49,284 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:26:49,285 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:26:49,291 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:49,291 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:49,291 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:49,291 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:49,291 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:49,292 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:49,292 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:49,294 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:26:49,311 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:26:49,311 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:49,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:49,313 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:26:49,314 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:26:49,315 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:26:49,321 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:49,321 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:49,321 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:49,321 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:49,321 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:49,321 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:49,321 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:49,347 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:26:49,362 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:26:49,363 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:49,363 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:49,364 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:26:49,364 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:26:49,365 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:26:49,371 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:49,371 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:49,372 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:49,372 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:49,372 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:49,375 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:49,375 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:49,376 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:26:49,392 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:26:49,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:49,392 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:49,393 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:26:49,394 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:26:49,395 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:26:49,401 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:49,401 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:49,401 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:49,401 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:49,401 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:49,401 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:49,402 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:49,407 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:26:49,422 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:26:49,422 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:49,422 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:49,423 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:26:49,424 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:26:49,425 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:26:49,431 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:49,431 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:49,431 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:49,431 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:49,432 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:49,432 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:49,432 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:49,442 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:26:49,457 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:26:49,458 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:49,458 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:49,459 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:26:49,460 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:26:49,461 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:26:49,467 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:49,468 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:49,468 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:49,468 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:49,468 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:49,468 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:49,468 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:49,469 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:26:49,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-02-21 04:26:49,486 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:49,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:49,487 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:26:49,488 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:26:49,490 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:26:49,496 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:49,497 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:49,497 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:49,497 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:49,497 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:49,498 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:49,498 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:49,503 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:26:49,518 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:26:49,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:49,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:49,519 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:26:49,521 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:26:49,521 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:26:49,528 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:49,528 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:49,528 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:49,528 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:49,528 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:49,548 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:49,549 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:49,567 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:26:49,582 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Ended with exit code 0 [2022-02-21 04:26:49,583 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:49,583 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:49,584 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:26:49,585 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:26:49,591 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:26:49,597 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:49,597 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:49,597 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:49,597 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:49,597 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:49,598 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:49,598 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:49,600 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:26:49,614 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Ended with exit code 0 [2022-02-21 04:26:49,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:49,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:49,616 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:26:49,617 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:26:49,618 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:26:49,624 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:49,624 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:49,624 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:49,624 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:49,624 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:49,624 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:49,624 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:49,639 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:26:49,656 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:26:49,656 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:49,656 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:49,657 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:26:49,658 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:26:49,659 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:26:49,664 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:49,664 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:49,664 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:49,664 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:49,664 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:49,664 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:49,665 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:49,680 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:26:49,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 04:26:49,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:49,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:49,696 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:26:49,697 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:26:49,698 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:26:49,703 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:49,703 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:49,704 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:49,704 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:49,704 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:49,704 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:49,704 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:49,723 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:26:49,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 04:26:49,738 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:49,738 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:49,739 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:26:49,747 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:26:49,754 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:49,754 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:49,754 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:49,754 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:49,754 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:49,754 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:49,755 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:49,758 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:26:49,766 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:26:49,783 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2022-02-21 04:26:49,784 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:49,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:49,786 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:26:49,793 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:26:49,798 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:49,798 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:49,798 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:49,798 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:49,798 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:49,799 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:49,799 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:49,802 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:26:49,811 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:26:49,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 04:26:49,826 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:49,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:49,827 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:26:49,828 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:26:49,829 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:26:49,834 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:49,834 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:49,834 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:49,834 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:49,834 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:49,835 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:49,835 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:49,843 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:26:49,858 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 04:26:49,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:49,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:49,859 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:26:49,860 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:26:49,861 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:26:49,866 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:26:49,866 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:26:49,866 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:26:49,867 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:26:49,867 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:26:49,867 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:26:49,867 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:26:49,882 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:26:49,885 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:26:49,885 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:26:49,886 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:26:49,886 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:26:49,888 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:26:49,888 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:26:49,889 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:26:49,889 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:26:49,889 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:26:49,889 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 15 Supporting invariants [] [2022-02-21 04:26:49,904 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:26:49,916 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:26:49,920 INFO L390 LassoCheck]: Loop: "assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1;" "assume !(0 != ~mode1~0 % 256);" "assume ~r1~0 < 3;" "assume !(0 != ~ep12~0 % 256);" "assume !(0 != ~ep13~0 % 256);" "assume !(0 != ~ep14~0 % 256);" "~mode1~0 := 1;" "assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1;" "assume !(0 != ~mode2~0 % 256);" "assume !(~r2~0 < 3);" "~mode2~0 := 1;" "assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1;" "assume !(0 != ~mode3~0 % 256);" "assume !(~r3~0 < 3);" "~mode3~0 := 1;" "assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1;" "assume !(0 != ~mode4~0 % 256);" "assume !(~r4~0 < 3);" "~mode4~0 := 1;" "assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1;" "assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1;" "assume ~st1~0 + ~nl1~0 <= 1;" "assume ~st2~0 + ~nl2~0 <= 1;" "assume ~st3~0 + ~nl3~0 <= 1;" "assume ~st4~0 + ~nl4~0 <= 1;" "assume !(~r1~0 >= 3);" "assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0;" "assume ~r1~0 < 3;" "assume !(~r1~0 >= 3);" "assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0;" "assume ~r1~0 < 3;check_~tmp~1#1 := 1;" "check_#res#1 := check_~tmp~1#1;" "main_#t~ret57#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret57#1;havoc main_#t~ret57#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~post58#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post58#1;havoc main_#t~post58#1;" [2022-02-21 04:26:49,941 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:26:49,972 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:26:49,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:26:50,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:26:50,061 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:26:50,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:26:50,111 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:26:50,193 INFO L290 TraceCheckUtils]: 0: Hoare triple {3071#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(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~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; {3071#unseeded} is VALID [2022-02-21 04:26:50,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {3071#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~nondet55#1, main_#t~ret56#1, main_#t~ret57#1, main_#t~post58#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~ep13~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~ep14~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~ep21~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~ep23~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~ep24~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~ep31~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~ep32~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~ep34~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~ep41~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep42~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep43~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id1~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~r1~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st1~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~nl1~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~m1~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~max1~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode1~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~id2~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~r2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~nl2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~m2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~max2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~mode2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~r3~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~st3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~nl3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~m3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~max3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~mode3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~id4~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~r4~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~st4~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~nl4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~m4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~max4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~mode4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0; {3071#unseeded} is VALID [2022-02-21 04:26:50,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {3071#unseeded} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {3071#unseeded} is VALID [2022-02-21 04:26:50,195 INFO L290 TraceCheckUtils]: 3: Hoare triple {3071#unseeded} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {3071#unseeded} is VALID [2022-02-21 04:26:50,195 INFO L290 TraceCheckUtils]: 4: Hoare triple {3071#unseeded} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {3071#unseeded} is VALID [2022-02-21 04:26:50,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {3071#unseeded} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {3071#unseeded} is VALID [2022-02-21 04:26:50,196 INFO L290 TraceCheckUtils]: 6: Hoare triple {3071#unseeded} assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; {3071#unseeded} is VALID [2022-02-21 04:26:50,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {3071#unseeded} init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {3071#unseeded} is VALID [2022-02-21 04:26:50,196 INFO L290 TraceCheckUtils]: 8: Hoare triple {3071#unseeded} assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; {3071#unseeded} is VALID [2022-02-21 04:26:50,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {3071#unseeded} init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {3071#unseeded} is VALID [2022-02-21 04:26:50,197 INFO L290 TraceCheckUtils]: 10: Hoare triple {3071#unseeded} assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; {3071#unseeded} is VALID [2022-02-21 04:26:50,197 INFO L290 TraceCheckUtils]: 11: Hoare triple {3071#unseeded} init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {3071#unseeded} is VALID [2022-02-21 04:26:50,198 INFO L290 TraceCheckUtils]: 12: Hoare triple {3071#unseeded} assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; {3071#unseeded} is VALID [2022-02-21 04:26:50,198 INFO L290 TraceCheckUtils]: 13: Hoare triple {3071#unseeded} init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {3071#unseeded} is VALID [2022-02-21 04:26:50,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {3071#unseeded} assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; {3071#unseeded} is VALID [2022-02-21 04:26:50,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {3071#unseeded} init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); {3071#unseeded} is VALID [2022-02-21 04:26:50,199 INFO L290 TraceCheckUtils]: 16: Hoare triple {3071#unseeded} assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; {3071#unseeded} is VALID [2022-02-21 04:26:50,199 INFO L290 TraceCheckUtils]: 17: Hoare triple {3071#unseeded} init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); {3071#unseeded} is VALID [2022-02-21 04:26:50,199 INFO L290 TraceCheckUtils]: 18: Hoare triple {3071#unseeded} assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; {3071#unseeded} is VALID [2022-02-21 04:26:50,200 INFO L290 TraceCheckUtils]: 19: Hoare triple {3071#unseeded} init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); {3071#unseeded} is VALID [2022-02-21 04:26:50,200 INFO L290 TraceCheckUtils]: 20: Hoare triple {3071#unseeded} assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; {3071#unseeded} is VALID [2022-02-21 04:26:50,200 INFO L290 TraceCheckUtils]: 21: Hoare triple {3071#unseeded} init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); {3071#unseeded} is VALID [2022-02-21 04:26:50,201 INFO L290 TraceCheckUtils]: 22: Hoare triple {3071#unseeded} assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; {3071#unseeded} is VALID [2022-02-21 04:26:50,201 INFO L290 TraceCheckUtils]: 23: Hoare triple {3071#unseeded} init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); {3071#unseeded} is VALID [2022-02-21 04:26:50,206 INFO L290 TraceCheckUtils]: 24: Hoare triple {3071#unseeded} assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; {3071#unseeded} is VALID [2022-02-21 04:26:50,206 INFO L290 TraceCheckUtils]: 25: Hoare triple {3071#unseeded} init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); {3071#unseeded} is VALID [2022-02-21 04:26:50,206 INFO L290 TraceCheckUtils]: 26: Hoare triple {3071#unseeded} assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; {3071#unseeded} is VALID [2022-02-21 04:26:50,207 INFO L290 TraceCheckUtils]: 27: Hoare triple {3071#unseeded} init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); {3071#unseeded} is VALID [2022-02-21 04:26:50,207 INFO L290 TraceCheckUtils]: 28: Hoare triple {3071#unseeded} assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; {3071#unseeded} is VALID [2022-02-21 04:26:50,207 INFO L290 TraceCheckUtils]: 29: Hoare triple {3071#unseeded} init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); {3071#unseeded} is VALID [2022-02-21 04:26:50,208 INFO L290 TraceCheckUtils]: 30: Hoare triple {3071#unseeded} assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; {3071#unseeded} is VALID [2022-02-21 04:26:50,208 INFO L290 TraceCheckUtils]: 31: Hoare triple {3071#unseeded} init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); {3071#unseeded} is VALID [2022-02-21 04:26:50,208 INFO L290 TraceCheckUtils]: 32: Hoare triple {3071#unseeded} assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; {3071#unseeded} is VALID [2022-02-21 04:26:50,209 INFO L290 TraceCheckUtils]: 33: Hoare triple {3071#unseeded} init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); {3071#unseeded} is VALID [2022-02-21 04:26:50,209 INFO L290 TraceCheckUtils]: 34: Hoare triple {3071#unseeded} assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; {3071#unseeded} is VALID [2022-02-21 04:26:50,209 INFO L290 TraceCheckUtils]: 35: Hoare triple {3071#unseeded} init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); {3071#unseeded} is VALID [2022-02-21 04:26:50,210 INFO L290 TraceCheckUtils]: 36: Hoare triple {3071#unseeded} assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; {3071#unseeded} is VALID [2022-02-21 04:26:50,210 INFO L290 TraceCheckUtils]: 37: Hoare triple {3071#unseeded} init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); {3071#unseeded} is VALID [2022-02-21 04:26:50,210 INFO L290 TraceCheckUtils]: 38: Hoare triple {3071#unseeded} assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; {3071#unseeded} is VALID [2022-02-21 04:26:50,210 INFO L290 TraceCheckUtils]: 39: Hoare triple {3071#unseeded} init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); {3071#unseeded} is VALID [2022-02-21 04:26:50,211 INFO L290 TraceCheckUtils]: 40: Hoare triple {3071#unseeded} assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; {3071#unseeded} is VALID [2022-02-21 04:26:50,211 INFO L290 TraceCheckUtils]: 41: Hoare triple {3071#unseeded} init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); {3071#unseeded} is VALID [2022-02-21 04:26:50,211 INFO L290 TraceCheckUtils]: 42: Hoare triple {3071#unseeded} assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; {3071#unseeded} is VALID [2022-02-21 04:26:50,212 INFO L290 TraceCheckUtils]: 43: Hoare triple {3071#unseeded} init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); {3071#unseeded} is VALID [2022-02-21 04:26:50,212 INFO L290 TraceCheckUtils]: 44: Hoare triple {3071#unseeded} assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; {3071#unseeded} is VALID [2022-02-21 04:26:50,212 INFO L290 TraceCheckUtils]: 45: Hoare triple {3071#unseeded} init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); {3071#unseeded} is VALID [2022-02-21 04:26:50,213 INFO L290 TraceCheckUtils]: 46: Hoare triple {3071#unseeded} assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; {3071#unseeded} is VALID [2022-02-21 04:26:50,213 INFO L290 TraceCheckUtils]: 47: Hoare triple {3071#unseeded} init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); {3071#unseeded} is VALID [2022-02-21 04:26:50,213 INFO L290 TraceCheckUtils]: 48: Hoare triple {3071#unseeded} assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; {3071#unseeded} is VALID [2022-02-21 04:26:50,214 INFO L290 TraceCheckUtils]: 49: Hoare triple {3071#unseeded} init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); {3071#unseeded} is VALID [2022-02-21 04:26:50,214 INFO L290 TraceCheckUtils]: 50: Hoare triple {3071#unseeded} assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; {3071#unseeded} is VALID [2022-02-21 04:26:50,214 INFO L290 TraceCheckUtils]: 51: Hoare triple {3071#unseeded} init_#res#1 := init_~tmp___23~0#1; {3071#unseeded} is VALID [2022-02-21 04:26:50,214 INFO L290 TraceCheckUtils]: 52: Hoare triple {3071#unseeded} main_#t~ret56#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret56#1;havoc main_#t~ret56#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; {3071#unseeded} is VALID [2022-02-21 04:26:50,215 INFO L290 TraceCheckUtils]: 53: Hoare triple {3071#unseeded} assume !(0 == assume_abort_if_not_~cond#1); {3071#unseeded} is VALID [2022-02-21 04:26:50,215 INFO L290 TraceCheckUtils]: 54: Hoare triple {3071#unseeded} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {3071#unseeded} is VALID [2022-02-21 04:26:50,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:26:50,240 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:26:50,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:26:50,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:26:50,502 INFO L290 TraceCheckUtils]: 0: Hoare triple {3074#(>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|)))} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1; {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:50,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 != ~mode1~0 % 256); {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:50,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~r1~0 < 3; {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:50,503 INFO L290 TraceCheckUtils]: 3: Hoare triple {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 != ~ep12~0 % 256); {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:50,504 INFO L290 TraceCheckUtils]: 4: Hoare triple {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 != ~ep13~0 % 256); {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:50,504 INFO L290 TraceCheckUtils]: 5: Hoare triple {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 != ~ep14~0 % 256); {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:50,504 INFO L290 TraceCheckUtils]: 6: Hoare triple {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} ~mode1~0 := 1; {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:50,505 INFO L290 TraceCheckUtils]: 7: Hoare triple {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1; {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:50,505 INFO L290 TraceCheckUtils]: 8: Hoare triple {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 != ~mode2~0 % 256); {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:50,505 INFO L290 TraceCheckUtils]: 9: Hoare triple {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(~r2~0 < 3); {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:50,506 INFO L290 TraceCheckUtils]: 10: Hoare triple {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} ~mode2~0 := 1; {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:50,507 INFO L290 TraceCheckUtils]: 11: Hoare triple {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1; {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:50,507 INFO L290 TraceCheckUtils]: 12: Hoare triple {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 != ~mode3~0 % 256); {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:50,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(~r3~0 < 3); {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:50,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} ~mode3~0 := 1; {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:50,508 INFO L290 TraceCheckUtils]: 15: Hoare triple {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1; {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:50,509 INFO L290 TraceCheckUtils]: 16: Hoare triple {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 != ~mode4~0 % 256); {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:50,509 INFO L290 TraceCheckUtils]: 17: Hoare triple {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(~r4~0 < 3); {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:50,509 INFO L290 TraceCheckUtils]: 18: Hoare triple {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} ~mode4~0 := 1; {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:50,510 INFO L290 TraceCheckUtils]: 19: Hoare triple {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:50,510 INFO L290 TraceCheckUtils]: 20: Hoare triple {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:50,511 INFO L290 TraceCheckUtils]: 21: Hoare triple {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~st1~0 + ~nl1~0 <= 1; {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:50,511 INFO L290 TraceCheckUtils]: 22: Hoare triple {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~st2~0 + ~nl2~0 <= 1; {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:50,511 INFO L290 TraceCheckUtils]: 23: Hoare triple {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~st3~0 + ~nl3~0 <= 1; {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:50,512 INFO L290 TraceCheckUtils]: 24: Hoare triple {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~st4~0 + ~nl4~0 <= 1; {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:50,512 INFO L290 TraceCheckUtils]: 25: Hoare triple {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(~r1~0 >= 3); {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:50,512 INFO L290 TraceCheckUtils]: 26: Hoare triple {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:50,513 INFO L290 TraceCheckUtils]: 27: Hoare triple {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~r1~0 < 3; {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:50,513 INFO L290 TraceCheckUtils]: 28: Hoare triple {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(~r1~0 >= 3); {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:50,513 INFO L290 TraceCheckUtils]: 29: Hoare triple {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0; {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:50,514 INFO L290 TraceCheckUtils]: 30: Hoare triple {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:50,514 INFO L290 TraceCheckUtils]: 31: Hoare triple {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} check_#res#1 := check_~tmp~1#1; {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:50,517 INFO L290 TraceCheckUtils]: 32: Hoare triple {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} main_#t~ret57#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret57#1;havoc main_#t~ret57#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; {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:50,518 INFO L290 TraceCheckUtils]: 33: Hoare triple {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 == assert_~arg#1 % 256); {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:26:50,519 INFO L290 TraceCheckUtils]: 34: Hoare triple {3251#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume { :end_inline_assert } true;main_#t~post58#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post58#1;havoc main_#t~post58#1; {3084#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|)))))} is VALID [2022-02-21 04:26:50,520 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:26:50,521 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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:26:50,540 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 90 edges. 90 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:26:50,540 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 35 letters. [2022-02-21 04:26:50,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:50,543 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:26:50,544 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 382 states and 661 transitions. cyclomatic complexity: 280 Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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:26:50,964 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 382 states and 661 transitions. cyclomatic complexity: 280. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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 571 states and 968 transitions. Complement of second has 4 states. [2022-02-21 04:26:50,964 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:26:50,964 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:26:50,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 382 states and 661 transitions. cyclomatic complexity: 280 [2022-02-21 04:26:50,964 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:26:50,964 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:26:50,964 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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:26:50,971 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:26:50,971 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:26:50,971 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:26:50,971 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 571 states and 968 transitions. [2022-02-21 04:26:50,974 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:26:50,974 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:26:50,976 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 382 states and 661 transitions. cyclomatic complexity: 280 [2022-02-21 04:26:51,076 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 190 examples of accepted words. [2022-02-21 04:26:51,076 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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:26:51,080 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:26:51,080 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:26:51,080 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 571 states and 968 transitions. cyclomatic complexity: 398 [2022-02-21 04:26:51,080 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 571 states and 968 transitions. cyclomatic complexity: 398 [2022-02-21 04:26:51,080 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:26:51,081 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:26:51,081 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 55 letters. Loop has 35 letters. [2022-02-21 04:26:51,082 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,082 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 35 letters. [2022-02-21 04:26:51,083 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 55 letters. Loop has 35 letters. [2022-02-21 04:26:51,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:26:51,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:26:51,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:26:51,084 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,084 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 571 letters. Loop has 571 letters. [2022-02-21 04:26:51,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 571 letters. Loop has 571 letters. [2022-02-21 04:26:51,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 571 letters. Loop has 571 letters. [2022-02-21 04:26:51,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 382 letters. Loop has 382 letters. [2022-02-21 04:26:51,085 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,085 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 382 letters. Loop has 382 letters. [2022-02-21 04:26:51,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 382 letters. Loop has 382 letters. [2022-02-21 04:26:51,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:26:51,086 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,086 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:26:51,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:26:51,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:26:51,087 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,087 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:26:51,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:26:51,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,088 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 63 letters. Loop has 35 letters. [2022-02-21 04:26:51,088 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 35 letters. [2022-02-21 04:26:51,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 63 letters. Loop has 35 letters. [2022-02-21 04:26:51,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 64 letters. Loop has 37 letters. [2022-02-21 04:26:51,089 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,089 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 37 letters. [2022-02-21 04:26:51,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 64 letters. Loop has 37 letters. [2022-02-21 04:26:51,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 64 letters. Loop has 35 letters. [2022-02-21 04:26:51,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 35 letters. [2022-02-21 04:26:51,090 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,090 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 64 letters. Loop has 35 letters. [2022-02-21 04:26:51,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 81 letters. Loop has 35 letters. [2022-02-21 04:26:51,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 81 letters. Loop has 35 letters. [2022-02-21 04:26:51,091 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,091 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 81 letters. Loop has 35 letters. [2022-02-21 04:26:51,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 82 letters. Loop has 35 letters. [2022-02-21 04:26:51,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 82 letters. Loop has 35 letters. [2022-02-21 04:26:51,092 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,092 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 82 letters. Loop has 35 letters. [2022-02-21 04:26:51,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 35 letters. [2022-02-21 04:26:51,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 35 letters. [2022-02-21 04:26:51,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 35 letters. [2022-02-21 04:26:51,093 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,093 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 36 letters. [2022-02-21 04:26:51,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 36 letters. [2022-02-21 04:26:51,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 36 letters. [2022-02-21 04:26:51,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 61 letters. Loop has 35 letters. [2022-02-21 04:26:51,094 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,094 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 35 letters. [2022-02-21 04:26:51,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 61 letters. Loop has 35 letters. [2022-02-21 04:26:51,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:26:51,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,095 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:26:51,095 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:26:51,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 62 letters. Loop has 36 letters. [2022-02-21 04:26:51,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 36 letters. [2022-02-21 04:26:51,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,096 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 62 letters. Loop has 36 letters. [2022-02-21 04:26:51,096 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 60 letters. Loop has 37 letters. [2022-02-21 04:26:51,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 37 letters. [2022-02-21 04:26:51,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 60 letters. Loop has 37 letters. [2022-02-21 04:26:51,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 61 letters. Loop has 37 letters. [2022-02-21 04:26:51,097 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,097 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 37 letters. [2022-02-21 04:26:51,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 61 letters. Loop has 37 letters. [2022-02-21 04:26:51,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:26:51,098 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,098 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:26:51,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:26:51,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 37 letters. [2022-02-21 04:26:51,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 37 letters. [2022-02-21 04:26:51,099 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,099 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 37 letters. [2022-02-21 04:26:51,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 65 letters. Loop has 37 letters. [2022-02-21 04:26:51,100 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,100 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 37 letters. [2022-02-21 04:26:51,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 65 letters. Loop has 37 letters. [2022-02-21 04:26:51,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 62 letters. Loop has 37 letters. [2022-02-21 04:26:51,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 37 letters. [2022-02-21 04:26:51,101 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,101 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 62 letters. Loop has 37 letters. [2022-02-21 04:26:51,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 64 letters. Loop has 36 letters. [2022-02-21 04:26:51,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 36 letters. [2022-02-21 04:26:51,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 64 letters. Loop has 36 letters. [2022-02-21 04:26:51,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,102 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 88 letters. Loop has 32 letters. [2022-02-21 04:26:51,102 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 88 letters. Loop has 32 letters. [2022-02-21 04:26:51,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 88 letters. Loop has 32 letters. [2022-02-21 04:26:51,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 36 letters. [2022-02-21 04:26:51,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,103 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 36 letters. [2022-02-21 04:26:51,103 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 36 letters. [2022-02-21 04:26:51,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:26:51,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:26:51,104 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,104 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:26:51,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 63 letters. Loop has 35 letters. [2022-02-21 04:26:51,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 35 letters. [2022-02-21 04:26:51,105 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,105 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 63 letters. Loop has 35 letters. [2022-02-21 04:26:51,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 63 letters. Loop has 36 letters. [2022-02-21 04:26:51,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 36 letters. [2022-02-21 04:26:51,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 63 letters. Loop has 36 letters. [2022-02-21 04:26:51,106 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,106 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 73 letters. Loop has 37 letters. [2022-02-21 04:26:51,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 37 letters. [2022-02-21 04:26:51,107 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,107 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 73 letters. Loop has 37 letters. [2022-02-21 04:26:51,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,108 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 58 letters. Loop has 35 letters. [2022-02-21 04:26:51,108 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 35 letters. [2022-02-21 04:26:51,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 58 letters. Loop has 35 letters. [2022-02-21 04:26:51,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,109 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 59 letters. Loop has 37 letters. [2022-02-21 04:26:51,109 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 37 letters. [2022-02-21 04:26:51,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 59 letters. Loop has 37 letters. [2022-02-21 04:26:51,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 66 letters. Loop has 37 letters. [2022-02-21 04:26:51,110 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,110 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 37 letters. [2022-02-21 04:26:51,111 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,111 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 66 letters. Loop has 37 letters. [2022-02-21 04:26:51,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,112 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:26:51,112 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,113 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:26:51,115 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,115 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:26:51,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,118 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 65 letters. Loop has 32 letters. [2022-02-21 04:26:51,118 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 32 letters. [2022-02-21 04:26:51,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 65 letters. Loop has 32 letters. [2022-02-21 04:26:51,119 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,119 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:26:51,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:26:51,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:26:51,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,120 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 57 letters. Loop has 35 letters. [2022-02-21 04:26:51,120 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 35 letters. [2022-02-21 04:26:51,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 57 letters. Loop has 35 letters. [2022-02-21 04:26:51,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 73 letters. Loop has 32 letters. [2022-02-21 04:26:51,121 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,121 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 32 letters. [2022-02-21 04:26:51,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 73 letters. Loop has 32 letters. [2022-02-21 04:26:51,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 74 letters. Loop has 32 letters. [2022-02-21 04:26:51,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,122 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 32 letters. [2022-02-21 04:26:51,122 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 74 letters. Loop has 32 letters. [2022-02-21 04:26:51,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,123 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 37 letters. [2022-02-21 04:26:51,123 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 37 letters. [2022-02-21 04:26:51,124 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,124 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 37 letters. [2022-02-21 04:26:51,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:26:51,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:26:51,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,125 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:26:51,125 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:26:51,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:26:51,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:26:51,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,126 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 36 letters. [2022-02-21 04:26:51,126 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 36 letters. [2022-02-21 04:26:51,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 36 letters. [2022-02-21 04:26:51,127 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,127 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 75 letters. Loop has 32 letters. [2022-02-21 04:26:51,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 75 letters. Loop has 32 letters. [2022-02-21 04:26:51,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 75 letters. Loop has 32 letters. [2022-02-21 04:26:51,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 79 letters. Loop has 32 letters. [2022-02-21 04:26:51,128 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,128 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 79 letters. Loop has 32 letters. [2022-02-21 04:26:51,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 79 letters. Loop has 32 letters. [2022-02-21 04:26:51,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 80 letters. Loop has 32 letters. [2022-02-21 04:26:51,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 80 letters. Loop has 32 letters. [2022-02-21 04:26:51,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,129 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 80 letters. Loop has 32 letters. [2022-02-21 04:26:51,129 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 82 letters. Loop has 32 letters. [2022-02-21 04:26:51,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 82 letters. Loop has 32 letters. [2022-02-21 04:26:51,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 82 letters. Loop has 32 letters. [2022-02-21 04:26:51,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 83 letters. Loop has 32 letters. [2022-02-21 04:26:51,130 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,130 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 83 letters. Loop has 32 letters. [2022-02-21 04:26:51,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 83 letters. Loop has 32 letters. [2022-02-21 04:26:51,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 55 letters. Loop has 35 letters. [2022-02-21 04:26:51,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 35 letters. [2022-02-21 04:26:51,131 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,131 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 55 letters. Loop has 35 letters. [2022-02-21 04:26:51,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 32 letters. [2022-02-21 04:26:51,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 32 letters. [2022-02-21 04:26:51,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 32 letters. [2022-02-21 04:26:51,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 32 letters. [2022-02-21 04:26:51,132 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,132 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 32 letters. [2022-02-21 04:26:51,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 32 letters. [2022-02-21 04:26:51,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 84 letters. Loop has 35 letters. [2022-02-21 04:26:51,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 84 letters. Loop has 35 letters. [2022-02-21 04:26:51,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 84 letters. Loop has 35 letters. [2022-02-21 04:26:51,133 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,133 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 85 letters. Loop has 35 letters. [2022-02-21 04:26:51,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 85 letters. Loop has 35 letters. [2022-02-21 04:26:51,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 85 letters. Loop has 35 letters. [2022-02-21 04:26:51,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 37 letters. [2022-02-21 04:26:51,134 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,134 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 37 letters. [2022-02-21 04:26:51,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 37 letters. [2022-02-21 04:26:51,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 37 letters. [2022-02-21 04:26:51,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 37 letters. [2022-02-21 04:26:51,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,135 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 37 letters. [2022-02-21 04:26:51,135 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:26:51,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:26:51,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:26:51,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 84 letters. Loop has 32 letters. [2022-02-21 04:26:51,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,136 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 84 letters. Loop has 32 letters. [2022-02-21 04:26:51,136 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 84 letters. Loop has 32 letters. [2022-02-21 04:26:51,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:26:51,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:26:51,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:26:51,137 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,137 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 61 letters. Loop has 32 letters. [2022-02-21 04:26:51,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 32 letters. [2022-02-21 04:26:51,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 61 letters. Loop has 32 letters. [2022-02-21 04:26:51,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 37 letters. [2022-02-21 04:26:51,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 37 letters. [2022-02-21 04:26:51,138 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,138 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 37 letters. [2022-02-21 04:26:51,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:26:51,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:26:51,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:26:51,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,139 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:26:51,139 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:26:51,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:26:51,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 35 letters. [2022-02-21 04:26:51,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 35 letters. [2022-02-21 04:26:51,140 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,140 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 35 letters. [2022-02-21 04:26:51,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 65 letters. Loop has 37 letters. [2022-02-21 04:26:51,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 37 letters. [2022-02-21 04:26:51,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 65 letters. Loop has 37 letters. [2022-02-21 04:26:51,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:26:51,141 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,141 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:26:51,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:26:51,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 70 letters. Loop has 36 letters. [2022-02-21 04:26:51,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 36 letters. [2022-02-21 04:26:51,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,142 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 70 letters. Loop has 36 letters. [2022-02-21 04:26:51,142 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 37 letters. [2022-02-21 04:26:51,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 37 letters. [2022-02-21 04:26:51,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 37 letters. [2022-02-21 04:26:51,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 77 letters. Loop has 32 letters. [2022-02-21 04:26:51,143 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,143 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 77 letters. Loop has 32 letters. [2022-02-21 04:26:51,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 77 letters. Loop has 32 letters. [2022-02-21 04:26:51,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 60 letters. Loop has 36 letters. [2022-02-21 04:26:51,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 36 letters. [2022-02-21 04:26:51,144 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,144 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 60 letters. Loop has 36 letters. [2022-02-21 04:26:51,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 78 letters. Loop has 32 letters. [2022-02-21 04:26:51,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 78 letters. Loop has 32 letters. [2022-02-21 04:26:51,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 78 letters. Loop has 32 letters. [2022-02-21 04:26:51,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,145 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 60 letters. Loop has 35 letters. [2022-02-21 04:26:51,145 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 35 letters. [2022-02-21 04:26:51,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 60 letters. Loop has 35 letters. [2022-02-21 04:26:51,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 60 letters. Loop has 37 letters. [2022-02-21 04:26:51,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 37 letters. [2022-02-21 04:26:51,146 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,146 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 60 letters. Loop has 37 letters. [2022-02-21 04:26:51,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 59 letters. Loop has 35 letters. [2022-02-21 04:26:51,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 35 letters. [2022-02-21 04:26:51,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 59 letters. Loop has 35 letters. [2022-02-21 04:26:51,147 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,147 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 73 letters. Loop has 37 letters. [2022-02-21 04:26:51,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 37 letters. [2022-02-21 04:26:51,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 73 letters. Loop has 37 letters. [2022-02-21 04:26:51,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 81 letters. Loop has 32 letters. [2022-02-21 04:26:51,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,148 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 81 letters. Loop has 32 letters. [2022-02-21 04:26:51,148 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 81 letters. Loop has 32 letters. [2022-02-21 04:26:51,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:26:51,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:26:51,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:26:51,149 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,149 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 36 letters. [2022-02-21 04:26:51,150 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,150 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 36 letters. [2022-02-21 04:26:51,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 36 letters. [2022-02-21 04:26:51,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,151 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 61 letters. Loop has 35 letters. [2022-02-21 04:26:51,151 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,154 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 35 letters. [2022-02-21 04:26:51,154 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 61 letters. Loop has 35 letters. [2022-02-21 04:26:51,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 61 letters. Loop has 36 letters. [2022-02-21 04:26:51,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 36 letters. [2022-02-21 04:26:51,155 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,155 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 61 letters. Loop has 36 letters. [2022-02-21 04:26:51,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 37 letters. [2022-02-21 04:26:51,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 37 letters. [2022-02-21 04:26:51,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 37 letters. [2022-02-21 04:26:51,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,156 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 70 letters. Loop has 37 letters. [2022-02-21 04:26:51,156 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 37 letters. [2022-02-21 04:26:51,157 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,157 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 70 letters. Loop has 37 letters. [2022-02-21 04:26:51,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:26:51,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:26:51,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:26:51,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 80 letters. Loop has 35 letters. [2022-02-21 04:26:51,158 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,158 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 80 letters. Loop has 35 letters. [2022-02-21 04:26:51,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 80 letters. Loop has 35 letters. [2022-02-21 04:26:51,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 65 letters. Loop has 35 letters. [2022-02-21 04:26:51,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 35 letters. [2022-02-21 04:26:51,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 65 letters. Loop has 35 letters. [2022-02-21 04:26:51,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 79 letters. Loop has 35 letters. [2022-02-21 04:26:51,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 79 letters. Loop has 35 letters. [2022-02-21 04:26:51,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 79 letters. Loop has 35 letters. [2022-02-21 04:26:51,160 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,160 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 66 letters. Loop has 36 letters. [2022-02-21 04:26:51,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,161 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 36 letters. [2022-02-21 04:26:51,161 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 66 letters. Loop has 36 letters. [2022-02-21 04:26:51,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 78 letters. Loop has 35 letters. [2022-02-21 04:26:51,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 78 letters. Loop has 35 letters. [2022-02-21 04:26:51,162 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,162 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 78 letters. Loop has 35 letters. [2022-02-21 04:26:51,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:26:51,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:26:51,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:26:51,163 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,163 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 77 letters. Loop has 35 letters. [2022-02-21 04:26:51,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 77 letters. Loop has 35 letters. [2022-02-21 04:26:51,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 77 letters. Loop has 35 letters. [2022-02-21 04:26:51,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 76 letters. Loop has 35 letters. [2022-02-21 04:26:51,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 76 letters. Loop has 35 letters. [2022-02-21 04:26:51,164 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,164 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 76 letters. Loop has 35 letters. [2022-02-21 04:26:51,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 75 letters. Loop has 35 letters. [2022-02-21 04:26:51,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 75 letters. Loop has 35 letters. [2022-02-21 04:26:51,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 75 letters. Loop has 35 letters. [2022-02-21 04:26:51,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:26:51,165 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,165 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:26:51,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:26:51,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 74 letters. Loop has 35 letters. [2022-02-21 04:26:51,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 35 letters. [2022-02-21 04:26:51,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,166 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 74 letters. Loop has 35 letters. [2022-02-21 04:26:51,166 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:26:51,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:26:51,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:26:51,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 73 letters. Loop has 35 letters. [2022-02-21 04:26:51,167 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,167 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 35 letters. [2022-02-21 04:26:51,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 73 letters. Loop has 35 letters. [2022-02-21 04:26:51,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 76 letters. Loop has 38 letters. [2022-02-21 04:26:51,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 76 letters. Loop has 38 letters. [2022-02-21 04:26:51,168 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,168 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 76 letters. Loop has 38 letters. [2022-02-21 04:26:51,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:26:51,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:26:51,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:26:51,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,171 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 76 letters. Loop has 39 letters. [2022-02-21 04:26:51,171 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 76 letters. Loop has 39 letters. [2022-02-21 04:26:51,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 76 letters. Loop has 39 letters. [2022-02-21 04:26:51,172 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,172 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 37 letters. [2022-02-21 04:26:51,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 37 letters. [2022-02-21 04:26:51,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 37 letters. [2022-02-21 04:26:51,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 75 letters. Loop has 38 letters. [2022-02-21 04:26:51,173 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,173 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 75 letters. Loop has 38 letters. [2022-02-21 04:26:51,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 75 letters. Loop has 38 letters. [2022-02-21 04:26:51,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 59 letters. Loop has 36 letters. [2022-02-21 04:26:51,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 36 letters. [2022-02-21 04:26:51,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 59 letters. Loop has 36 letters. [2022-02-21 04:26:51,174 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,174 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 59 letters. Loop has 35 letters. [2022-02-21 04:26:51,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 35 letters. [2022-02-21 04:26:51,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 59 letters. Loop has 35 letters. [2022-02-21 04:26:51,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 77 letters. Loop has 40 letters. [2022-02-21 04:26:51,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 77 letters. Loop has 40 letters. [2022-02-21 04:26:51,175 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,175 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 77 letters. Loop has 40 letters. [2022-02-21 04:26:51,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 64 letters. Loop has 35 letters. [2022-02-21 04:26:51,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 35 letters. [2022-02-21 04:26:51,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 64 letters. Loop has 35 letters. [2022-02-21 04:26:51,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,176 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 75 letters. Loop has 38 letters. [2022-02-21 04:26:51,176 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 75 letters. Loop has 38 letters. [2022-02-21 04:26:51,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,177 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 75 letters. Loop has 38 letters. [2022-02-21 04:26:51,177 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 65 letters. Loop has 36 letters. [2022-02-21 04:26:51,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 36 letters. [2022-02-21 04:26:51,178 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,178 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 65 letters. Loop has 36 letters. [2022-02-21 04:26:51,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 76 letters. Loop has 40 letters. [2022-02-21 04:26:51,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 76 letters. Loop has 40 letters. [2022-02-21 04:26:51,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 76 letters. Loop has 40 letters. [2022-02-21 04:26:51,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 65 letters. Loop has 35 letters. [2022-02-21 04:26:51,179 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,179 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 35 letters. [2022-02-21 04:26:51,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 65 letters. Loop has 35 letters. [2022-02-21 04:26:51,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:26:51,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:26:51,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,180 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:26:51,180 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:26:51,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:26:51,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:26:51,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 73 letters. Loop has 38 letters. [2022-02-21 04:26:51,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 38 letters. [2022-02-21 04:26:51,181 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,181 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 73 letters. Loop has 38 letters. [2022-02-21 04:26:51,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 75 letters. Loop has 39 letters. [2022-02-21 04:26:51,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 75 letters. Loop has 39 letters. [2022-02-21 04:26:51,182 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,182 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 75 letters. Loop has 39 letters. [2022-02-21 04:26:51,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 66 letters. Loop has 32 letters. [2022-02-21 04:26:51,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 32 letters. [2022-02-21 04:26:51,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 66 letters. Loop has 32 letters. [2022-02-21 04:26:51,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 74 letters. Loop has 38 letters. [2022-02-21 04:26:51,183 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,183 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 38 letters. [2022-02-21 04:26:51,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 74 letters. Loop has 38 letters. [2022-02-21 04:26:51,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:26:51,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:26:51,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,184 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:26:51,184 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 38 letters. [2022-02-21 04:26:51,185 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,185 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 38 letters. [2022-02-21 04:26:51,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 38 letters. [2022-02-21 04:26:51,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,202 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 73 letters. Loop has 38 letters. [2022-02-21 04:26:51,202 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 38 letters. [2022-02-21 04:26:51,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 73 letters. Loop has 38 letters. [2022-02-21 04:26:51,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 74 letters. Loop has 39 letters. [2022-02-21 04:26:51,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 39 letters. [2022-02-21 04:26:51,203 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,203 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 74 letters. Loop has 39 letters. [2022-02-21 04:26:51,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:26:51,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:26:51,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:26:51,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 35 letters. [2022-02-21 04:26:51,204 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,204 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 35 letters. [2022-02-21 04:26:51,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 35 letters. [2022-02-21 04:26:51,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 38 letters. [2022-02-21 04:26:51,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 38 letters. [2022-02-21 04:26:51,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,205 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 38 letters. [2022-02-21 04:26:51,205 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 73 letters. Loop has 39 letters. [2022-02-21 04:26:51,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 39 letters. [2022-02-21 04:26:51,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 73 letters. Loop has 39 letters. [2022-02-21 04:26:51,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 38 letters. [2022-02-21 04:26:51,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,206 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 38 letters. [2022-02-21 04:26:51,206 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 38 letters. [2022-02-21 04:26:51,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 39 letters. [2022-02-21 04:26:51,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 39 letters. [2022-02-21 04:26:51,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 39 letters. [2022-02-21 04:26:51,207 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,207 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 39 letters. [2022-02-21 04:26:51,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 39 letters. [2022-02-21 04:26:51,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 39 letters. [2022-02-21 04:26:51,208 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,208 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 70 letters. Loop has 38 letters. [2022-02-21 04:26:51,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 38 letters. [2022-02-21 04:26:51,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 70 letters. Loop has 38 letters. [2022-02-21 04:26:51,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 70 letters. Loop has 39 letters. [2022-02-21 04:26:51,209 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,209 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 39 letters. [2022-02-21 04:26:51,210 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,210 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 70 letters. Loop has 39 letters. [2022-02-21 04:26:51,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 86 letters. Loop has 32 letters. [2022-02-21 04:26:51,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,211 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 86 letters. Loop has 32 letters. [2022-02-21 04:26:51,211 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 86 letters. Loop has 32 letters. [2022-02-21 04:26:51,212 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,212 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 38 letters. [2022-02-21 04:26:51,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 38 letters. [2022-02-21 04:26:51,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,213 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 38 letters. [2022-02-21 04:26:51,213 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 87 letters. Loop has 32 letters. [2022-02-21 04:26:51,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 87 letters. Loop has 32 letters. [2022-02-21 04:26:51,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 87 letters. Loop has 32 letters. [2022-02-21 04:26:51,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 39 letters. [2022-02-21 04:26:51,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,214 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 39 letters. [2022-02-21 04:26:51,214 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 39 letters. [2022-02-21 04:26:51,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 38 letters. [2022-02-21 04:26:51,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 38 letters. [2022-02-21 04:26:51,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 38 letters. [2022-02-21 04:26:51,215 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,215 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:26:51,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:26:51,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:26:51,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:26:51,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:26:51,216 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,216 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:26:51,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:26:51,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:26:51,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:26:51,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 38 letters. [2022-02-21 04:26:51,217 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,217 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 38 letters. [2022-02-21 04:26:51,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 38 letters. [2022-02-21 04:26:51,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 73 letters. Loop has 40 letters. [2022-02-21 04:26:51,218 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,218 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 40 letters. [2022-02-21 04:26:51,219 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,219 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 73 letters. Loop has 40 letters. [2022-02-21 04:26:51,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 38 letters. [2022-02-21 04:26:51,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 38 letters. [2022-02-21 04:26:51,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 38 letters. [2022-02-21 04:26:51,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 40 letters. [2022-02-21 04:26:51,220 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,220 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 40 letters. [2022-02-21 04:26:51,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 40 letters. [2022-02-21 04:26:51,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 65 letters. Loop has 35 letters. [2022-02-21 04:26:51,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 35 letters. [2022-02-21 04:26:51,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 65 letters. Loop has 35 letters. [2022-02-21 04:26:51,221 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,221 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 38 letters. [2022-02-21 04:26:51,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 38 letters. [2022-02-21 04:26:51,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 38 letters. [2022-02-21 04:26:51,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 85 letters. Loop has 32 letters. [2022-02-21 04:26:51,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 85 letters. Loop has 32 letters. [2022-02-21 04:26:51,222 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,222 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 85 letters. Loop has 32 letters. [2022-02-21 04:26:51,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 70 letters. Loop has 38 letters. [2022-02-21 04:26:51,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 38 letters. [2022-02-21 04:26:51,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 70 letters. Loop has 38 letters. [2022-02-21 04:26:51,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 40 letters. [2022-02-21 04:26:51,223 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,223 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 40 letters. [2022-02-21 04:26:51,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 40 letters. [2022-02-21 04:26:51,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 40 letters. [2022-02-21 04:26:51,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 40 letters. [2022-02-21 04:26:51,224 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,224 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 40 letters. [2022-02-21 04:26:51,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 39 letters. [2022-02-21 04:26:51,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 39 letters. [2022-02-21 04:26:51,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 39 letters. [2022-02-21 04:26:51,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 38 letters. [2022-02-21 04:26:51,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,225 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 38 letters. [2022-02-21 04:26:51,225 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 38 letters. [2022-02-21 04:26:51,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 89 letters. Loop has 32 letters. [2022-02-21 04:26:51,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 89 letters. Loop has 32 letters. [2022-02-21 04:26:51,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 89 letters. Loop has 32 letters. [2022-02-21 04:26:51,226 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,226 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 39 letters. [2022-02-21 04:26:51,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 39 letters. [2022-02-21 04:26:51,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 39 letters. [2022-02-21 04:26:51,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:26:51,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:26:51,227 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,227 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:26:51,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 66 letters. Loop has 38 letters. [2022-02-21 04:26:51,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 38 letters. [2022-02-21 04:26:51,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 66 letters. Loop has 38 letters. [2022-02-21 04:26:51,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 65 letters. Loop has 38 letters. [2022-02-21 04:26:51,228 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,228 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 38 letters. [2022-02-21 04:26:51,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 65 letters. Loop has 38 letters. [2022-02-21 04:26:51,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:26:51,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:26:51,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:26:51,229 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,229 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 66 letters. Loop has 39 letters. [2022-02-21 04:26:51,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 39 letters. [2022-02-21 04:26:51,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 66 letters. Loop has 39 letters. [2022-02-21 04:26:51,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 32 letters. [2022-02-21 04:26:51,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 32 letters. [2022-02-21 04:26:51,230 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,230 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 32 letters. [2022-02-21 04:26:51,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 65 letters. Loop has 39 letters. [2022-02-21 04:26:51,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 39 letters. [2022-02-21 04:26:51,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 65 letters. Loop has 39 letters. [2022-02-21 04:26:51,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 64 letters. Loop has 38 letters. [2022-02-21 04:26:51,231 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,231 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 38 letters. [2022-02-21 04:26:51,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 64 letters. Loop has 38 letters. [2022-02-21 04:26:51,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 63 letters. Loop has 35 letters. [2022-02-21 04:26:51,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 35 letters. [2022-02-21 04:26:51,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 63 letters. Loop has 35 letters. [2022-02-21 04:26:51,232 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,232 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 64 letters. Loop has 35 letters. [2022-02-21 04:26:51,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 35 letters. [2022-02-21 04:26:51,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 64 letters. Loop has 35 letters. [2022-02-21 04:26:51,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 40 letters. [2022-02-21 04:26:51,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 40 letters. [2022-02-21 04:26:51,233 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,233 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 40 letters. [2022-02-21 04:26:51,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 70 letters. Loop has 40 letters. [2022-02-21 04:26:51,234 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,234 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 40 letters. [2022-02-21 04:26:51,235 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 70 letters. Loop has 40 letters. [2022-02-21 04:26:51,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 40 letters. [2022-02-21 04:26:51,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 40 letters. [2022-02-21 04:26:51,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 40 letters. [2022-02-21 04:26:51,236 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,236 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 76 letters. Loop has 32 letters. [2022-02-21 04:26:51,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 76 letters. Loop has 32 letters. [2022-02-21 04:26:51,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 76 letters. Loop has 32 letters. [2022-02-21 04:26:51,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 38 letters. [2022-02-21 04:26:51,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 38 letters. [2022-02-21 04:26:51,237 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,237 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 38 letters. [2022-02-21 04:26:51,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 40 letters. [2022-02-21 04:26:51,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 40 letters. [2022-02-21 04:26:51,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 40 letters. [2022-02-21 04:26:51,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 65 letters. Loop has 38 letters. [2022-02-21 04:26:51,238 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,238 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 38 letters. [2022-02-21 04:26:51,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 65 letters. Loop has 38 letters. [2022-02-21 04:26:51,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 40 letters. [2022-02-21 04:26:51,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 40 letters. [2022-02-21 04:26:51,239 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,239 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 40 letters. [2022-02-21 04:26:51,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 66 letters. Loop has 38 letters. [2022-02-21 04:26:51,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 38 letters. [2022-02-21 04:26:51,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 66 letters. Loop has 38 letters. [2022-02-21 04:26:51,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 40 letters. [2022-02-21 04:26:51,240 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,240 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 40 letters. [2022-02-21 04:26:51,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 40 letters. [2022-02-21 04:26:51,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 40 letters. [2022-02-21 04:26:51,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 40 letters. [2022-02-21 04:26:51,241 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,241 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 40 letters. [2022-02-21 04:26:51,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 58 letters. Loop has 36 letters. [2022-02-21 04:26:51,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 36 letters. [2022-02-21 04:26:51,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 58 letters. Loop has 36 letters. [2022-02-21 04:26:51,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 66 letters. Loop has 40 letters. [2022-02-21 04:26:51,242 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,242 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 40 letters. [2022-02-21 04:26:51,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 66 letters. Loop has 40 letters. [2022-02-21 04:26:51,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 58 letters. Loop has 35 letters. [2022-02-21 04:26:51,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 35 letters. [2022-02-21 04:26:51,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 58 letters. Loop has 35 letters. [2022-02-21 04:26:51,243 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,243 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 76 letters. Loop has 40 letters. [2022-02-21 04:26:51,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 76 letters. Loop has 40 letters. [2022-02-21 04:26:51,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 76 letters. Loop has 40 letters. [2022-02-21 04:26:51,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 64 letters. Loop has 32 letters. [2022-02-21 04:26:51,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 32 letters. [2022-02-21 04:26:51,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 64 letters. Loop has 32 letters. [2022-02-21 04:26:51,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 74 letters. Loop has 38 letters. [2022-02-21 04:26:51,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 38 letters. [2022-02-21 04:26:51,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 74 letters. Loop has 38 letters. [2022-02-21 04:26:51,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 75 letters. Loop has 40 letters. [2022-02-21 04:26:51,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 75 letters. Loop has 40 letters. [2022-02-21 04:26:51,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 75 letters. Loop has 40 letters. [2022-02-21 04:26:51,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 75 letters. Loop has 40 letters. [2022-02-21 04:26:51,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 75 letters. Loop has 40 letters. [2022-02-21 04:26:51,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 75 letters. Loop has 40 letters. [2022-02-21 04:26:51,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 74 letters. Loop has 40 letters. [2022-02-21 04:26:51,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 40 letters. [2022-02-21 04:26:51,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 74 letters. Loop has 40 letters. [2022-02-21 04:26:51,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 57 letters. Loop has 35 letters. [2022-02-21 04:26:51,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 35 letters. [2022-02-21 04:26:51,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 57 letters. Loop has 35 letters. [2022-02-21 04:26:51,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:26:51,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:26:51,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:26:51,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 56 letters. Loop has 35 letters. [2022-02-21 04:26:51,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 35 letters. [2022-02-21 04:26:51,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 56 letters. Loop has 35 letters. [2022-02-21 04:26:51,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 89 letters. Loop has 35 letters. [2022-02-21 04:26:51,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 89 letters. Loop has 35 letters. [2022-02-21 04:26:51,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 89 letters. Loop has 35 letters. [2022-02-21 04:26:51,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 73 letters. Loop has 36 letters. [2022-02-21 04:26:51,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 36 letters. [2022-02-21 04:26:51,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 73 letters. Loop has 36 letters. [2022-02-21 04:26:51,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 88 letters. Loop has 35 letters. [2022-02-21 04:26:51,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 88 letters. Loop has 35 letters. [2022-02-21 04:26:51,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 88 letters. Loop has 35 letters. [2022-02-21 04:26:51,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 73 letters. Loop has 35 letters. [2022-02-21 04:26:51,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 35 letters. [2022-02-21 04:26:51,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,251 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 73 letters. Loop has 35 letters. [2022-02-21 04:26:51,251 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 87 letters. Loop has 35 letters. [2022-02-21 04:26:51,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 87 letters. Loop has 35 letters. [2022-02-21 04:26:51,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 87 letters. Loop has 35 letters. [2022-02-21 04:26:51,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 74 letters. Loop has 37 letters. [2022-02-21 04:26:51,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,252 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 37 letters. [2022-02-21 04:26:51,252 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 74 letters. Loop has 37 letters. [2022-02-21 04:26:51,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 86 letters. Loop has 35 letters. [2022-02-21 04:26:51,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 86 letters. Loop has 35 letters. [2022-02-21 04:26:51,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 86 letters. Loop has 35 letters. [2022-02-21 04:26:51,253 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,253 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 63 letters. Loop has 37 letters. [2022-02-21 04:26:51,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 37 letters. [2022-02-21 04:26:51,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 63 letters. Loop has 37 letters. [2022-02-21 04:26:51,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 83 letters. Loop has 35 letters. [2022-02-21 04:26:51,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 83 letters. Loop has 35 letters. [2022-02-21 04:26:51,254 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,254 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 83 letters. Loop has 35 letters. [2022-02-21 04:26:51,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 64 letters. Loop has 37 letters. [2022-02-21 04:26:51,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 37 letters. [2022-02-21 04:26:51,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 64 letters. Loop has 37 letters. [2022-02-21 04:26:51,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 60 letters. Loop has 35 letters. [2022-02-21 04:26:51,255 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,255 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 35 letters. [2022-02-21 04:26:51,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 60 letters. Loop has 35 letters. [2022-02-21 04:26:51,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 61 letters. Loop has 35 letters. [2022-02-21 04:26:51,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 35 letters. [2022-02-21 04:26:51,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 61 letters. Loop has 35 letters. [2022-02-21 04:26:51,256 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,256 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 61 letters. Loop has 37 letters. [2022-02-21 04:26:51,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 37 letters. [2022-02-21 04:26:51,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 61 letters. Loop has 37 letters. [2022-02-21 04:26:51,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 36 letters. [2022-02-21 04:26:51,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 36 letters. [2022-02-21 04:26:51,257 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,257 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 36 letters. [2022-02-21 04:26:51,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 382 states and 661 transitions. cyclomatic complexity: 280 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:26:51,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:26:51,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,258 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 571 states and 968 transitions. cyclomatic complexity: 398 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:26:51,258 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,258 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:26:51,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 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:26:51,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 528 transitions. [2022-02-21 04:26:51,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 528 transitions. Stem has 55 letters. Loop has 35 letters. [2022-02-21 04:26:51,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 528 transitions. Stem has 90 letters. Loop has 35 letters. [2022-02-21 04:26:51,262 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,262 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 528 transitions. Stem has 55 letters. Loop has 70 letters. [2022-02-21 04:26:51,263 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:26:51,263 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 571 states and 968 transitions. cyclomatic complexity: 398 [2022-02-21 04:26:51,274 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:26:51,274 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 571 states to 0 states and 0 transitions. [2022-02-21 04:26:51,274 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:26:51,274 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:26:51,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:26:51,274 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:26:51,274 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:26:51,274 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:26:51,275 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:26:51,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:26:51,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:26:51,275 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:26:51,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:26:51,275 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 04:26:51,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 04:26:51,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:26:51,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:26:51,314 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-02-21 04:26:51,314 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:26:51,314 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 04:26:51,314 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:26:51,314 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:26:51,314 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:26:51,314 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:26:51,314 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:26:51,314 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:26:51,314 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:26:51,314 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:26:51,314 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:26:51,315 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:26:51,315 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:26:51,319 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:26:51 BoogieIcfgContainer [2022-02-21 04:26:51,319 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:26:51,320 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:26:51,320 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:26:51,320 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:26:51,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:26:43" (3/4) ... [2022-02-21 04:26:51,321 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:26:51,321 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:26:51,322 INFO L158 Benchmark]: Toolchain (without parser) took 9128.84ms. Allocated memory was 77.6MB in the beginning and 207.6MB in the end (delta: 130.0MB). Free memory was 37.8MB in the beginning and 119.2MB in the end (delta: -81.4MB). Peak memory consumption was 50.6MB. Max. memory is 16.1GB. [2022-02-21 04:26:51,323 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 77.6MB. Free memory is still 55.7MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:26:51,332 INFO L158 Benchmark]: CACSL2BoogieTranslator took 481.60ms. Allocated memory was 77.6MB in the beginning and 98.6MB in the end (delta: 21.0MB). Free memory was 37.6MB in the beginning and 56.6MB in the end (delta: -19.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 04:26:51,333 INFO L158 Benchmark]: Boogie Procedure Inliner took 85.95ms. Allocated memory is still 98.6MB. Free memory was 56.6MB in the beginning and 50.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 04:26:51,333 INFO L158 Benchmark]: Boogie Preprocessor took 52.75ms. Allocated memory is still 98.6MB. Free memory was 50.3MB in the beginning and 46.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 04:26:51,333 INFO L158 Benchmark]: RCFGBuilder took 979.82ms. Allocated memory is still 98.6MB. Free memory was 46.1MB in the beginning and 67.1MB in the end (delta: -21.0MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. [2022-02-21 04:26:51,333 INFO L158 Benchmark]: BuchiAutomizer took 7521.47ms. Allocated memory was 98.6MB in the beginning and 207.6MB in the end (delta: 109.1MB). Free memory was 67.1MB in the beginning and 119.2MB in the end (delta: -52.1MB). Peak memory consumption was 57.7MB. Max. memory is 16.1GB. [2022-02-21 04:26:51,334 INFO L158 Benchmark]: Witness Printer took 1.97ms. Allocated memory is still 207.6MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:26:51,334 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 77.6MB. Free memory is still 55.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 481.60ms. Allocated memory was 77.6MB in the beginning and 98.6MB in the end (delta: 21.0MB). Free memory was 37.6MB in the beginning and 56.6MB in the end (delta: -19.0MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 85.95ms. Allocated memory is still 98.6MB. Free memory was 56.6MB in the beginning and 50.3MB in the end (delta: 6.3MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 52.75ms. Allocated memory is still 98.6MB. Free memory was 50.3MB in the beginning and 46.1MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 979.82ms. Allocated memory is still 98.6MB. Free memory was 46.1MB in the beginning and 67.1MB in the end (delta: -21.0MB). Peak memory consumption was 26.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 7521.47ms. Allocated memory was 98.6MB in the beginning and 207.6MB in the end (delta: 109.1MB). Free memory was 67.1MB in the beginning and 119.2MB in the end (delta: -52.1MB). Peak memory consumption was 57.7MB. Max. memory is 16.1GB. * Witness Printer took 1.97ms. Allocated memory is still 207.6MB. Free memory is still 119.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 15 + -2 * i2 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.4s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 4.2s. Construction of modules took 0.0s. Büchi inclusion checks took 2.7s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 382 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 645 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 645 mSDsluCounter, 3878 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2287 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 1591 mSDtfsCounter, 36 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI2 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital193 mio100 ax100 hnf100 lsp38 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq229 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 47ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 04:26:51,371 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