./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.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 c6267d36e2eda753e26c9c989bedb16747ddf010783b33bee2d0cb2d2001d5ce --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:30:59,678 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:30:59,680 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:30:59,723 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:30:59,724 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:30:59,727 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:30:59,729 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:30:59,731 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:30:59,733 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:30:59,737 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:30:59,738 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:30:59,739 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:30:59,740 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:30:59,742 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:30:59,743 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:30:59,746 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:30:59,747 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:30:59,748 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:30:59,750 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:30:59,755 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:30:59,756 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:30:59,757 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:30:59,759 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:30:59,760 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:30:59,766 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:30:59,766 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:30:59,766 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:30:59,768 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:30:59,768 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:30:59,769 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:30:59,769 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:30:59,770 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:30:59,771 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:30:59,772 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:30:59,773 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:30:59,774 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:30:59,774 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:30:59,775 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:30:59,775 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:30:59,776 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:30:59,777 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:30:59,778 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:30:59,813 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:30:59,814 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:30:59,814 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:30:59,814 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:30:59,816 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:30:59,816 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:30:59,816 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:30:59,816 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:30:59,816 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:30:59,816 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:30:59,817 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:30:59,817 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:30:59,818 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:30:59,818 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:30:59,818 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:30:59,818 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:30:59,818 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:30:59,819 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:30:59,819 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:30:59,819 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:30:59,819 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:30:59,819 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:30:59,820 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:30:59,820 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:30:59,820 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:30:59,820 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:30:59,820 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:30:59,821 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:30:59,821 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:30:59,821 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:30:59,821 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:30:59,822 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:30:59,822 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 -> c6267d36e2eda753e26c9c989bedb16747ddf010783b33bee2d0cb2d2001d5ce [2022-02-21 04:31:00,072 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:31:00,097 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:31:00,100 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:31:00,102 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:31:00,102 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:31:00,104 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c [2022-02-21 04:31:00,156 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa7eb0ff5/3d3a5932ba0d4317a51c23687df6e0df/FLAG8004a8b80 [2022-02-21 04:31:00,616 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:31:00,616 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c [2022-02-21 04:31:00,626 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa7eb0ff5/3d3a5932ba0d4317a51c23687df6e0df/FLAG8004a8b80 [2022-02-21 04:31:00,636 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa7eb0ff5/3d3a5932ba0d4317a51c23687df6e0df [2022-02-21 04:31:00,639 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:31:00,641 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:31:00,644 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:31:00,644 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:31:00,647 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:31:00,648 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:31:00" (1/1) ... [2022-02-21 04:31:00,648 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38e45e4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:00, skipping insertion in model container [2022-02-21 04:31:00,649 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:31:00" (1/1) ... [2022-02-21 04:31:00,654 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:31:00,685 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:31:00,910 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c[12747,12760] [2022-02-21 04:31:00,911 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:31:00,919 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:31:00,988 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c[12747,12760] [2022-02-21 04:31:00,988 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:31:01,004 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:31:01,005 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:01 WrapperNode [2022-02-21 04:31:01,005 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:31:01,006 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:31:01,006 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:31:01,006 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:31:01,018 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:31:01" (1/1) ... [2022-02-21 04:31:01,027 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:31:01" (1/1) ... [2022-02-21 04:31:01,102 INFO L137 Inliner]: procedures = 21, calls = 13, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 445 [2022-02-21 04:31:01,103 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:31:01,108 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:31:01,108 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:31:01,108 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:31:01,115 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:01" (1/1) ... [2022-02-21 04:31:01,115 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:01" (1/1) ... [2022-02-21 04:31:01,126 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:01" (1/1) ... [2022-02-21 04:31:01,126 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:01" (1/1) ... [2022-02-21 04:31:01,141 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:01" (1/1) ... [2022-02-21 04:31:01,148 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:01" (1/1) ... [2022-02-21 04:31:01,150 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:01" (1/1) ... [2022-02-21 04:31:01,153 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:31:01,154 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:31:01,154 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:31:01,154 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:31:01,160 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:01" (1/1) ... [2022-02-21 04:31:01,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:01,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:01,184 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:31:01,187 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:31:01,219 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:31:01,219 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:31:01,219 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:31:01,220 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:31:01,331 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:31:01,332 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:31:01,956 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:31:01,963 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:31:01,963 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 04:31:01,964 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:31:01 BoogieIcfgContainer [2022-02-21 04:31:01,965 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:31:01,965 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:31:01,966 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:31:01,968 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:31:01,969 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:31:01,969 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:31:00" (1/3) ... [2022-02-21 04:31:01,970 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ac803ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:31:01, skipping insertion in model container [2022-02-21 04:31:01,970 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:31:01,970 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:01" (2/3) ... [2022-02-21 04:31:01,971 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@7ac803ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:31:01, skipping insertion in model container [2022-02-21 04:31:01,971 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:31:01,971 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:31:01" (3/3) ... [2022-02-21 04:31:01,972 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c [2022-02-21 04:31:02,006 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:31:02,007 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:31:02,007 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:31:02,007 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:31:02,007 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:31:02,007 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:31:02,007 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:31:02,007 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:31:02,025 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 136 states, 135 states have (on average 1.7407407407407407) internal successors, (235), 135 states have internal predecessors, (235), 0 states have call successors, (0), 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:31:02,068 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2022-02-21 04:31:02,069 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:31:02,069 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:31:02,076 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] [2022-02-21 04:31:02,076 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:31:02,076 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:31:02,078 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 136 states, 135 states have (on average 1.7407407407407407) internal successors, (235), 135 states have internal predecessors, (235), 0 states have call successors, (0), 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:31:02,101 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2022-02-21 04:31:02,105 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:31:02,105 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:31:02,106 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] [2022-02-21 04:31:02,107 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:31:02,114 INFO L791 eck$LassoCheckResult]: Stem: 125#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~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;~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;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; 42#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, 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~ret40#1, main_#t~ret41#1, main_#t~post42#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~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~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_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 20#L255true assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 9#L258-1true init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 22#L268true assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 26#L271-1true init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 13#L281true assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 48#L284-1true init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 119#L294true assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 34#L297-1true init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 75#L307true assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 76#L310-1true init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 79#L320true assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 87#L323-1true init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 63#L333true assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 115#L333-1true init_#res#1 := init_~tmp___5~0#1; 17#L430true main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1; 92#L527true assume !(0 == main_~i2~0#1); 120#L527-2true ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 19#L541-2true [2022-02-21 04:31:02,119 INFO L793 eck$LassoCheckResult]: Loop: 19#L541-2true assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 53#L79true assume !(0 != ~mode1~0 % 256); 130#L107true assume !(~r1~0 < 2); 126#L107-1true ~mode1~0 := 1; 40#L79-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 58#L130true assume !(0 != ~mode2~0 % 256); 15#L158true assume !(~r2~0 < 2); 90#L158-1true ~mode2~0 := 1; 55#L130-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 95#L181true assume !(0 != ~mode3~0 % 256); 114#L209true assume !(~r3~0 < 2); 137#L209-1true ~mode3~0 := 1; 47#L181-2true assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 93#L438true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 44#L438-1true check_#res#1 := check_~tmp~1#1; 98#L486true main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; 128#L571true assume !(0 == assert_~arg#1 % 256); 116#L566true assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; 19#L541-2true [2022-02-21 04:31:02,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:02,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1710390244, now seen corresponding path program 1 times [2022-02-21 04:31:02,135 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:02,136 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714570880] [2022-02-21 04:31:02,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:02,137 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:02,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:02,394 INFO L290 TraceCheckUtils]: 0: Hoare triple {140#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~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;~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;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {140#true} is VALID [2022-02-21 04:31:02,395 INFO L290 TraceCheckUtils]: 1: Hoare triple {140#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, 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~ret40#1, main_#t~ret41#1, main_#t~post42#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~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~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_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {140#true} is VALID [2022-02-21 04:31:02,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {140#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {140#true} is VALID [2022-02-21 04:31:02,396 INFO L290 TraceCheckUtils]: 3: Hoare triple {140#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {140#true} is VALID [2022-02-21 04:31:02,396 INFO L290 TraceCheckUtils]: 4: Hoare triple {140#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {140#true} is VALID [2022-02-21 04:31:02,396 INFO L290 TraceCheckUtils]: 5: Hoare triple {140#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {140#true} is VALID [2022-02-21 04:31:02,397 INFO L290 TraceCheckUtils]: 6: Hoare triple {140#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {140#true} is VALID [2022-02-21 04:31:02,397 INFO L290 TraceCheckUtils]: 7: Hoare triple {140#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {140#true} is VALID [2022-02-21 04:31:02,397 INFO L290 TraceCheckUtils]: 8: Hoare triple {140#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {140#true} is VALID [2022-02-21 04:31:02,397 INFO L290 TraceCheckUtils]: 9: Hoare triple {140#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {140#true} is VALID [2022-02-21 04:31:02,398 INFO L290 TraceCheckUtils]: 10: Hoare triple {140#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {140#true} is VALID [2022-02-21 04:31:02,398 INFO L290 TraceCheckUtils]: 11: Hoare triple {140#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {140#true} is VALID [2022-02-21 04:31:02,398 INFO L290 TraceCheckUtils]: 12: Hoare triple {140#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {140#true} is VALID [2022-02-21 04:31:02,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {140#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {140#true} is VALID [2022-02-21 04:31:02,399 INFO L290 TraceCheckUtils]: 14: Hoare triple {140#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; {142#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} is VALID [2022-02-21 04:31:02,400 INFO L290 TraceCheckUtils]: 15: Hoare triple {142#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} init_#res#1 := init_~tmp___5~0#1; {143#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:31:02,400 INFO L290 TraceCheckUtils]: 16: Hoare triple {143#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1; {144#(= |ULTIMATE.start_main_~i2~0#1| 0)} is VALID [2022-02-21 04:31:02,401 INFO L290 TraceCheckUtils]: 17: Hoare triple {144#(= |ULTIMATE.start_main_~i2~0#1| 0)} assume !(0 == main_~i2~0#1); {141#false} is VALID [2022-02-21 04:31:02,401 INFO L290 TraceCheckUtils]: 18: Hoare triple {141#false} ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {141#false} is VALID [2022-02-21 04:31:02,402 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:31:02,402 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:31:02,403 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714570880] [2022-02-21 04:31:02,404 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [714570880] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:31:02,415 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:31:02,415 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:31:02,417 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152437075] [2022-02-21 04:31:02,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:31:02,420 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:31:02,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:02,421 INFO L85 PathProgramCache]: Analyzing trace with hash -365412558, now seen corresponding path program 1 times [2022-02-21 04:31:02,421 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:02,422 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1505913863] [2022-02-21 04:31:02,422 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:02,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:02,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:02,579 INFO L290 TraceCheckUtils]: 0: Hoare triple {145#true} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {145#true} is VALID [2022-02-21 04:31:02,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {145#true} assume !(0 != ~mode1~0 % 256); {145#true} is VALID [2022-02-21 04:31:02,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {145#true} assume !(~r1~0 < 2); {145#true} is VALID [2022-02-21 04:31:02,581 INFO L290 TraceCheckUtils]: 3: Hoare triple {145#true} ~mode1~0 := 1; {145#true} is VALID [2022-02-21 04:31:02,581 INFO L290 TraceCheckUtils]: 4: Hoare triple {145#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {145#true} is VALID [2022-02-21 04:31:02,581 INFO L290 TraceCheckUtils]: 5: Hoare triple {145#true} assume !(0 != ~mode2~0 % 256); {145#true} is VALID [2022-02-21 04:31:02,581 INFO L290 TraceCheckUtils]: 6: Hoare triple {145#true} assume !(~r2~0 < 2); {145#true} is VALID [2022-02-21 04:31:02,582 INFO L290 TraceCheckUtils]: 7: Hoare triple {145#true} ~mode2~0 := 1; {145#true} is VALID [2022-02-21 04:31:02,582 INFO L290 TraceCheckUtils]: 8: Hoare triple {145#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {145#true} is VALID [2022-02-21 04:31:02,583 INFO L290 TraceCheckUtils]: 9: Hoare triple {145#true} assume !(0 != ~mode3~0 % 256); {145#true} is VALID [2022-02-21 04:31:02,583 INFO L290 TraceCheckUtils]: 10: Hoare triple {145#true} assume !(~r3~0 < 2); {145#true} is VALID [2022-02-21 04:31:02,583 INFO L290 TraceCheckUtils]: 11: Hoare triple {145#true} ~mode3~0 := 1; {145#true} is VALID [2022-02-21 04:31:02,583 INFO L290 TraceCheckUtils]: 12: Hoare triple {145#true} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {145#true} is VALID [2022-02-21 04:31:02,584 INFO L290 TraceCheckUtils]: 13: Hoare triple {145#true} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {147#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:31:02,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {147#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {148#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:31:02,585 INFO L290 TraceCheckUtils]: 15: Hoare triple {148#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {149#(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:31:02,586 INFO L290 TraceCheckUtils]: 16: Hoare triple {149#(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); {146#false} is VALID [2022-02-21 04:31:02,587 INFO L290 TraceCheckUtils]: 17: Hoare triple {146#false} assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; {146#false} is VALID [2022-02-21 04:31:02,587 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:31:02,588 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:31:02,588 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1505913863] [2022-02-21 04:31:02,588 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1505913863] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:31:02,588 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:31:02,589 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:31:02,589 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809859792] [2022-02-21 04:31:02,589 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:31:02,591 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:31:02,593 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:31:02,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:31:02,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:31:02,629 INFO L87 Difference]: Start difference. First operand has 136 states, 135 states have (on average 1.7407407407407407) internal successors, (235), 135 states have internal predecessors, (235), 0 states have call successors, (0), 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 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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:31:03,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:03,224 INFO L93 Difference]: Finished difference Result 140 states and 235 transitions. [2022-02-21 04:31:03,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:31:03,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 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:31:03,244 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:31:03,248 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 140 states and 235 transitions. [2022-02-21 04:31:03,256 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2022-02-21 04:31:03,263 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 140 states to 131 states and 219 transitions. [2022-02-21 04:31:03,264 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 131 [2022-02-21 04:31:03,265 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 131 [2022-02-21 04:31:03,265 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 219 transitions. [2022-02-21 04:31:03,266 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:31:03,266 INFO L681 BuchiCegarLoop]: Abstraction has 131 states and 219 transitions. [2022-02-21 04:31:03,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 219 transitions. [2022-02-21 04:31:03,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-02-21 04:31:03,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:31:03,294 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states and 219 transitions. Second operand has 131 states, 131 states have (on average 1.6717557251908397) internal successors, (219), 130 states have internal predecessors, (219), 0 states have call successors, (0), 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:31:03,295 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states and 219 transitions. Second operand has 131 states, 131 states have (on average 1.6717557251908397) internal successors, (219), 130 states have internal predecessors, (219), 0 states have call successors, (0), 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:31:03,298 INFO L87 Difference]: Start difference. First operand 131 states and 219 transitions. Second operand has 131 states, 131 states have (on average 1.6717557251908397) internal successors, (219), 130 states have internal predecessors, (219), 0 states have call successors, (0), 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:31:03,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:03,305 INFO L93 Difference]: Finished difference Result 131 states and 219 transitions. [2022-02-21 04:31:03,305 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 219 transitions. [2022-02-21 04:31:03,306 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:03,307 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:03,307 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 131 states have (on average 1.6717557251908397) internal successors, (219), 130 states have internal predecessors, (219), 0 states have call successors, (0), 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 131 states and 219 transitions. [2022-02-21 04:31:03,308 INFO L87 Difference]: Start difference. First operand has 131 states, 131 states have (on average 1.6717557251908397) internal successors, (219), 130 states have internal predecessors, (219), 0 states have call successors, (0), 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 131 states and 219 transitions. [2022-02-21 04:31:03,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:03,313 INFO L93 Difference]: Finished difference Result 131 states and 219 transitions. [2022-02-21 04:31:03,313 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 219 transitions. [2022-02-21 04:31:03,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:03,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:03,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:31:03,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:31:03,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 131 states have (on average 1.6717557251908397) internal successors, (219), 130 states have internal predecessors, (219), 0 states have call successors, (0), 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:31:03,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 219 transitions. [2022-02-21 04:31:03,320 INFO L704 BuchiCegarLoop]: Abstraction has 131 states and 219 transitions. [2022-02-21 04:31:03,320 INFO L587 BuchiCegarLoop]: Abstraction has 131 states and 219 transitions. [2022-02-21 04:31:03,321 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:31:03,321 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 219 transitions. [2022-02-21 04:31:03,322 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2022-02-21 04:31:03,323 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:31:03,323 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:31:03,324 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] [2022-02-21 04:31:03,324 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] [2022-02-21 04:31:03,324 INFO L791 eck$LassoCheckResult]: Stem: 424#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~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;~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;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; 361#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, 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~ret40#1, main_#t~ret41#1, main_#t~post42#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~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~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_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 324#L255 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 307#L258-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 308#L268 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 332#L271-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 313#L281 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 314#L284-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 368#L294 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 348#L297-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 352#L307 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 370#L310-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 400#L320 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 298#L323-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 389#L333 assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 339#L333-1 init_#res#1 := init_~tmp___5~0#1; 318#L430 main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1; 319#L527 assume !(0 == main_~i2~0#1); 412#L527-2 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 322#L541-2 [2022-02-21 04:31:03,324 INFO L793 eck$LassoCheckResult]: Loop: 322#L541-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 323#L79 assume !(0 != ~mode1~0 % 256); 377#L107 assume !(~r1~0 < 2); 374#L107-1 ~mode1~0 := 1; 321#L79-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 360#L130 assume !(0 != ~mode2~0 % 256); 316#L158 assume !(~r2~0 < 2); 311#L158-1 ~mode2~0 := 1; 382#L130-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 383#L181 assume !(0 != ~mode3~0 % 256); 413#L209 assume !(~r3~0 < 2); 345#L209-1 ~mode3~0 := 1; 327#L181-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 367#L438 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 380#L439 assume ~st1~0 + ~nl1~0 <= 1; 381#L440 assume ~st2~0 + ~nl2~0 <= 1; 330#L441 assume ~st3~0 + ~nl3~0 <= 1; 331#L442 assume ~r1~0 >= 2; 340#L446 assume ~r1~0 < 2; 411#L451 assume ~r1~0 >= 2; 295#L456 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 363#L438-1 check_#res#1 := check_~tmp~1#1; 364#L486 main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; 415#L571 assume !(0 == assert_~arg#1 % 256); 421#L566 assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; 322#L541-2 [2022-02-21 04:31:03,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:03,325 INFO L85 PathProgramCache]: Analyzing trace with hash 1710390244, now seen corresponding path program 2 times [2022-02-21 04:31:03,326 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:03,326 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [861036854] [2022-02-21 04:31:03,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:03,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:03,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:03,427 INFO L290 TraceCheckUtils]: 0: Hoare triple {690#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~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;~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;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {690#true} is VALID [2022-02-21 04:31:03,427 INFO L290 TraceCheckUtils]: 1: Hoare triple {690#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, 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~ret40#1, main_#t~ret41#1, main_#t~post42#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~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~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_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {690#true} is VALID [2022-02-21 04:31:03,427 INFO L290 TraceCheckUtils]: 2: Hoare triple {690#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {690#true} is VALID [2022-02-21 04:31:03,428 INFO L290 TraceCheckUtils]: 3: Hoare triple {690#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {690#true} is VALID [2022-02-21 04:31:03,428 INFO L290 TraceCheckUtils]: 4: Hoare triple {690#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {690#true} is VALID [2022-02-21 04:31:03,428 INFO L290 TraceCheckUtils]: 5: Hoare triple {690#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {690#true} is VALID [2022-02-21 04:31:03,428 INFO L290 TraceCheckUtils]: 6: Hoare triple {690#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {690#true} is VALID [2022-02-21 04:31:03,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {690#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {690#true} is VALID [2022-02-21 04:31:03,429 INFO L290 TraceCheckUtils]: 8: Hoare triple {690#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {690#true} is VALID [2022-02-21 04:31:03,429 INFO L290 TraceCheckUtils]: 9: Hoare triple {690#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {690#true} is VALID [2022-02-21 04:31:03,429 INFO L290 TraceCheckUtils]: 10: Hoare triple {690#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {690#true} is VALID [2022-02-21 04:31:03,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {690#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {690#true} is VALID [2022-02-21 04:31:03,433 INFO L290 TraceCheckUtils]: 12: Hoare triple {690#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {690#true} is VALID [2022-02-21 04:31:03,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {690#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {690#true} is VALID [2022-02-21 04:31:03,439 INFO L290 TraceCheckUtils]: 14: Hoare triple {690#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; {692#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} is VALID [2022-02-21 04:31:03,440 INFO L290 TraceCheckUtils]: 15: Hoare triple {692#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} init_#res#1 := init_~tmp___5~0#1; {693#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:31:03,442 INFO L290 TraceCheckUtils]: 16: Hoare triple {693#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1; {694#(= |ULTIMATE.start_main_~i2~0#1| 0)} is VALID [2022-02-21 04:31:03,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {694#(= |ULTIMATE.start_main_~i2~0#1| 0)} assume !(0 == main_~i2~0#1); {691#false} is VALID [2022-02-21 04:31:03,443 INFO L290 TraceCheckUtils]: 18: Hoare triple {691#false} ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {691#false} is VALID [2022-02-21 04:31:03,444 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:31:03,444 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:31:03,444 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [861036854] [2022-02-21 04:31:03,444 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [861036854] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:31:03,444 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:31:03,445 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:31:03,445 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117785145] [2022-02-21 04:31:03,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:31:03,445 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:31:03,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:03,446 INFO L85 PathProgramCache]: Analyzing trace with hash 630711638, now seen corresponding path program 1 times [2022-02-21 04:31:03,446 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:03,447 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40593217] [2022-02-21 04:31:03,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:03,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:03,468 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:03,504 INFO L290 TraceCheckUtils]: 0: Hoare triple {695#true} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {695#true} is VALID [2022-02-21 04:31:03,505 INFO L290 TraceCheckUtils]: 1: Hoare triple {695#true} assume !(0 != ~mode1~0 % 256); {695#true} is VALID [2022-02-21 04:31:03,505 INFO L290 TraceCheckUtils]: 2: Hoare triple {695#true} assume !(~r1~0 < 2); {697#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:03,506 INFO L290 TraceCheckUtils]: 3: Hoare triple {697#(not (<= ~r1~0 1))} ~mode1~0 := 1; {697#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:03,506 INFO L290 TraceCheckUtils]: 4: Hoare triple {697#(not (<= ~r1~0 1))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {697#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:03,507 INFO L290 TraceCheckUtils]: 5: Hoare triple {697#(not (<= ~r1~0 1))} assume !(0 != ~mode2~0 % 256); {697#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:03,507 INFO L290 TraceCheckUtils]: 6: Hoare triple {697#(not (<= ~r1~0 1))} assume !(~r2~0 < 2); {697#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:03,508 INFO L290 TraceCheckUtils]: 7: Hoare triple {697#(not (<= ~r1~0 1))} ~mode2~0 := 1; {697#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:03,508 INFO L290 TraceCheckUtils]: 8: Hoare triple {697#(not (<= ~r1~0 1))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {697#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:03,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {697#(not (<= ~r1~0 1))} assume !(0 != ~mode3~0 % 256); {697#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:03,509 INFO L290 TraceCheckUtils]: 10: Hoare triple {697#(not (<= ~r1~0 1))} assume !(~r3~0 < 2); {697#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:03,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {697#(not (<= ~r1~0 1))} ~mode3~0 := 1; {697#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:03,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {697#(not (<= ~r1~0 1))} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {697#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:03,511 INFO L290 TraceCheckUtils]: 13: Hoare triple {697#(not (<= ~r1~0 1))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {697#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:03,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {697#(not (<= ~r1~0 1))} assume ~st1~0 + ~nl1~0 <= 1; {697#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:03,512 INFO L290 TraceCheckUtils]: 15: Hoare triple {697#(not (<= ~r1~0 1))} assume ~st2~0 + ~nl2~0 <= 1; {697#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:03,512 INFO L290 TraceCheckUtils]: 16: Hoare triple {697#(not (<= ~r1~0 1))} assume ~st3~0 + ~nl3~0 <= 1; {697#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:03,513 INFO L290 TraceCheckUtils]: 17: Hoare triple {697#(not (<= ~r1~0 1))} assume ~r1~0 >= 2; {697#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:03,513 INFO L290 TraceCheckUtils]: 18: Hoare triple {697#(not (<= ~r1~0 1))} assume ~r1~0 < 2; {696#false} is VALID [2022-02-21 04:31:03,514 INFO L290 TraceCheckUtils]: 19: Hoare triple {696#false} assume ~r1~0 >= 2; {696#false} is VALID [2022-02-21 04:31:03,514 INFO L290 TraceCheckUtils]: 20: Hoare triple {696#false} assume ~r1~0 < 2;check_~tmp~1#1 := 1; {696#false} is VALID [2022-02-21 04:31:03,514 INFO L290 TraceCheckUtils]: 21: Hoare triple {696#false} check_#res#1 := check_~tmp~1#1; {696#false} is VALID [2022-02-21 04:31:03,514 INFO L290 TraceCheckUtils]: 22: Hoare triple {696#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {696#false} is VALID [2022-02-21 04:31:03,515 INFO L290 TraceCheckUtils]: 23: Hoare triple {696#false} assume !(0 == assert_~arg#1 % 256); {696#false} is VALID [2022-02-21 04:31:03,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {696#false} assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; {696#false} is VALID [2022-02-21 04:31:03,516 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:31:03,516 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:31:03,517 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40593217] [2022-02-21 04:31:03,517 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40593217] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:31:03,517 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:31:03,518 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:31:03,518 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [614621626] [2022-02-21 04:31:03,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:31:03,519 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:31:03,520 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:31:03,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:31:03,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:31:03,520 INFO L87 Difference]: Start difference. First operand 131 states and 219 transitions. cyclomatic complexity: 89 Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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:31:04,006 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:04,006 INFO L93 Difference]: Finished difference Result 211 states and 344 transitions. [2022-02-21 04:31:04,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 04:31:04,006 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 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:31:04,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:31:04,024 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 211 states and 344 transitions. [2022-02-21 04:31:04,030 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2022-02-21 04:31:04,037 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 211 states to 208 states and 318 transitions. [2022-02-21 04:31:04,037 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 208 [2022-02-21 04:31:04,038 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 208 [2022-02-21 04:31:04,038 INFO L73 IsDeterministic]: Start isDeterministic. Operand 208 states and 318 transitions. [2022-02-21 04:31:04,039 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:31:04,039 INFO L681 BuchiCegarLoop]: Abstraction has 208 states and 318 transitions. [2022-02-21 04:31:04,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states and 318 transitions. [2022-02-21 04:31:04,045 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 131. [2022-02-21 04:31:04,045 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:31:04,046 INFO L82 GeneralOperation]: Start isEquivalent. First operand 208 states and 318 transitions. Second operand has 131 states, 131 states have (on average 1.4885496183206106) internal successors, (195), 130 states have internal predecessors, (195), 0 states have call successors, (0), 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:31:04,046 INFO L74 IsIncluded]: Start isIncluded. First operand 208 states and 318 transitions. Second operand has 131 states, 131 states have (on average 1.4885496183206106) internal successors, (195), 130 states have internal predecessors, (195), 0 states have call successors, (0), 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:31:04,047 INFO L87 Difference]: Start difference. First operand 208 states and 318 transitions. Second operand has 131 states, 131 states have (on average 1.4885496183206106) internal successors, (195), 130 states have internal predecessors, (195), 0 states have call successors, (0), 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:31:04,053 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:04,053 INFO L93 Difference]: Finished difference Result 208 states and 318 transitions. [2022-02-21 04:31:04,053 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 318 transitions. [2022-02-21 04:31:04,054 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:04,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:04,055 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 131 states have (on average 1.4885496183206106) internal successors, (195), 130 states have internal predecessors, (195), 0 states have call successors, (0), 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 208 states and 318 transitions. [2022-02-21 04:31:04,055 INFO L87 Difference]: Start difference. First operand has 131 states, 131 states have (on average 1.4885496183206106) internal successors, (195), 130 states have internal predecessors, (195), 0 states have call successors, (0), 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 208 states and 318 transitions. [2022-02-21 04:31:04,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:04,062 INFO L93 Difference]: Finished difference Result 208 states and 318 transitions. [2022-02-21 04:31:04,062 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 318 transitions. [2022-02-21 04:31:04,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:04,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:04,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:31:04,064 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:31:04,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 131 states have (on average 1.4885496183206106) internal successors, (195), 130 states have internal predecessors, (195), 0 states have call successors, (0), 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:31:04,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 195 transitions. [2022-02-21 04:31:04,068 INFO L704 BuchiCegarLoop]: Abstraction has 131 states and 195 transitions. [2022-02-21 04:31:04,068 INFO L587 BuchiCegarLoop]: Abstraction has 131 states and 195 transitions. [2022-02-21 04:31:04,068 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:31:04,068 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 195 transitions. [2022-02-21 04:31:04,069 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2022-02-21 04:31:04,070 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:31:04,070 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:31:04,073 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:31:04,073 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] [2022-02-21 04:31:04,074 INFO L791 eck$LassoCheckResult]: Stem: 1043#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~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;~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;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; 979#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, 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~ret40#1, main_#t~ret41#1, main_#t~post42#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~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~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_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 943#L255 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 926#L258-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 927#L268 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 947#L271-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 932#L281 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 933#L284-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 986#L294 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 966#L297-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 970#L307 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 988#L310-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 1018#L320 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 915#L323-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 1007#L333 assume ~id1~0 != ~id2~0; 973#L334 assume ~id1~0 != ~id3~0; 956#L335 assume ~id2~0 != ~id3~0; 957#L336 assume ~id1~0 >= 0; 1017#L337 assume ~id2~0 >= 0; 989#L338 assume ~id3~0 >= 0; 990#L339 assume 0 == ~r1~0; 1037#L340 assume 0 == ~r2~0; 1026#L341 assume 0 == ~r3~0; 974#L342 assume ~max1~0 == ~id1~0; 975#L343 assume ~max2~0 == ~id2~0; 967#L344 assume ~max3~0 == ~id3~0; 968#L345 assume 0 == ~st1~0; 983#L346 assume 0 == ~st2~0; 984#L347 assume 0 == ~st3~0; 1041#L348 assume 0 == ~nl1~0; 1021#L349 assume 0 == ~nl2~0; 1022#L350 assume 0 == ~nl3~0; 1009#L351 assume 0 == ~mode1~0 % 256; 1010#L352 assume 0 == ~mode2~0 % 256; 1033#L353 assume 0 == ~mode3~0 % 256; 1002#L354 assume 0 != ~newmax1~0 % 256; 976#L355 assume 0 != ~newmax2~0 % 256; 977#L356 assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; 1024#L333-1 init_#res#1 := init_~tmp___5~0#1; 937#L430 main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1; 938#L527 assume !(0 == main_~i2~0#1); 1029#L527-2 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 941#L541-2 [2022-02-21 04:31:04,075 INFO L793 eck$LassoCheckResult]: Loop: 941#L541-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 942#L79 assume !(0 != ~mode1~0 % 256); 995#L107 assume !(~r1~0 < 2); 992#L107-1 ~mode1~0 := 1; 940#L79-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 978#L130 assume !(0 != ~mode2~0 % 256); 935#L158 assume !(~r2~0 < 2); 930#L158-1 ~mode2~0 := 1; 998#L130-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 999#L181 assume !(0 != ~mode3~0 % 256); 1032#L209 assume !(~r3~0 < 2); 963#L209-1 ~mode3~0 := 1; 946#L181-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 985#L438 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 1000#L439 assume ~st1~0 + ~nl1~0 <= 1; 1001#L440 assume ~st2~0 + ~nl2~0 <= 1; 951#L441 assume ~st3~0 + ~nl3~0 <= 1; 952#L442 assume ~r1~0 >= 2; 958#L446 assume ~r1~0 < 2; 1031#L451 assume ~r1~0 >= 2; 917#L456 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 981#L438-1 check_#res#1 := check_~tmp~1#1; 982#L486 main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; 1034#L571 assume !(0 == assert_~arg#1 % 256); 1040#L566 assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; 941#L541-2 [2022-02-21 04:31:04,076 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:04,077 INFO L85 PathProgramCache]: Analyzing trace with hash -2116426971, now seen corresponding path program 1 times [2022-02-21 04:31:04,077 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:04,077 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496827167] [2022-02-21 04:31:04,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:04,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:04,136 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:31:04,137 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:31:04,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:31:04,219 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:31:04,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:04,220 INFO L85 PathProgramCache]: Analyzing trace with hash 630711638, now seen corresponding path program 2 times [2022-02-21 04:31:04,220 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:04,220 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2071907415] [2022-02-21 04:31:04,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:04,221 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:04,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:04,271 INFO L290 TraceCheckUtils]: 0: Hoare triple {1465#true} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {1465#true} is VALID [2022-02-21 04:31:04,271 INFO L290 TraceCheckUtils]: 1: Hoare triple {1465#true} assume !(0 != ~mode1~0 % 256); {1465#true} is VALID [2022-02-21 04:31:04,272 INFO L290 TraceCheckUtils]: 2: Hoare triple {1465#true} assume !(~r1~0 < 2); {1467#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:04,272 INFO L290 TraceCheckUtils]: 3: Hoare triple {1467#(not (<= ~r1~0 1))} ~mode1~0 := 1; {1467#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:04,273 INFO L290 TraceCheckUtils]: 4: Hoare triple {1467#(not (<= ~r1~0 1))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {1467#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:04,273 INFO L290 TraceCheckUtils]: 5: Hoare triple {1467#(not (<= ~r1~0 1))} assume !(0 != ~mode2~0 % 256); {1467#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:04,274 INFO L290 TraceCheckUtils]: 6: Hoare triple {1467#(not (<= ~r1~0 1))} assume !(~r2~0 < 2); {1467#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:04,275 INFO L290 TraceCheckUtils]: 7: Hoare triple {1467#(not (<= ~r1~0 1))} ~mode2~0 := 1; {1467#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:04,275 INFO L290 TraceCheckUtils]: 8: Hoare triple {1467#(not (<= ~r1~0 1))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {1467#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:04,275 INFO L290 TraceCheckUtils]: 9: Hoare triple {1467#(not (<= ~r1~0 1))} assume !(0 != ~mode3~0 % 256); {1467#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:04,276 INFO L290 TraceCheckUtils]: 10: Hoare triple {1467#(not (<= ~r1~0 1))} assume !(~r3~0 < 2); {1467#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:04,276 INFO L290 TraceCheckUtils]: 11: Hoare triple {1467#(not (<= ~r1~0 1))} ~mode3~0 := 1; {1467#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:04,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {1467#(not (<= ~r1~0 1))} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1467#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:04,277 INFO L290 TraceCheckUtils]: 13: Hoare triple {1467#(not (<= ~r1~0 1))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {1467#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:04,277 INFO L290 TraceCheckUtils]: 14: Hoare triple {1467#(not (<= ~r1~0 1))} assume ~st1~0 + ~nl1~0 <= 1; {1467#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:04,278 INFO L290 TraceCheckUtils]: 15: Hoare triple {1467#(not (<= ~r1~0 1))} assume ~st2~0 + ~nl2~0 <= 1; {1467#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:04,278 INFO L290 TraceCheckUtils]: 16: Hoare triple {1467#(not (<= ~r1~0 1))} assume ~st3~0 + ~nl3~0 <= 1; {1467#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:04,279 INFO L290 TraceCheckUtils]: 17: Hoare triple {1467#(not (<= ~r1~0 1))} assume ~r1~0 >= 2; {1467#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:04,279 INFO L290 TraceCheckUtils]: 18: Hoare triple {1467#(not (<= ~r1~0 1))} assume ~r1~0 < 2; {1466#false} is VALID [2022-02-21 04:31:04,279 INFO L290 TraceCheckUtils]: 19: Hoare triple {1466#false} assume ~r1~0 >= 2; {1466#false} is VALID [2022-02-21 04:31:04,279 INFO L290 TraceCheckUtils]: 20: Hoare triple {1466#false} assume ~r1~0 < 2;check_~tmp~1#1 := 1; {1466#false} is VALID [2022-02-21 04:31:04,280 INFO L290 TraceCheckUtils]: 21: Hoare triple {1466#false} check_#res#1 := check_~tmp~1#1; {1466#false} is VALID [2022-02-21 04:31:04,280 INFO L290 TraceCheckUtils]: 22: Hoare triple {1466#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {1466#false} is VALID [2022-02-21 04:31:04,280 INFO L290 TraceCheckUtils]: 23: Hoare triple {1466#false} assume !(0 == assert_~arg#1 % 256); {1466#false} is VALID [2022-02-21 04:31:04,283 INFO L290 TraceCheckUtils]: 24: Hoare triple {1466#false} assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; {1466#false} is VALID [2022-02-21 04:31:04,283 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:31:04,283 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:31:04,283 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2071907415] [2022-02-21 04:31:04,284 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2071907415] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:31:04,284 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:31:04,284 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:31:04,285 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [128008280] [2022-02-21 04:31:04,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:31:04,285 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:31:04,285 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:31:04,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:31:04,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:31:04,286 INFO L87 Difference]: Start difference. First operand 131 states and 195 transitions. cyclomatic complexity: 65 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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:31:04,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:04,495 INFO L93 Difference]: Finished difference Result 189 states and 282 transitions. [2022-02-21 04:31:04,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:31:04,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 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:31:04,515 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:31:04,516 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 189 states and 282 transitions. [2022-02-21 04:31:04,522 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 135 [2022-02-21 04:31:04,528 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 189 states to 189 states and 282 transitions. [2022-02-21 04:31:04,528 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 189 [2022-02-21 04:31:04,528 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 189 [2022-02-21 04:31:04,529 INFO L73 IsDeterministic]: Start isDeterministic. Operand 189 states and 282 transitions. [2022-02-21 04:31:04,532 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:31:04,532 INFO L681 BuchiCegarLoop]: Abstraction has 189 states and 282 transitions. [2022-02-21 04:31:04,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states and 282 transitions. [2022-02-21 04:31:04,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2022-02-21 04:31:04,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:31:04,550 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states and 282 transitions. Second operand has 189 states, 189 states have (on average 1.492063492063492) internal successors, (282), 188 states have internal predecessors, (282), 0 states have call successors, (0), 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:31:04,551 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states and 282 transitions. Second operand has 189 states, 189 states have (on average 1.492063492063492) internal successors, (282), 188 states have internal predecessors, (282), 0 states have call successors, (0), 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:31:04,551 INFO L87 Difference]: Start difference. First operand 189 states and 282 transitions. Second operand has 189 states, 189 states have (on average 1.492063492063492) internal successors, (282), 188 states have internal predecessors, (282), 0 states have call successors, (0), 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:31:04,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:04,556 INFO L93 Difference]: Finished difference Result 189 states and 282 transitions. [2022-02-21 04:31:04,556 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 282 transitions. [2022-02-21 04:31:04,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:04,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:04,557 INFO L74 IsIncluded]: Start isIncluded. First operand has 189 states, 189 states have (on average 1.492063492063492) internal successors, (282), 188 states have internal predecessors, (282), 0 states have call successors, (0), 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 189 states and 282 transitions. [2022-02-21 04:31:04,558 INFO L87 Difference]: Start difference. First operand has 189 states, 189 states have (on average 1.492063492063492) internal successors, (282), 188 states have internal predecessors, (282), 0 states have call successors, (0), 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 189 states and 282 transitions. [2022-02-21 04:31:04,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:04,564 INFO L93 Difference]: Finished difference Result 189 states and 282 transitions. [2022-02-21 04:31:04,564 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 282 transitions. [2022-02-21 04:31:04,564 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:04,564 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:04,564 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:31:04,565 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:31:04,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 189 states have (on average 1.492063492063492) internal successors, (282), 188 states have internal predecessors, (282), 0 states have call successors, (0), 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:31:04,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 282 transitions. [2022-02-21 04:31:04,570 INFO L704 BuchiCegarLoop]: Abstraction has 189 states and 282 transitions. [2022-02-21 04:31:04,570 INFO L587 BuchiCegarLoop]: Abstraction has 189 states and 282 transitions. [2022-02-21 04:31:04,572 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:31:04,572 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 189 states and 282 transitions. [2022-02-21 04:31:04,574 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 135 [2022-02-21 04:31:04,574 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:31:04,575 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:31:04,577 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:31:04,577 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] [2022-02-21 04:31:04,577 INFO L791 eck$LassoCheckResult]: Stem: 1791#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~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;~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;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; 1724#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, 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~ret40#1, main_#t~ret41#1, main_#t~post42#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~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~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_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 1687#L255 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 1670#L258-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 1671#L268 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 1695#L271-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 1676#L281 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 1677#L284-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 1731#L294 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 1709#L297-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 1713#L307 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 1733#L310-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 1763#L320 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 1661#L323-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 1752#L333 assume ~id1~0 != ~id2~0; 1716#L334 assume ~id1~0 != ~id3~0; 1700#L335 assume ~id2~0 != ~id3~0; 1701#L336 assume ~id1~0 >= 0; 1762#L337 assume ~id2~0 >= 0; 1734#L338 assume ~id3~0 >= 0; 1735#L339 assume 0 == ~r1~0; 1783#L340 assume 0 == ~r2~0; 1771#L341 assume 0 == ~r3~0; 1717#L342 assume ~max1~0 == ~id1~0; 1718#L343 assume ~max2~0 == ~id2~0; 1710#L344 assume ~max3~0 == ~id3~0; 1711#L345 assume 0 == ~st1~0; 1728#L346 assume 0 == ~st2~0; 1729#L347 assume 0 == ~st3~0; 1788#L348 assume 0 == ~nl1~0; 1766#L349 assume 0 == ~nl2~0; 1767#L350 assume 0 == ~nl3~0; 1755#L351 assume 0 == ~mode1~0 % 256; 1756#L352 assume 0 == ~mode2~0 % 256; 1778#L353 assume 0 == ~mode3~0 % 256; 1747#L354 assume 0 != ~newmax1~0 % 256; 1719#L355 assume 0 != ~newmax2~0 % 256; 1720#L356 assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; 1769#L333-1 init_#res#1 := init_~tmp___5~0#1; 1683#L430 main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1; 1684#L527 assume !(0 == main_~i2~0#1); 1776#L527-2 ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 1789#L541-2 [2022-02-21 04:31:04,578 INFO L793 eck$LassoCheckResult]: Loop: 1789#L541-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 1841#L79 assume !(0 != ~mode1~0 % 256); 1840#L107 assume ~r1~0 < 2; 1697#L108 assume !(0 != ~ep12~0 % 256); 1698#L108-1 assume !(0 != ~ep13~0 % 256); 1737#L107-1 ~mode1~0 := 1; 1835#L79-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 1834#L130 assume !(0 != ~mode2~0 % 256); 1820#L158 assume !(~r2~0 < 2); 1816#L158-1 ~mode2~0 := 1; 1813#L130-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 1810#L181 assume !(0 != ~mode3~0 % 256); 1806#L209 assume !(~r3~0 < 2); 1801#L209-1 ~mode3~0 := 1; 1799#L181-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 1798#L438 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 1797#L439 assume ~st1~0 + ~nl1~0 <= 1; 1796#L440 assume ~st2~0 + ~nl2~0 <= 1; 1795#L441 assume ~st3~0 + ~nl3~0 <= 1; 1794#L442 assume !(~r1~0 >= 2); 1722#L445 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 1723#L446 assume ~r1~0 < 2; 1793#L451 assume !(~r1~0 >= 2); 1657#L455 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; 1658#L456 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 1845#L438-1 check_#res#1 := check_~tmp~1#1; 1844#L486 main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; 1843#L571 assume !(0 == assert_~arg#1 % 256); 1842#L566 assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; 1789#L541-2 [2022-02-21 04:31:04,579 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:04,579 INFO L85 PathProgramCache]: Analyzing trace with hash -2116426971, now seen corresponding path program 2 times [2022-02-21 04:31:04,579 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:04,580 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780434075] [2022-02-21 04:31:04,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:04,580 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:04,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:31:04,615 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:31:04,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:31:04,648 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:31:04,648 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:04,648 INFO L85 PathProgramCache]: Analyzing trace with hash -1466264639, now seen corresponding path program 1 times [2022-02-21 04:31:04,649 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:04,649 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [243935997] [2022-02-21 04:31:04,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:04,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:04,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:31:04,664 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:31:04,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:31:04,674 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:31:04,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:04,675 INFO L85 PathProgramCache]: Analyzing trace with hash 1977070365, now seen corresponding path program 1 times [2022-02-21 04:31:04,675 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:04,675 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [783625571] [2022-02-21 04:31:04,675 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:04,675 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:04,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:04,721 INFO L290 TraceCheckUtils]: 0: Hoare triple {2231#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~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;~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;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {2231#true} is VALID [2022-02-21 04:31:04,722 INFO L290 TraceCheckUtils]: 1: Hoare triple {2231#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, 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~ret40#1, main_#t~ret41#1, main_#t~post42#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~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~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_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {2231#true} is VALID [2022-02-21 04:31:04,722 INFO L290 TraceCheckUtils]: 2: Hoare triple {2231#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {2231#true} is VALID [2022-02-21 04:31:04,722 INFO L290 TraceCheckUtils]: 3: Hoare triple {2231#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {2231#true} is VALID [2022-02-21 04:31:04,722 INFO L290 TraceCheckUtils]: 4: Hoare triple {2231#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {2231#true} is VALID [2022-02-21 04:31:04,723 INFO L290 TraceCheckUtils]: 5: Hoare triple {2231#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {2231#true} is VALID [2022-02-21 04:31:04,723 INFO L290 TraceCheckUtils]: 6: Hoare triple {2231#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {2231#true} is VALID [2022-02-21 04:31:04,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {2231#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {2231#true} is VALID [2022-02-21 04:31:04,723 INFO L290 TraceCheckUtils]: 8: Hoare triple {2231#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {2231#true} is VALID [2022-02-21 04:31:04,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {2231#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {2231#true} is VALID [2022-02-21 04:31:04,723 INFO L290 TraceCheckUtils]: 10: Hoare triple {2231#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {2231#true} is VALID [2022-02-21 04:31:04,724 INFO L290 TraceCheckUtils]: 11: Hoare triple {2231#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {2231#true} is VALID [2022-02-21 04:31:04,724 INFO L290 TraceCheckUtils]: 12: Hoare triple {2231#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {2231#true} is VALID [2022-02-21 04:31:04,724 INFO L290 TraceCheckUtils]: 13: Hoare triple {2231#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {2231#true} is VALID [2022-02-21 04:31:04,724 INFO L290 TraceCheckUtils]: 14: Hoare triple {2231#true} assume ~id1~0 != ~id2~0; {2231#true} is VALID [2022-02-21 04:31:04,724 INFO L290 TraceCheckUtils]: 15: Hoare triple {2231#true} assume ~id1~0 != ~id3~0; {2231#true} is VALID [2022-02-21 04:31:04,725 INFO L290 TraceCheckUtils]: 16: Hoare triple {2231#true} assume ~id2~0 != ~id3~0; {2231#true} is VALID [2022-02-21 04:31:04,725 INFO L290 TraceCheckUtils]: 17: Hoare triple {2231#true} assume ~id1~0 >= 0; {2231#true} is VALID [2022-02-21 04:31:04,725 INFO L290 TraceCheckUtils]: 18: Hoare triple {2231#true} assume ~id2~0 >= 0; {2231#true} is VALID [2022-02-21 04:31:04,725 INFO L290 TraceCheckUtils]: 19: Hoare triple {2231#true} assume ~id3~0 >= 0; {2231#true} is VALID [2022-02-21 04:31:04,725 INFO L290 TraceCheckUtils]: 20: Hoare triple {2231#true} assume 0 == ~r1~0; {2231#true} is VALID [2022-02-21 04:31:04,726 INFO L290 TraceCheckUtils]: 21: Hoare triple {2231#true} assume 0 == ~r2~0; {2233#(= ~r2~0 0)} is VALID [2022-02-21 04:31:04,726 INFO L290 TraceCheckUtils]: 22: Hoare triple {2233#(= ~r2~0 0)} assume 0 == ~r3~0; {2233#(= ~r2~0 0)} is VALID [2022-02-21 04:31:04,726 INFO L290 TraceCheckUtils]: 23: Hoare triple {2233#(= ~r2~0 0)} assume ~max1~0 == ~id1~0; {2233#(= ~r2~0 0)} is VALID [2022-02-21 04:31:04,727 INFO L290 TraceCheckUtils]: 24: Hoare triple {2233#(= ~r2~0 0)} assume ~max2~0 == ~id2~0; {2233#(= ~r2~0 0)} is VALID [2022-02-21 04:31:04,727 INFO L290 TraceCheckUtils]: 25: Hoare triple {2233#(= ~r2~0 0)} assume ~max3~0 == ~id3~0; {2233#(= ~r2~0 0)} is VALID [2022-02-21 04:31:04,727 INFO L290 TraceCheckUtils]: 26: Hoare triple {2233#(= ~r2~0 0)} assume 0 == ~st1~0; {2233#(= ~r2~0 0)} is VALID [2022-02-21 04:31:04,728 INFO L290 TraceCheckUtils]: 27: Hoare triple {2233#(= ~r2~0 0)} assume 0 == ~st2~0; {2233#(= ~r2~0 0)} is VALID [2022-02-21 04:31:04,728 INFO L290 TraceCheckUtils]: 28: Hoare triple {2233#(= ~r2~0 0)} assume 0 == ~st3~0; {2233#(= ~r2~0 0)} is VALID [2022-02-21 04:31:04,729 INFO L290 TraceCheckUtils]: 29: Hoare triple {2233#(= ~r2~0 0)} assume 0 == ~nl1~0; {2233#(= ~r2~0 0)} is VALID [2022-02-21 04:31:04,729 INFO L290 TraceCheckUtils]: 30: Hoare triple {2233#(= ~r2~0 0)} assume 0 == ~nl2~0; {2233#(= ~r2~0 0)} is VALID [2022-02-21 04:31:04,729 INFO L290 TraceCheckUtils]: 31: Hoare triple {2233#(= ~r2~0 0)} assume 0 == ~nl3~0; {2233#(= ~r2~0 0)} is VALID [2022-02-21 04:31:04,730 INFO L290 TraceCheckUtils]: 32: Hoare triple {2233#(= ~r2~0 0)} assume 0 == ~mode1~0 % 256; {2233#(= ~r2~0 0)} is VALID [2022-02-21 04:31:04,730 INFO L290 TraceCheckUtils]: 33: Hoare triple {2233#(= ~r2~0 0)} assume 0 == ~mode2~0 % 256; {2233#(= ~r2~0 0)} is VALID [2022-02-21 04:31:04,731 INFO L290 TraceCheckUtils]: 34: Hoare triple {2233#(= ~r2~0 0)} assume 0 == ~mode3~0 % 256; {2233#(= ~r2~0 0)} is VALID [2022-02-21 04:31:04,731 INFO L290 TraceCheckUtils]: 35: Hoare triple {2233#(= ~r2~0 0)} assume 0 != ~newmax1~0 % 256; {2233#(= ~r2~0 0)} is VALID [2022-02-21 04:31:04,731 INFO L290 TraceCheckUtils]: 36: Hoare triple {2233#(= ~r2~0 0)} assume 0 != ~newmax2~0 % 256; {2233#(= ~r2~0 0)} is VALID [2022-02-21 04:31:04,732 INFO L290 TraceCheckUtils]: 37: Hoare triple {2233#(= ~r2~0 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {2233#(= ~r2~0 0)} is VALID [2022-02-21 04:31:04,732 INFO L290 TraceCheckUtils]: 38: Hoare triple {2233#(= ~r2~0 0)} init_#res#1 := init_~tmp___5~0#1; {2233#(= ~r2~0 0)} is VALID [2022-02-21 04:31:04,732 INFO L290 TraceCheckUtils]: 39: Hoare triple {2233#(= ~r2~0 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1; {2233#(= ~r2~0 0)} is VALID [2022-02-21 04:31:04,733 INFO L290 TraceCheckUtils]: 40: Hoare triple {2233#(= ~r2~0 0)} assume !(0 == main_~i2~0#1); {2233#(= ~r2~0 0)} is VALID [2022-02-21 04:31:04,733 INFO L290 TraceCheckUtils]: 41: Hoare triple {2233#(= ~r2~0 0)} ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {2233#(= ~r2~0 0)} is VALID [2022-02-21 04:31:04,734 INFO L290 TraceCheckUtils]: 42: Hoare triple {2233#(= ~r2~0 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {2233#(= ~r2~0 0)} is VALID [2022-02-21 04:31:04,734 INFO L290 TraceCheckUtils]: 43: Hoare triple {2233#(= ~r2~0 0)} assume !(0 != ~mode1~0 % 256); {2233#(= ~r2~0 0)} is VALID [2022-02-21 04:31:04,734 INFO L290 TraceCheckUtils]: 44: Hoare triple {2233#(= ~r2~0 0)} assume ~r1~0 < 2; {2233#(= ~r2~0 0)} is VALID [2022-02-21 04:31:04,735 INFO L290 TraceCheckUtils]: 45: Hoare triple {2233#(= ~r2~0 0)} assume !(0 != ~ep12~0 % 256); {2233#(= ~r2~0 0)} is VALID [2022-02-21 04:31:04,735 INFO L290 TraceCheckUtils]: 46: Hoare triple {2233#(= ~r2~0 0)} assume !(0 != ~ep13~0 % 256); {2233#(= ~r2~0 0)} is VALID [2022-02-21 04:31:04,735 INFO L290 TraceCheckUtils]: 47: Hoare triple {2233#(= ~r2~0 0)} ~mode1~0 := 1; {2233#(= ~r2~0 0)} is VALID [2022-02-21 04:31:04,736 INFO L290 TraceCheckUtils]: 48: Hoare triple {2233#(= ~r2~0 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {2233#(= ~r2~0 0)} is VALID [2022-02-21 04:31:04,736 INFO L290 TraceCheckUtils]: 49: Hoare triple {2233#(= ~r2~0 0)} assume !(0 != ~mode2~0 % 256); {2233#(= ~r2~0 0)} is VALID [2022-02-21 04:31:04,737 INFO L290 TraceCheckUtils]: 50: Hoare triple {2233#(= ~r2~0 0)} assume !(~r2~0 < 2); {2232#false} is VALID [2022-02-21 04:31:04,737 INFO L290 TraceCheckUtils]: 51: Hoare triple {2232#false} ~mode2~0 := 1; {2232#false} is VALID [2022-02-21 04:31:04,737 INFO L290 TraceCheckUtils]: 52: Hoare triple {2232#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {2232#false} is VALID [2022-02-21 04:31:04,737 INFO L290 TraceCheckUtils]: 53: Hoare triple {2232#false} assume !(0 != ~mode3~0 % 256); {2232#false} is VALID [2022-02-21 04:31:04,737 INFO L290 TraceCheckUtils]: 54: Hoare triple {2232#false} assume !(~r3~0 < 2); {2232#false} is VALID [2022-02-21 04:31:04,737 INFO L290 TraceCheckUtils]: 55: Hoare triple {2232#false} ~mode3~0 := 1; {2232#false} is VALID [2022-02-21 04:31:04,738 INFO L290 TraceCheckUtils]: 56: Hoare triple {2232#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {2232#false} is VALID [2022-02-21 04:31:04,738 INFO L290 TraceCheckUtils]: 57: Hoare triple {2232#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {2232#false} is VALID [2022-02-21 04:31:04,738 INFO L290 TraceCheckUtils]: 58: Hoare triple {2232#false} assume ~st1~0 + ~nl1~0 <= 1; {2232#false} is VALID [2022-02-21 04:31:04,738 INFO L290 TraceCheckUtils]: 59: Hoare triple {2232#false} assume ~st2~0 + ~nl2~0 <= 1; {2232#false} is VALID [2022-02-21 04:31:04,738 INFO L290 TraceCheckUtils]: 60: Hoare triple {2232#false} assume ~st3~0 + ~nl3~0 <= 1; {2232#false} is VALID [2022-02-21 04:31:04,738 INFO L290 TraceCheckUtils]: 61: Hoare triple {2232#false} assume !(~r1~0 >= 2); {2232#false} is VALID [2022-02-21 04:31:04,739 INFO L290 TraceCheckUtils]: 62: Hoare triple {2232#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {2232#false} is VALID [2022-02-21 04:31:04,739 INFO L290 TraceCheckUtils]: 63: Hoare triple {2232#false} assume ~r1~0 < 2; {2232#false} is VALID [2022-02-21 04:31:04,739 INFO L290 TraceCheckUtils]: 64: Hoare triple {2232#false} assume !(~r1~0 >= 2); {2232#false} is VALID [2022-02-21 04:31:04,739 INFO L290 TraceCheckUtils]: 65: Hoare triple {2232#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {2232#false} is VALID [2022-02-21 04:31:04,739 INFO L290 TraceCheckUtils]: 66: Hoare triple {2232#false} assume ~r1~0 < 2;check_~tmp~1#1 := 1; {2232#false} is VALID [2022-02-21 04:31:04,740 INFO L290 TraceCheckUtils]: 67: Hoare triple {2232#false} check_#res#1 := check_~tmp~1#1; {2232#false} is VALID [2022-02-21 04:31:04,740 INFO L290 TraceCheckUtils]: 68: Hoare triple {2232#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {2232#false} is VALID [2022-02-21 04:31:04,740 INFO L290 TraceCheckUtils]: 69: Hoare triple {2232#false} assume !(0 == assert_~arg#1 % 256); {2232#false} is VALID [2022-02-21 04:31:04,740 INFO L290 TraceCheckUtils]: 70: Hoare triple {2232#false} assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; {2232#false} is VALID [2022-02-21 04:31:04,740 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:31:04,741 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:31:04,741 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [783625571] [2022-02-21 04:31:04,741 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [783625571] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:31:04,741 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:31:04,741 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:31:04,741 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [267042789] [2022-02-21 04:31:04,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:31:05,369 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:31:05,370 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:31:05,370 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:31:05,370 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:31:05,370 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:31:05,370 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:05,370 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:31:05,370 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:31:05,370 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2022-02-21 04:31:05,370 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:31:05,370 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:31:05,388 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:05,394 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:05,397 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:05,401 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:05,403 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:05,412 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:05,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:05,416 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:05,425 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:05,427 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:05,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:05,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:05,435 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:05,438 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:05,439 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:05,443 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:05,446 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:05,448 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:05,466 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:05,468 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:05,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:05,475 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:05,479 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:05,481 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:06,014 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:31:06,014 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:31:06,016 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:06,016 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:06,018 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:31:06,025 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:31:06,025 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:31:06,039 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:31:06,058 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:31:06,058 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~ep12~0=0} Honda state: {~ep12~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:31:06,087 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:31:06,088 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:06,088 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:06,089 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:31:06,097 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:31:06,097 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:31:06,098 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:31:06,120 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:31:06,120 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_node2_~newmax~1#1=0} Honda state: {ULTIMATE.start_node2_~newmax~1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:31:06,144 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:06,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:06,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:06,145 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:31:06,147 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:31:06,148 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:31:06,148 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:31:06,204 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:31:06,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:06,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:06,217 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:31:06,221 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:31:06,221 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:31:06,243 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:31:06,331 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:31:06,335 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Ended with exit code 0 [2022-02-21 04:31:06,335 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:31:06,335 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:31:06,337 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:31:06,337 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:31:06,337 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:31:06,337 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:06,337 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:31:06,337 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:31:06,337 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.3.1.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2022-02-21 04:31:06,337 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:31:06,337 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:31:06,341 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:06,351 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:06,354 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:06,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:06,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:06,371 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:06,374 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:06,380 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:06,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:06,386 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:06,389 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:06,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:06,398 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:06,400 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:06,405 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:06,408 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:06,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:06,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:06,422 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:06,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:06,431 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:06,433 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:06,436 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:06,458 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:07,006 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:31:07,010 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:31:07,011 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:07,011 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:07,013 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:31:07,015 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:31:07,016 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:31:07,023 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:07,023 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:07,024 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:07,024 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:07,024 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:07,025 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:07,025 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:07,027 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:07,042 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Ended with exit code 0 [2022-02-21 04:31:07,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:07,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:07,044 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:31:07,044 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:31:07,046 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:31:07,052 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:07,052 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:07,052 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:07,052 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:07,052 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:07,055 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:07,055 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:07,083 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:07,106 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Ended with exit code 0 [2022-02-21 04:31:07,106 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:07,106 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:07,107 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:31:07,108 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:31:07,109 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:31:07,116 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:07,116 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:07,116 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:07,116 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:07,116 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:07,118 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:07,118 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:07,120 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:07,138 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:31:07,138 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:07,138 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:07,139 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:31:07,140 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:31:07,141 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:31:07,147 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:07,148 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:07,148 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:07,148 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:07,148 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:07,149 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:07,149 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:07,163 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:07,186 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:31:07,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:07,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:07,187 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:31:07,189 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:31:07,190 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:31:07,197 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:07,197 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:07,197 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:07,197 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:07,197 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:07,199 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:07,199 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:07,203 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:07,228 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:31:07,229 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:07,229 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:07,230 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:31:07,240 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:31:07,248 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:07,248 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:07,248 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:07,248 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:07,248 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:07,250 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:07,250 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:07,251 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:31:07,267 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:07,293 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:31:07,294 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:07,294 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:07,295 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:31:07,296 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:31:07,298 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:31:07,306 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:07,306 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:07,306 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:07,306 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:07,306 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:07,307 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:07,307 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:07,320 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:31:07,324 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:31:07,324 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:31:07,326 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:07,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:07,328 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:31:07,334 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:31:07,334 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:31:07,334 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:31:07,335 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 11 Supporting invariants [] [2022-02-21 04:31:07,357 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:31:07,361 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:07,384 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:31:07,389 INFO L390 LassoCheck]: Loop: "assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0;" "assume !(0 != ~mode1~0 % 256);" "assume ~r1~0 < 2;" "assume !(0 != ~ep12~0 % 256);" "assume !(0 != ~ep13~0 % 256);" "~mode1~0 := 1;" "assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0;" "assume !(0 != ~mode2~0 % 256);" "assume !(~r2~0 < 2);" "~mode2~0 := 1;" "assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0;" "assume !(0 != ~mode3~0 % 256);" "assume !(~r3~0 < 2);" "~mode3~0 := 1;" "assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_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 <= 1;" "assume ~st1~0 + ~nl1~0 <= 1;" "assume ~st2~0 + ~nl2~0 <= 1;" "assume ~st3~0 + ~nl3~0 <= 1;" "assume !(~r1~0 >= 2);" "assume 0 == ~st1~0 + ~st2~0 + ~st3~0;" "assume ~r1~0 < 2;" "assume !(~r1~0 >= 2);" "assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0;" "assume ~r1~0 < 2;check_~tmp~1#1 := 1;" "check_#res#1 := check_~tmp~1#1;" "main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1;" [2022-02-21 04:31:07,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:07,445 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:07,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:07,497 INFO L263 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:31:07,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:07,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:31:07,605 INFO L290 TraceCheckUtils]: 0: Hoare triple {2234#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(43, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~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;~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;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {2234#unseeded} is VALID [2022-02-21 04:31:07,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {2234#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, 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~ret40#1, main_#t~ret41#1, main_#t~post42#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~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~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_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {2234#unseeded} is VALID [2022-02-21 04:31:07,607 INFO L290 TraceCheckUtils]: 2: Hoare triple {2234#unseeded} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {2234#unseeded} is VALID [2022-02-21 04:31:07,607 INFO L290 TraceCheckUtils]: 3: Hoare triple {2234#unseeded} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {2234#unseeded} is VALID [2022-02-21 04:31:07,608 INFO L290 TraceCheckUtils]: 4: Hoare triple {2234#unseeded} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {2234#unseeded} is VALID [2022-02-21 04:31:07,609 INFO L290 TraceCheckUtils]: 5: Hoare triple {2234#unseeded} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {2234#unseeded} is VALID [2022-02-21 04:31:07,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {2234#unseeded} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {2234#unseeded} is VALID [2022-02-21 04:31:07,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {2234#unseeded} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {2234#unseeded} is VALID [2022-02-21 04:31:07,610 INFO L290 TraceCheckUtils]: 8: Hoare triple {2234#unseeded} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {2234#unseeded} is VALID [2022-02-21 04:31:07,611 INFO L290 TraceCheckUtils]: 9: Hoare triple {2234#unseeded} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {2234#unseeded} is VALID [2022-02-21 04:31:07,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {2234#unseeded} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {2234#unseeded} is VALID [2022-02-21 04:31:07,612 INFO L290 TraceCheckUtils]: 11: Hoare triple {2234#unseeded} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {2234#unseeded} is VALID [2022-02-21 04:31:07,612 INFO L290 TraceCheckUtils]: 12: Hoare triple {2234#unseeded} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {2234#unseeded} is VALID [2022-02-21 04:31:07,612 INFO L290 TraceCheckUtils]: 13: Hoare triple {2234#unseeded} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {2234#unseeded} is VALID [2022-02-21 04:31:07,613 INFO L290 TraceCheckUtils]: 14: Hoare triple {2234#unseeded} assume ~id1~0 != ~id2~0; {2234#unseeded} is VALID [2022-02-21 04:31:07,613 INFO L290 TraceCheckUtils]: 15: Hoare triple {2234#unseeded} assume ~id1~0 != ~id3~0; {2234#unseeded} is VALID [2022-02-21 04:31:07,613 INFO L290 TraceCheckUtils]: 16: Hoare triple {2234#unseeded} assume ~id2~0 != ~id3~0; {2234#unseeded} is VALID [2022-02-21 04:31:07,614 INFO L290 TraceCheckUtils]: 17: Hoare triple {2234#unseeded} assume ~id1~0 >= 0; {2234#unseeded} is VALID [2022-02-21 04:31:07,614 INFO L290 TraceCheckUtils]: 18: Hoare triple {2234#unseeded} assume ~id2~0 >= 0; {2234#unseeded} is VALID [2022-02-21 04:31:07,614 INFO L290 TraceCheckUtils]: 19: Hoare triple {2234#unseeded} assume ~id3~0 >= 0; {2234#unseeded} is VALID [2022-02-21 04:31:07,615 INFO L290 TraceCheckUtils]: 20: Hoare triple {2234#unseeded} assume 0 == ~r1~0; {2234#unseeded} is VALID [2022-02-21 04:31:07,615 INFO L290 TraceCheckUtils]: 21: Hoare triple {2234#unseeded} assume 0 == ~r2~0; {2234#unseeded} is VALID [2022-02-21 04:31:07,615 INFO L290 TraceCheckUtils]: 22: Hoare triple {2234#unseeded} assume 0 == ~r3~0; {2234#unseeded} is VALID [2022-02-21 04:31:07,616 INFO L290 TraceCheckUtils]: 23: Hoare triple {2234#unseeded} assume ~max1~0 == ~id1~0; {2234#unseeded} is VALID [2022-02-21 04:31:07,616 INFO L290 TraceCheckUtils]: 24: Hoare triple {2234#unseeded} assume ~max2~0 == ~id2~0; {2234#unseeded} is VALID [2022-02-21 04:31:07,617 INFO L290 TraceCheckUtils]: 25: Hoare triple {2234#unseeded} assume ~max3~0 == ~id3~0; {2234#unseeded} is VALID [2022-02-21 04:31:07,617 INFO L290 TraceCheckUtils]: 26: Hoare triple {2234#unseeded} assume 0 == ~st1~0; {2234#unseeded} is VALID [2022-02-21 04:31:07,620 INFO L290 TraceCheckUtils]: 27: Hoare triple {2234#unseeded} assume 0 == ~st2~0; {2234#unseeded} is VALID [2022-02-21 04:31:07,621 INFO L290 TraceCheckUtils]: 28: Hoare triple {2234#unseeded} assume 0 == ~st3~0; {2234#unseeded} is VALID [2022-02-21 04:31:07,621 INFO L290 TraceCheckUtils]: 29: Hoare triple {2234#unseeded} assume 0 == ~nl1~0; {2234#unseeded} is VALID [2022-02-21 04:31:07,621 INFO L290 TraceCheckUtils]: 30: Hoare triple {2234#unseeded} assume 0 == ~nl2~0; {2234#unseeded} is VALID [2022-02-21 04:31:07,622 INFO L290 TraceCheckUtils]: 31: Hoare triple {2234#unseeded} assume 0 == ~nl3~0; {2234#unseeded} is VALID [2022-02-21 04:31:07,622 INFO L290 TraceCheckUtils]: 32: Hoare triple {2234#unseeded} assume 0 == ~mode1~0 % 256; {2234#unseeded} is VALID [2022-02-21 04:31:07,622 INFO L290 TraceCheckUtils]: 33: Hoare triple {2234#unseeded} assume 0 == ~mode2~0 % 256; {2234#unseeded} is VALID [2022-02-21 04:31:07,623 INFO L290 TraceCheckUtils]: 34: Hoare triple {2234#unseeded} assume 0 == ~mode3~0 % 256; {2234#unseeded} is VALID [2022-02-21 04:31:07,623 INFO L290 TraceCheckUtils]: 35: Hoare triple {2234#unseeded} assume 0 != ~newmax1~0 % 256; {2234#unseeded} is VALID [2022-02-21 04:31:07,623 INFO L290 TraceCheckUtils]: 36: Hoare triple {2234#unseeded} assume 0 != ~newmax2~0 % 256; {2234#unseeded} is VALID [2022-02-21 04:31:07,624 INFO L290 TraceCheckUtils]: 37: Hoare triple {2234#unseeded} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {2234#unseeded} is VALID [2022-02-21 04:31:07,624 INFO L290 TraceCheckUtils]: 38: Hoare triple {2234#unseeded} init_#res#1 := init_~tmp___5~0#1; {2234#unseeded} is VALID [2022-02-21 04:31:07,624 INFO L290 TraceCheckUtils]: 39: Hoare triple {2234#unseeded} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1; {2234#unseeded} is VALID [2022-02-21 04:31:07,625 INFO L290 TraceCheckUtils]: 40: Hoare triple {2234#unseeded} assume !(0 == main_~i2~0#1); {2234#unseeded} is VALID [2022-02-21 04:31:07,625 INFO L290 TraceCheckUtils]: 41: Hoare triple {2234#unseeded} ~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {2234#unseeded} is VALID [2022-02-21 04:31:07,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:07,648 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:31:07,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:07,661 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:31:07,950 INFO L290 TraceCheckUtils]: 0: Hoare triple {2237#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11))} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:07,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(0 != ~mode1~0 % 256); {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:07,952 INFO L290 TraceCheckUtils]: 2: Hoare triple {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume ~r1~0 < 2; {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:07,952 INFO L290 TraceCheckUtils]: 3: Hoare triple {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(0 != ~ep12~0 % 256); {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:07,953 INFO L290 TraceCheckUtils]: 4: Hoare triple {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(0 != ~ep13~0 % 256); {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:07,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} ~mode1~0 := 1; {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:07,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:07,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(0 != ~mode2~0 % 256); {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:07,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(~r2~0 < 2); {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:07,955 INFO L290 TraceCheckUtils]: 9: Hoare triple {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} ~mode2~0 := 1; {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:07,956 INFO L290 TraceCheckUtils]: 10: Hoare triple {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:07,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(0 != ~mode3~0 % 256); {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:07,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(~r3~0 < 2); {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:07,957 INFO L290 TraceCheckUtils]: 13: Hoare triple {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} ~mode3~0 := 1; {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:07,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_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;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:07,958 INFO L290 TraceCheckUtils]: 15: Hoare triple {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:07,959 INFO L290 TraceCheckUtils]: 16: Hoare triple {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume ~st1~0 + ~nl1~0 <= 1; {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:07,959 INFO L290 TraceCheckUtils]: 17: Hoare triple {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume ~st2~0 + ~nl2~0 <= 1; {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:07,960 INFO L290 TraceCheckUtils]: 18: Hoare triple {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume ~st3~0 + ~nl3~0 <= 1; {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:07,960 INFO L290 TraceCheckUtils]: 19: Hoare triple {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(~r1~0 >= 2); {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:07,960 INFO L290 TraceCheckUtils]: 20: Hoare triple {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:07,966 INFO L290 TraceCheckUtils]: 21: Hoare triple {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume ~r1~0 < 2; {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:07,966 INFO L290 TraceCheckUtils]: 22: Hoare triple {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(~r1~0 >= 2); {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:07,967 INFO L290 TraceCheckUtils]: 23: Hoare triple {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:07,967 INFO L290 TraceCheckUtils]: 24: Hoare triple {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume ~r1~0 < 2;check_~tmp~1#1 := 1; {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:07,968 INFO L290 TraceCheckUtils]: 25: Hoare triple {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} check_#res#1 := check_~tmp~1#1; {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:07,968 INFO L290 TraceCheckUtils]: 26: Hoare triple {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#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; {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:07,969 INFO L290 TraceCheckUtils]: 27: Hoare triple {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(0 == assert_~arg#1 % 256); {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:07,970 INFO L290 TraceCheckUtils]: 28: Hoare triple {2375#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; {2247#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11))))} is VALID [2022-02-21 04:31:07,970 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:31:07,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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:31:07,993 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:31:07,995 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 29 letters. [2022-02-21 04:31:07,996 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:07,999 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:31:07,999 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 189 states and 282 transitions. cyclomatic complexity: 94 Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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:31:08,158 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:31:08,266 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 189 states and 282 transitions. cyclomatic complexity: 94. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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 323 states and 492 transitions. Complement of second has 4 states. [2022-02-21 04:31:08,267 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:31:08,267 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:31:08,267 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 189 states and 282 transitions. cyclomatic complexity: 94 [2022-02-21 04:31:08,267 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:31:08,267 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:31:08,268 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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:31:08,272 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:31:08,273 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:31:08,273 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:31:08,273 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 323 states and 492 transitions. [2022-02-21 04:31:08,275 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:31:08,275 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:31:08,277 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 189 states and 282 transitions. cyclomatic complexity: 94 [2022-02-21 04:31:08,328 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 135 examples of accepted words. [2022-02-21 04:31:08,328 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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:31:08,331 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:31:08,331 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:31:08,331 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 323 states and 492 transitions. cyclomatic complexity: 170 [2022-02-21 04:31:08,332 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 323 states and 492 transitions. cyclomatic complexity: 170 [2022-02-21 04:31:08,332 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:31:08,332 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:31:08,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 42 letters. Loop has 29 letters. [2022-02-21 04:31:08,332 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,332 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 29 letters. [2022-02-21 04:31:08,333 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,333 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 42 letters. Loop has 29 letters. [2022-02-21 04:31:08,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:31:08,334 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,334 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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:31:08,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:31:08,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 323 letters. Loop has 323 letters. [2022-02-21 04:31:08,335 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,335 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 323 letters. Loop has 323 letters. [2022-02-21 04:31:08,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 323 letters. Loop has 323 letters. [2022-02-21 04:31:08,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 189 letters. Loop has 189 letters. [2022-02-21 04:31:08,336 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 189 letters. Loop has 189 letters. [2022-02-21 04:31:08,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 189 letters. Loop has 189 letters. [2022-02-21 04:31:08,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:31:08,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,337 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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:31:08,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:31:08,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 45 letters. Loop has 27 letters. [2022-02-21 04:31:08,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,338 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 45 letters. Loop has 27 letters. [2022-02-21 04:31:08,338 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 45 letters. Loop has 27 letters. [2022-02-21 04:31:08,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 64 letters. Loop has 29 letters. [2022-02-21 04:31:08,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 29 letters. [2022-02-21 04:31:08,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 64 letters. Loop has 29 letters. [2022-02-21 04:31:08,340 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,340 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 29 letters. [2022-02-21 04:31:08,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 29 letters. [2022-02-21 04:31:08,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,341 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 61 letters. Loop has 29 letters. [2022-02-21 04:31:08,341 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 29 letters. [2022-02-21 04:31:08,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 29 letters. [2022-02-21 04:31:08,342 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,342 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 29 letters. [2022-02-21 04:31:08,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 29 letters. [2022-02-21 04:31:08,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,343 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 29 letters. [2022-02-21 04:31:08,343 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 59 letters. Loop has 29 letters. [2022-02-21 04:31:08,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 29 letters. [2022-02-21 04:31:08,344 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,344 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 29 letters. [2022-02-21 04:31:08,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 29 letters. [2022-02-21 04:31:08,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,345 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 29 letters. [2022-02-21 04:31:08,345 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 29 letters. [2022-02-21 04:31:08,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 57 letters. Loop has 29 letters. [2022-02-21 04:31:08,346 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,346 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 29 letters. [2022-02-21 04:31:08,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 29 letters. [2022-02-21 04:31:08,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 56 letters. Loop has 29 letters. [2022-02-21 04:31:08,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:31:08,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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:31:08,348 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,348 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:31:08,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 29 letters. [2022-02-21 04:31:08,349 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,349 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 29 letters. [2022-02-21 04:31:08,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 55 letters. Loop has 29 letters. [2022-02-21 04:31:08,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,350 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 34 letters. [2022-02-21 04:31:08,350 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 34 letters. [2022-02-21 04:31:08,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 59 letters. Loop has 34 letters. [2022-02-21 04:31:08,351 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,351 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 32 letters. [2022-02-21 04:31:08,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 32 letters. [2022-02-21 04:31:08,352 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,352 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 57 letters. Loop has 32 letters. [2022-02-21 04:31:08,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 34 letters. [2022-02-21 04:31:08,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 34 letters. [2022-02-21 04:31:08,353 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,353 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 34 letters. [2022-02-21 04:31:08,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 31 letters. [2022-02-21 04:31:08,354 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,354 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 31 letters. [2022-02-21 04:31:08,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 56 letters. Loop has 31 letters. [2022-02-21 04:31:08,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,355 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 29 letters. [2022-02-21 04:31:08,355 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 29 letters. [2022-02-21 04:31:08,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 54 letters. Loop has 29 letters. [2022-02-21 04:31:08,356 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,356 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 31 letters. [2022-02-21 04:31:08,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 31 letters. [2022-02-21 04:31:08,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,357 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 55 letters. Loop has 31 letters. [2022-02-21 04:31:08,357 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 33 letters. [2022-02-21 04:31:08,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 33 letters. [2022-02-21 04:31:08,358 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,358 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 33 letters. [2022-02-21 04:31:08,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 32 letters. [2022-02-21 04:31:08,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,359 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 32 letters. [2022-02-21 04:31:08,359 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 57 letters. Loop has 32 letters. [2022-02-21 04:31:08,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 29 letters. [2022-02-21 04:31:08,360 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,360 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 29 letters. [2022-02-21 04:31:08,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 53 letters. Loop has 29 letters. [2022-02-21 04:31:08,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,361 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:31:08,361 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:31:08,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:31:08,362 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,362 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 32 letters. [2022-02-21 04:31:08,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 32 letters. [2022-02-21 04:31:08,363 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,363 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 56 letters. Loop has 32 letters. [2022-02-21 04:31:08,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 52 letters. Loop has 29 letters. [2022-02-21 04:31:08,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 29 letters. [2022-02-21 04:31:08,364 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,364 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 52 letters. Loop has 29 letters. [2022-02-21 04:31:08,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 32 letters. [2022-02-21 04:31:08,365 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,365 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 32 letters. [2022-02-21 04:31:08,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 55 letters. Loop has 32 letters. [2022-02-21 04:31:08,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 33 letters. [2022-02-21 04:31:08,366 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,366 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 33 letters. [2022-02-21 04:31:08,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 56 letters. Loop has 33 letters. [2022-02-21 04:31:08,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,367 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 51 letters. Loop has 29 letters. [2022-02-21 04:31:08,367 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 29 letters. [2022-02-21 04:31:08,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 51 letters. Loop has 29 letters. [2022-02-21 04:31:08,368 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,368 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:31:08,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:31:08,369 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,369 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:31:08,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 33 letters. [2022-02-21 04:31:08,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 33 letters. [2022-02-21 04:31:08,370 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,370 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 54 letters. Loop has 33 letters. [2022-02-21 04:31:08,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 32 letters. [2022-02-21 04:31:08,371 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,371 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 32 letters. [2022-02-21 04:31:08,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 53 letters. Loop has 32 letters. [2022-02-21 04:31:08,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,372 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 50 letters. Loop has 29 letters. [2022-02-21 04:31:08,372 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 29 letters. [2022-02-21 04:31:08,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 50 letters. Loop has 29 letters. [2022-02-21 04:31:08,373 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,373 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 51 letters. Loop has 31 letters. [2022-02-21 04:31:08,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 31 letters. [2022-02-21 04:31:08,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 51 letters. Loop has 31 letters. [2022-02-21 04:31:08,374 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,374 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 34 letters. [2022-02-21 04:31:08,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 34 letters. [2022-02-21 04:31:08,375 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,375 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 55 letters. Loop has 34 letters. [2022-02-21 04:31:08,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 32 letters. [2022-02-21 04:31:08,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 32 letters. [2022-02-21 04:31:08,376 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,376 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 53 letters. Loop has 32 letters. [2022-02-21 04:31:08,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 34 letters. [2022-02-21 04:31:08,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 34 letters. [2022-02-21 04:31:08,377 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,377 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 54 letters. Loop has 34 letters. [2022-02-21 04:31:08,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 52 letters. Loop has 31 letters. [2022-02-21 04:31:08,378 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,378 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 31 letters. [2022-02-21 04:31:08,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 52 letters. Loop has 31 letters. [2022-02-21 04:31:08,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 52 letters. Loop has 32 letters. [2022-02-21 04:31:08,379 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,379 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 32 letters. [2022-02-21 04:31:08,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 52 letters. Loop has 32 letters. [2022-02-21 04:31:08,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,380 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 34 letters. [2022-02-21 04:31:08,380 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 34 letters. [2022-02-21 04:31:08,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 54 letters. Loop has 34 letters. [2022-02-21 04:31:08,381 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,381 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 52 letters. Loop has 32 letters. [2022-02-21 04:31:08,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 32 letters. [2022-02-21 04:31:08,382 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,382 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 52 letters. Loop has 32 letters. [2022-02-21 04:31:08,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 34 letters. [2022-02-21 04:31:08,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 34 letters. [2022-02-21 04:31:08,383 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,383 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 53 letters. Loop has 34 letters. [2022-02-21 04:31:08,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 52 letters. Loop has 33 letters. [2022-02-21 04:31:08,384 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,384 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 33 letters. [2022-02-21 04:31:08,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 52 letters. Loop has 33 letters. [2022-02-21 04:31:08,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 51 letters. Loop has 32 letters. [2022-02-21 04:31:08,385 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 32 letters. [2022-02-21 04:31:08,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 51 letters. Loop has 32 letters. [2022-02-21 04:31:08,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,386 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 51 letters. Loop has 33 letters. [2022-02-21 04:31:08,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 33 letters. [2022-02-21 04:31:08,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 51 letters. Loop has 33 letters. [2022-02-21 04:31:08,387 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,387 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 50 letters. Loop has 32 letters. [2022-02-21 04:31:08,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 32 letters. [2022-02-21 04:31:08,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,388 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 50 letters. Loop has 32 letters. [2022-02-21 04:31:08,388 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 49 letters. Loop has 29 letters. [2022-02-21 04:31:08,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 49 letters. Loop has 29 letters. [2022-02-21 04:31:08,389 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,389 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 49 letters. Loop has 29 letters. [2022-02-21 04:31:08,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 48 letters. Loop has 29 letters. [2022-02-21 04:31:08,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,390 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 29 letters. [2022-02-21 04:31:08,390 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 48 letters. Loop has 29 letters. [2022-02-21 04:31:08,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 33 letters. [2022-02-21 04:31:08,391 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,391 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 33 letters. [2022-02-21 04:31:08,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 55 letters. Loop has 33 letters. [2022-02-21 04:31:08,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,392 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 34 letters. [2022-02-21 04:31:08,392 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 34 letters. [2022-02-21 04:31:08,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 34 letters. [2022-02-21 04:31:08,393 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,393 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 32 letters. [2022-02-21 04:31:08,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 32 letters. [2022-02-21 04:31:08,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 56 letters. Loop has 32 letters. [2022-02-21 04:31:08,394 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,394 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 34 letters. [2022-02-21 04:31:08,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 34 letters. [2022-02-21 04:31:08,395 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,395 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 57 letters. Loop has 34 letters. [2022-02-21 04:31:08,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 44 letters. Loop has 29 letters. [2022-02-21 04:31:08,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 44 letters. Loop has 29 letters. [2022-02-21 04:31:08,396 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,396 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 44 letters. Loop has 29 letters. [2022-02-21 04:31:08,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 43 letters. Loop has 29 letters. [2022-02-21 04:31:08,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 43 letters. Loop has 29 letters. [2022-02-21 04:31:08,397 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,397 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 43 letters. Loop has 29 letters. [2022-02-21 04:31:08,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 70 letters. Loop has 29 letters. [2022-02-21 04:31:08,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,398 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 29 letters. [2022-02-21 04:31:08,398 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 70 letters. Loop has 29 letters. [2022-02-21 04:31:08,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 69 letters. Loop has 29 letters. [2022-02-21 04:31:08,399 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,399 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 29 letters. [2022-02-21 04:31:08,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 69 letters. Loop has 29 letters. [2022-02-21 04:31:08,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,400 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 68 letters. Loop has 29 letters. [2022-02-21 04:31:08,400 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 29 letters. [2022-02-21 04:31:08,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 68 letters. Loop has 29 letters. [2022-02-21 04:31:08,401 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,401 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 67 letters. Loop has 29 letters. [2022-02-21 04:31:08,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 29 letters. [2022-02-21 04:31:08,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,402 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 67 letters. Loop has 29 letters. [2022-02-21 04:31:08,402 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 65 letters. Loop has 29 letters. [2022-02-21 04:31:08,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 29 letters. [2022-02-21 04:31:08,403 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,403 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 65 letters. Loop has 29 letters. [2022-02-21 04:31:08,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 66 letters. Loop has 29 letters. [2022-02-21 04:31:08,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 29 letters. [2022-02-21 04:31:08,404 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,404 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 66 letters. Loop has 29 letters. [2022-02-21 04:31:08,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 52 letters. Loop has 32 letters. [2022-02-21 04:31:08,405 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,405 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 32 letters. [2022-02-21 04:31:08,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 52 letters. Loop has 32 letters. [2022-02-21 04:31:08,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 50 letters. Loop has 29 letters. [2022-02-21 04:31:08,406 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,406 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 29 letters. [2022-02-21 04:31:08,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 50 letters. Loop has 29 letters. [2022-02-21 04:31:08,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,407 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 45 letters. Loop has 30 letters. [2022-02-21 04:31:08,407 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 45 letters. Loop has 30 letters. [2022-02-21 04:31:08,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 45 letters. Loop has 30 letters. [2022-02-21 04:31:08,408 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,408 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 46 letters. Loop has 31 letters. [2022-02-21 04:31:08,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 46 letters. Loop has 31 letters. [2022-02-21 04:31:08,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 46 letters. Loop has 31 letters. [2022-02-21 04:31:08,409 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,409 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 46 letters. Loop has 30 letters. [2022-02-21 04:31:08,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 46 letters. Loop has 30 letters. [2022-02-21 04:31:08,410 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,410 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 46 letters. Loop has 30 letters. [2022-02-21 04:31:08,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 29 letters. [2022-02-21 04:31:08,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 29 letters. [2022-02-21 04:31:08,411 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,411 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 53 letters. Loop has 29 letters. [2022-02-21 04:31:08,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 29 letters. [2022-02-21 04:31:08,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,412 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 29 letters. [2022-02-21 04:31:08,412 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 54 letters. Loop has 29 letters. [2022-02-21 04:31:08,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 30 letters. [2022-02-21 04:31:08,413 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,413 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 30 letters. [2022-02-21 04:31:08,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 54 letters. Loop has 30 letters. [2022-02-21 04:31:08,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 51 letters. Loop has 30 letters. [2022-02-21 04:31:08,414 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,414 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 30 letters. [2022-02-21 04:31:08,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 51 letters. Loop has 30 letters. [2022-02-21 04:31:08,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,415 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 52 letters. Loop has 32 letters. [2022-02-21 04:31:08,415 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 32 letters. [2022-02-21 04:31:08,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 52 letters. Loop has 32 letters. [2022-02-21 04:31:08,416 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,416 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 49 letters. Loop has 27 letters. [2022-02-21 04:31:08,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 49 letters. Loop has 27 letters. [2022-02-21 04:31:08,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 49 letters. Loop has 27 letters. [2022-02-21 04:31:08,417 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,417 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 51 letters. Loop has 32 letters. [2022-02-21 04:31:08,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 32 letters. [2022-02-21 04:31:08,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,418 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 51 letters. Loop has 32 letters. [2022-02-21 04:31:08,418 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 48 letters. Loop has 27 letters. [2022-02-21 04:31:08,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 27 letters. [2022-02-21 04:31:08,419 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,419 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 48 letters. Loop has 27 letters. [2022-02-21 04:31:08,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 49 letters. Loop has 29 letters. [2022-02-21 04:31:08,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 49 letters. Loop has 29 letters. [2022-02-21 04:31:08,420 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,420 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 49 letters. Loop has 29 letters. [2022-02-21 04:31:08,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 49 letters. Loop has 31 letters. [2022-02-21 04:31:08,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,421 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 49 letters. Loop has 31 letters. [2022-02-21 04:31:08,421 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 49 letters. Loop has 31 letters. [2022-02-21 04:31:08,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 46 letters. Loop has 27 letters. [2022-02-21 04:31:08,422 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,422 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 46 letters. Loop has 27 letters. [2022-02-21 04:31:08,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 46 letters. Loop has 27 letters. [2022-02-21 04:31:08,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 69 letters. Loop has 27 letters. [2022-02-21 04:31:08,423 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,423 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 27 letters. [2022-02-21 04:31:08,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 69 letters. Loop has 27 letters. [2022-02-21 04:31:08,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,424 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 70 letters. Loop has 27 letters. [2022-02-21 04:31:08,424 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 27 letters. [2022-02-21 04:31:08,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 70 letters. Loop has 27 letters. [2022-02-21 04:31:08,425 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,425 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 30 letters. [2022-02-21 04:31:08,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 30 letters. [2022-02-21 04:31:08,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,426 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 56 letters. Loop has 30 letters. [2022-02-21 04:31:08,426 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 27 letters. [2022-02-21 04:31:08,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 27 letters. [2022-02-21 04:31:08,427 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,427 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 54 letters. Loop has 27 letters. [2022-02-21 04:31:08,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 32 letters. [2022-02-21 04:31:08,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,428 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 32 letters. [2022-02-21 04:31:08,428 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 56 letters. Loop has 32 letters. [2022-02-21 04:31:08,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,429 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 32 letters. [2022-02-21 04:31:08,429 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 32 letters. [2022-02-21 04:31:08,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 57 letters. Loop has 32 letters. [2022-02-21 04:31:08,430 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,430 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 27 letters. [2022-02-21 04:31:08,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 27 letters. [2022-02-21 04:31:08,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,431 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 27 letters. [2022-02-21 04:31:08,431 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 27 letters. [2022-02-21 04:31:08,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 27 letters. [2022-02-21 04:31:08,432 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,432 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 59 letters. Loop has 27 letters. [2022-02-21 04:31:08,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 45 letters. Loop has 29 letters. [2022-02-21 04:31:08,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 45 letters. Loop has 29 letters. [2022-02-21 04:31:08,433 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,433 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 45 letters. Loop has 29 letters. [2022-02-21 04:31:08,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 46 letters. Loop has 29 letters. [2022-02-21 04:31:08,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,434 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 46 letters. Loop has 29 letters. [2022-02-21 04:31:08,434 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 46 letters. Loop has 29 letters. [2022-02-21 04:31:08,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 46 letters. Loop has 30 letters. [2022-02-21 04:31:08,435 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,435 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 46 letters. Loop has 30 letters. [2022-02-21 04:31:08,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 46 letters. Loop has 30 letters. [2022-02-21 04:31:08,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 27 letters. [2022-02-21 04:31:08,436 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,436 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 27 letters. [2022-02-21 04:31:08,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 27 letters. [2022-02-21 04:31:08,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,437 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 52 letters. Loop has 30 letters. [2022-02-21 04:31:08,437 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 30 letters. [2022-02-21 04:31:08,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 52 letters. Loop has 30 letters. [2022-02-21 04:31:08,438 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,438 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 30 letters. [2022-02-21 04:31:08,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 30 letters. [2022-02-21 04:31:08,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 53 letters. Loop has 30 letters. [2022-02-21 04:31:08,439 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,439 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 31 letters. [2022-02-21 04:31:08,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 31 letters. [2022-02-21 04:31:08,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,440 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 53 letters. Loop has 31 letters. [2022-02-21 04:31:08,440 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 27 letters. [2022-02-21 04:31:08,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 27 letters. [2022-02-21 04:31:08,441 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,441 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 53 letters. Loop has 27 letters. [2022-02-21 04:31:08,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 30 letters. [2022-02-21 04:31:08,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 30 letters. [2022-02-21 04:31:08,442 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,442 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 55 letters. Loop has 30 letters. [2022-02-21 04:31:08,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 47 letters. Loop has 27 letters. [2022-02-21 04:31:08,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,443 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 47 letters. Loop has 27 letters. [2022-02-21 04:31:08,443 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 47 letters. Loop has 27 letters. [2022-02-21 04:31:08,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 29 letters. [2022-02-21 04:31:08,444 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,444 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 29 letters. [2022-02-21 04:31:08,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 62 letters. Loop has 29 letters. [2022-02-21 04:31:08,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,445 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 63 letters. Loop has 29 letters. [2022-02-21 04:31:08,445 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 29 letters. [2022-02-21 04:31:08,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 63 letters. Loop has 29 letters. [2022-02-21 04:31:08,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,446 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 48 letters. Loop has 32 letters. [2022-02-21 04:31:08,446 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 32 letters. [2022-02-21 04:31:08,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 48 letters. Loop has 32 letters. [2022-02-21 04:31:08,447 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,447 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 65 letters. Loop has 27 letters. [2022-02-21 04:31:08,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 27 letters. [2022-02-21 04:31:08,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,448 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 65 letters. Loop has 27 letters. [2022-02-21 04:31:08,448 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 66 letters. Loop has 27 letters. [2022-02-21 04:31:08,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 27 letters. [2022-02-21 04:31:08,449 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,449 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 66 letters. Loop has 27 letters. [2022-02-21 04:31:08,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 27 letters. [2022-02-21 04:31:08,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 27 letters. [2022-02-21 04:31:08,450 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 55 letters. Loop has 27 letters. [2022-02-21 04:31:08,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 47 letters. Loop has 30 letters. [2022-02-21 04:31:08,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 47 letters. Loop has 30 letters. [2022-02-21 04:31:08,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,451 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 47 letters. Loop has 30 letters. [2022-02-21 04:31:08,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 47 letters. Loop has 29 letters. [2022-02-21 04:31:08,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,452 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 47 letters. Loop has 29 letters. [2022-02-21 04:31:08,452 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 47 letters. Loop has 29 letters. [2022-02-21 04:31:08,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 48 letters. Loop has 32 letters. [2022-02-21 04:31:08,453 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,453 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 32 letters. [2022-02-21 04:31:08,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 48 letters. Loop has 32 letters. [2022-02-21 04:31:08,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 44 letters. Loop has 30 letters. [2022-02-21 04:31:08,454 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,454 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 44 letters. Loop has 30 letters. [2022-02-21 04:31:08,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 44 letters. Loop has 30 letters. [2022-02-21 04:31:08,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,455 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 71 letters. Loop has 27 letters. [2022-02-21 04:31:08,455 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 27 letters. [2022-02-21 04:31:08,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 71 letters. Loop has 27 letters. [2022-02-21 04:31:08,456 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,456 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 50 letters. Loop has 30 letters. [2022-02-21 04:31:08,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 30 letters. [2022-02-21 04:31:08,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 50 letters. Loop has 30 letters. [2022-02-21 04:31:08,457 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,457 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 51 letters. Loop has 30 letters. [2022-02-21 04:31:08,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 30 letters. [2022-02-21 04:31:08,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,458 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 51 letters. Loop has 30 letters. [2022-02-21 04:31:08,458 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 50 letters. Loop has 27 letters. [2022-02-21 04:31:08,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 27 letters. [2022-02-21 04:31:08,459 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,459 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 50 letters. Loop has 27 letters. [2022-02-21 04:31:08,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 51 letters. Loop has 27 letters. [2022-02-21 04:31:08,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 27 letters. [2022-02-21 04:31:08,460 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,460 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 51 letters. Loop has 27 letters. [2022-02-21 04:31:08,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 27 letters. [2022-02-21 04:31:08,461 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,461 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 27 letters. [2022-02-21 04:31:08,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 56 letters. Loop has 27 letters. [2022-02-21 04:31:08,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 27 letters. [2022-02-21 04:31:08,462 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,462 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 27 letters. [2022-02-21 04:31:08,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 57 letters. Loop has 27 letters. [2022-02-21 04:31:08,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,463 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 48 letters. Loop has 30 letters. [2022-02-21 04:31:08,463 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 30 letters. [2022-02-21 04:31:08,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 48 letters. Loop has 30 letters. [2022-02-21 04:31:08,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,464 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 49 letters. Loop has 32 letters. [2022-02-21 04:31:08,464 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 49 letters. Loop has 32 letters. [2022-02-21 04:31:08,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 49 letters. Loop has 32 letters. [2022-02-21 04:31:08,465 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,465 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 64 letters. Loop has 27 letters. [2022-02-21 04:31:08,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 27 letters. [2022-02-21 04:31:08,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 64 letters. Loop has 27 letters. [2022-02-21 04:31:08,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 31 letters. [2022-02-21 04:31:08,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 31 letters. [2022-02-21 04:31:08,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 56 letters. Loop has 31 letters. [2022-02-21 04:31:08,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 47 letters. Loop has 32 letters. [2022-02-21 04:31:08,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 47 letters. Loop has 32 letters. [2022-02-21 04:31:08,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 47 letters. Loop has 32 letters. [2022-02-21 04:31:08,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 47 letters. Loop has 30 letters. [2022-02-21 04:31:08,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 47 letters. Loop has 30 letters. [2022-02-21 04:31:08,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 47 letters. Loop has 30 letters. [2022-02-21 04:31:08,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 32 letters. [2022-02-21 04:31:08,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 32 letters. [2022-02-21 04:31:08,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 55 letters. Loop has 32 letters. [2022-02-21 04:31:08,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 32 letters. [2022-02-21 04:31:08,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 32 letters. [2022-02-21 04:31:08,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 56 letters. Loop has 32 letters. [2022-02-21 04:31:08,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 50 letters. Loop has 30 letters. [2022-02-21 04:31:08,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 30 letters. [2022-02-21 04:31:08,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 50 letters. Loop has 30 letters. [2022-02-21 04:31:08,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 30 letters. [2022-02-21 04:31:08,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 30 letters. [2022-02-21 04:31:08,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 54 letters. Loop has 30 letters. [2022-02-21 04:31:08,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 30 letters. [2022-02-21 04:31:08,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 30 letters. [2022-02-21 04:31:08,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 55 letters. Loop has 30 letters. [2022-02-21 04:31:08,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 32 letters. [2022-02-21 04:31:08,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 32 letters. [2022-02-21 04:31:08,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 53 letters. Loop has 32 letters. [2022-02-21 04:31:08,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 31 letters. [2022-02-21 04:31:08,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 31 letters. [2022-02-21 04:31:08,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 54 letters. Loop has 31 letters. [2022-02-21 04:31:08,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 52 letters. Loop has 30 letters. [2022-02-21 04:31:08,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 30 letters. [2022-02-21 04:31:08,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 52 letters. Loop has 30 letters. [2022-02-21 04:31:08,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 52 letters. Loop has 31 letters. [2022-02-21 04:31:08,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 31 letters. [2022-02-21 04:31:08,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 52 letters. Loop has 31 letters. [2022-02-21 04:31:08,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 27 letters. [2022-02-21 04:31:08,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 27 letters. [2022-02-21 04:31:08,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 61 letters. Loop has 27 letters. [2022-02-21 04:31:08,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 27 letters. [2022-02-21 04:31:08,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 27 letters. [2022-02-21 04:31:08,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 62 letters. Loop has 27 letters. [2022-02-21 04:31:08,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 52 letters. Loop has 27 letters. [2022-02-21 04:31:08,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 27 letters. [2022-02-21 04:31:08,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 52 letters. Loop has 27 letters. [2022-02-21 04:31:08,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 67 letters. Loop has 27 letters. [2022-02-21 04:31:08,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 27 letters. [2022-02-21 04:31:08,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 67 letters. Loop has 27 letters. [2022-02-21 04:31:08,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 50 letters. Loop has 31 letters. [2022-02-21 04:31:08,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 31 letters. [2022-02-21 04:31:08,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 50 letters. Loop has 31 letters. [2022-02-21 04:31:08,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 48 letters. Loop has 31 letters. [2022-02-21 04:31:08,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 31 letters. [2022-02-21 04:31:08,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 48 letters. Loop has 31 letters. [2022-02-21 04:31:08,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 48 letters. Loop has 30 letters. [2022-02-21 04:31:08,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 30 letters. [2022-02-21 04:31:08,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 48 letters. Loop has 30 letters. [2022-02-21 04:31:08,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 49 letters. Loop has 31 letters. [2022-02-21 04:31:08,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 49 letters. Loop has 31 letters. [2022-02-21 04:31:08,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 49 letters. Loop has 31 letters. [2022-02-21 04:31:08,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 49 letters. Loop has 30 letters. [2022-02-21 04:31:08,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 49 letters. Loop has 30 letters. [2022-02-21 04:31:08,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 49 letters. Loop has 30 letters. [2022-02-21 04:31:08,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 63 letters. Loop has 27 letters. [2022-02-21 04:31:08,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 27 letters. [2022-02-21 04:31:08,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 63 letters. Loop has 27 letters. [2022-02-21 04:31:08,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 68 letters. Loop has 27 letters. [2022-02-21 04:31:08,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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 27 letters. [2022-02-21 04:31:08,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 68 letters. Loop has 27 letters. [2022-02-21 04:31:08,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 42 letters. Loop has 29 letters. [2022-02-21 04:31:08,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 29 letters. [2022-02-21 04:31:08,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 42 letters. Loop has 29 letters. [2022-02-21 04:31:08,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 45 letters. Loop has 31 letters. [2022-02-21 04:31:08,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 45 letters. Loop has 31 letters. [2022-02-21 04:31:08,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 45 letters. Loop has 31 letters. [2022-02-21 04:31:08,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 189 states and 282 transitions. cyclomatic complexity: 94 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:31:08,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 0 states 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:31:08,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 323 states and 492 transitions. cyclomatic complexity: 170 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:31:08,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,503 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:31:08,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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:31:08,507 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 195 transitions. [2022-02-21 04:31:08,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 195 transitions. Stem has 42 letters. Loop has 29 letters. [2022-02-21 04:31:08,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 195 transitions. Stem has 71 letters. Loop has 29 letters. [2022-02-21 04:31:08,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 195 transitions. Stem has 42 letters. Loop has 58 letters. [2022-02-21 04:31:08,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:08,508 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 323 states and 492 transitions. cyclomatic complexity: 170 [2022-02-21 04:31:08,519 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:31:08,519 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 323 states to 0 states and 0 transitions. [2022-02-21 04:31:08,519 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:31:08,519 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:31:08,520 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:31:08,520 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:31:08,520 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:31:08,520 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:31:08,520 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:31:08,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:31:08,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:31:08,521 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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:31:08,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:08,521 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 04:31:08,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 04:31:08,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 23.666666666666668) internal successors, (71), 3 states have internal predecessors, (71), 0 states have call successors, (0), 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:31:08,574 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:31:08,575 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-02-21 04:31:08,576 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:31:08,576 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 04:31:08,576 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:31:08,576 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:31:08,576 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:31:08,576 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:31:08,576 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:31:08,576 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:31:08,577 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:31:08,577 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:31:08,577 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:31:08,577 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:31:08,577 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:31:08,583 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:31:08 BoogieIcfgContainer [2022-02-21 04:31:08,583 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:31:08,584 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:31:08,584 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:31:08,584 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:31:08,584 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:31:01" (3/4) ... [2022-02-21 04:31:08,586 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:31:08,586 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:31:08,587 INFO L158 Benchmark]: Toolchain (without parser) took 7946.78ms. Allocated memory was 102.8MB in the beginning and 205.5MB in the end (delta: 102.8MB). Free memory was 71.8MB in the beginning and 161.5MB in the end (delta: -89.7MB). Peak memory consumption was 13.0MB. Max. memory is 16.1GB. [2022-02-21 04:31:08,588 INFO L158 Benchmark]: CDTParser took 0.21ms. Allocated memory is still 102.8MB. Free memory was 59.4MB in the beginning and 59.4MB in the end (delta: 54.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:31:08,588 INFO L158 Benchmark]: CACSL2BoogieTranslator took 360.94ms. Allocated memory is still 102.8MB. Free memory was 71.5MB in the beginning and 69.8MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 04:31:08,588 INFO L158 Benchmark]: Boogie Procedure Inliner took 101.55ms. Allocated memory is still 102.8MB. Free memory was 69.8MB in the beginning and 66.0MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 04:31:08,589 INFO L158 Benchmark]: Boogie Preprocessor took 45.59ms. Allocated memory is still 102.8MB. Free memory was 66.0MB in the beginning and 63.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:31:08,589 INFO L158 Benchmark]: RCFGBuilder took 810.90ms. Allocated memory was 102.8MB in the beginning and 130.0MB in the end (delta: 27.3MB). Free memory was 63.6MB in the beginning and 88.5MB in the end (delta: -24.9MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. [2022-02-21 04:31:08,589 INFO L158 Benchmark]: BuchiAutomizer took 6617.67ms. Allocated memory was 130.0MB in the beginning and 205.5MB in the end (delta: 75.5MB). Free memory was 88.5MB in the beginning and 161.5MB in the end (delta: -73.0MB). Peak memory consumption was 1.6MB. Max. memory is 16.1GB. [2022-02-21 04:31:08,590 INFO L158 Benchmark]: Witness Printer took 2.98ms. Allocated memory is still 205.5MB. Free memory is still 161.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:31:08,591 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.21ms. Allocated memory is still 102.8MB. Free memory was 59.4MB in the beginning and 59.4MB in the end (delta: 54.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 360.94ms. Allocated memory is still 102.8MB. Free memory was 71.5MB in the beginning and 69.8MB in the end (delta: 1.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 101.55ms. Allocated memory is still 102.8MB. Free memory was 69.8MB in the beginning and 66.0MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.59ms. Allocated memory is still 102.8MB. Free memory was 66.0MB in the beginning and 63.6MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 810.90ms. Allocated memory was 102.8MB in the beginning and 130.0MB in the end (delta: 27.3MB). Free memory was 63.6MB in the beginning and 88.5MB in the end (delta: -24.9MB). Peak memory consumption was 20.6MB. Max. memory is 16.1GB. * BuchiAutomizer took 6617.67ms. Allocated memory was 130.0MB in the beginning and 205.5MB in the end (delta: 75.5MB). Free memory was 88.5MB in the beginning and 161.5MB in the end (delta: -73.0MB). Peak memory consumption was 1.6MB. Max. memory is 16.1GB. * Witness Printer took 2.98ms. Allocated memory is still 205.5MB. Free memory is still 161.5MB. 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 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 11 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.5s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 3.7s. Construction of modules took 0.0s. Büchi inclusion checks took 2.4s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 77 StatesRemovedByMinimization, 1 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 189 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 398 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 398 mSDsluCounter, 2420 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1589 mSDsCounter, 43 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 54 IncrementalHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 43 mSolverCounterUnsat, 831 mSDtfsCounter, 54 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital142 mio100 ax100 hnf100 lsp26 ukn100 mio100 lsp100 div123 bol100 ite100 ukn100 eq182 hnf86 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 16ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 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:31:08,627 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