./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.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.2.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 cf92f342b2da275c63d151f2d4ed52683d7003506826ae2897efde5e3c66195f --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:31:09,132 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:31:09,134 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:31:09,168 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:31:09,169 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:31:09,172 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:31:09,174 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:31:09,178 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:31:09,180 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:31:09,184 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:31:09,185 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:31:09,186 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:31:09,187 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:31:09,189 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:31:09,191 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:31:09,194 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:31:09,195 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:31:09,195 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:31:09,197 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:31:09,202 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:31:09,204 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:31:09,205 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:31:09,206 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:31:09,207 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:31:09,213 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:31:09,213 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:31:09,214 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:31:09,215 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:31:09,216 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:31:09,217 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:31:09,217 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:31:09,218 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:31:09,220 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:31:09,220 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:31:09,221 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:31:09,222 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:31:09,222 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:31:09,223 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:31:09,224 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:31:09,224 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:31:09,225 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:31:09,226 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:31:09,257 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:31:09,258 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:31:09,259 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:31:09,260 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:31:09,262 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:31:09,262 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:31:09,263 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:31:09,263 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:31:09,263 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:31:09,264 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:31:09,264 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:31:09,265 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:31:09,265 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:31:09,265 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:31:09,265 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:31:09,266 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:31:09,266 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:31:09,266 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:31:09,266 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:31:09,266 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:31:09,267 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:31:09,267 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:31:09,267 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:31:09,267 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:31:09,268 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:31:09,268 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:31:09,268 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:31:09,269 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:31:09,269 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:31:09,270 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:31:09,270 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:31:09,271 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:31:09,271 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 -> cf92f342b2da275c63d151f2d4ed52683d7003506826ae2897efde5e3c66195f [2022-02-21 04:31:09,507 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:31:09,527 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:31:09,530 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:31:09,531 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:31:09,532 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:31:09,533 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.2.ufo.BOUNDED-6.pals.c [2022-02-21 04:31:09,585 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fb7c57bb/672cbefd2991403b8b5d2e8a4b8345e5/FLAG24f21c481 [2022-02-21 04:31:09,982 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:31:09,982 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c [2022-02-21 04:31:09,993 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fb7c57bb/672cbefd2991403b8b5d2e8a4b8345e5/FLAG24f21c481 [2022-02-21 04:31:10,372 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5fb7c57bb/672cbefd2991403b8b5d2e8a4b8345e5 [2022-02-21 04:31:10,375 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:31:10,376 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:31:10,381 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:31:10,381 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:31:10,384 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:31:10,385 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:31:10" (1/1) ... [2022-02-21 04:31:10,386 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3c3259df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:10, skipping insertion in model container [2022-02-21 04:31:10,386 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:31:10" (1/1) ... [2022-02-21 04:31:10,392 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:31:10,442 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:31:10,664 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.2.ufo.BOUNDED-6.pals.c[14373,14386] [2022-02-21 04:31:10,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:31:10,673 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:31:10,731 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.2.ufo.BOUNDED-6.pals.c[14373,14386] [2022-02-21 04:31:10,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:31:10,745 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:31:10,746 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:10 WrapperNode [2022-02-21 04:31:10,746 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:31:10,748 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:31:10,748 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:31:10,748 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:31:10,755 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:10" (1/1) ... [2022-02-21 04:31:10,765 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:10" (1/1) ... [2022-02-21 04:31:10,841 INFO L137 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 459 [2022-02-21 04:31:10,842 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:31:10,843 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:31:10,843 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:31:10,843 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:31:10,852 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:10" (1/1) ... [2022-02-21 04:31:10,852 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:10" (1/1) ... [2022-02-21 04:31:10,865 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:10" (1/1) ... [2022-02-21 04:31:10,878 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:10" (1/1) ... [2022-02-21 04:31:10,885 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:10" (1/1) ... [2022-02-21 04:31:10,904 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:10" (1/1) ... [2022-02-21 04:31:10,907 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:10" (1/1) ... [2022-02-21 04:31:10,917 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:31:10,918 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:31:10,918 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:31:10,918 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:31:10,920 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:10" (1/1) ... [2022-02-21 04:31:10,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:10,945 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:10,956 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:10,960 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:10,990 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:31:10,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:31:10,990 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:31:10,991 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:31:11,108 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:31:11,109 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:31:11,639 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:31:11,647 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:31:11,647 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 04:31:11,649 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:31:11 BoogieIcfgContainer [2022-02-21 04:31:11,649 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:31:11,650 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:31:11,650 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:31:11,653 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:31:11,653 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:31:11,653 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:31:10" (1/3) ... [2022-02-21 04:31:11,654 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@750724b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:31:11, skipping insertion in model container [2022-02-21 04:31:11,654 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:31:11,654 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:10" (2/3) ... [2022-02-21 04:31:11,655 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@750724b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:31:11, skipping insertion in model container [2022-02-21 04:31:11,655 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:31:11,655 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:31:11" (3/3) ... [2022-02-21 04:31:11,656 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c [2022-02-21 04:31:11,709 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:31:11,710 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:31:11,710 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:31:11,710 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:31:11,710 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:31:11,710 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:31:11,710 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:31:11,710 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:31:11,728 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 142 states, 141 states have (on average 1.75177304964539) internal successors, (247), 141 states have internal predecessors, (247), 0 states have call successors, (0), 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:11,774 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2022-02-21 04:31:11,775 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:31:11,775 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:31:11,784 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:11,784 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:11,784 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:31:11,786 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 142 states, 141 states have (on average 1.75177304964539) internal successors, (247), 141 states have internal predecessors, (247), 0 states have call successors, (0), 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:11,817 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2022-02-21 04:31:11,820 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:31:11,820 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:31:11,823 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:11,823 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:11,830 INFO L791 eck$LassoCheckResult]: Stem: 121#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; 39#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; 31#L258true assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 75#L261-1true init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 33#L271true assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 77#L274-1true init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 58#L284true assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 134#L287-1true init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 34#L297true assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 42#L300-1true init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 68#L310true assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 124#L313-1true init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 4#L323true assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 21#L326-1true init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 76#L336true assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 6#L336-1true init_#res#1 := init_~tmp___5~0#1; 15#L457true 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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 96#L21true assume !(0 == assume_abort_if_not_~cond#1); 14#L20true assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~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; 32#L568-2true [2022-02-21 04:31:11,836 INFO L793 eck$LassoCheckResult]: Loop: 32#L568-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; 90#L82true assume !(0 != ~mode1~0 % 256); 65#L110true assume !(~r1~0 < 2); 17#L110-1true ~mode1~0 := 1; 133#L82-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; 110#L133true assume !(0 != ~mode2~0 % 256); 9#L161true assume !(~r2~0 < 2); 67#L161-1true ~mode2~0 := 1; 23#L133-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; 80#L184true assume !(0 != ~mode3~0 % 256); 69#L212true assume !(~r3~0 < 2); 99#L212-1true ~mode3~0 := 1; 79#L184-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; 137#L465true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 132#L465-1true check_#res#1 := check_~tmp~1#1; 97#L513true 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; 118#L598true assume !(0 == assert_~arg#1 % 256); 74#L593true 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; 32#L568-2true [2022-02-21 04:31:11,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:11,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1744745224, now seen corresponding path program 1 times [2022-02-21 04:31:11,852 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:11,852 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1945973627] [2022-02-21 04:31:11,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:11,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:11,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:12,090 INFO L290 TraceCheckUtils]: 0: Hoare triple {146#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; {146#true} is VALID [2022-02-21 04:31:12,091 INFO L290 TraceCheckUtils]: 1: Hoare triple {146#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; {146#true} is VALID [2022-02-21 04:31:12,091 INFO L290 TraceCheckUtils]: 2: Hoare triple {146#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {146#true} is VALID [2022-02-21 04:31:12,092 INFO L290 TraceCheckUtils]: 3: Hoare triple {146#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {146#true} is VALID [2022-02-21 04:31:12,092 INFO L290 TraceCheckUtils]: 4: Hoare triple {146#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {146#true} is VALID [2022-02-21 04:31:12,092 INFO L290 TraceCheckUtils]: 5: Hoare triple {146#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {146#true} is VALID [2022-02-21 04:31:12,093 INFO L290 TraceCheckUtils]: 6: Hoare triple {146#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {146#true} is VALID [2022-02-21 04:31:12,093 INFO L290 TraceCheckUtils]: 7: Hoare triple {146#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {146#true} is VALID [2022-02-21 04:31:12,094 INFO L290 TraceCheckUtils]: 8: Hoare triple {146#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {146#true} is VALID [2022-02-21 04:31:12,094 INFO L290 TraceCheckUtils]: 9: Hoare triple {146#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {146#true} is VALID [2022-02-21 04:31:12,094 INFO L290 TraceCheckUtils]: 10: Hoare triple {146#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {146#true} is VALID [2022-02-21 04:31:12,095 INFO L290 TraceCheckUtils]: 11: Hoare triple {146#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {146#true} is VALID [2022-02-21 04:31:12,095 INFO L290 TraceCheckUtils]: 12: Hoare triple {146#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {146#true} is VALID [2022-02-21 04:31:12,095 INFO L290 TraceCheckUtils]: 13: Hoare triple {146#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {146#true} is VALID [2022-02-21 04:31:12,096 INFO L290 TraceCheckUtils]: 14: Hoare triple {146#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; {148#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} is VALID [2022-02-21 04:31:12,097 INFO L290 TraceCheckUtils]: 15: Hoare triple {148#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} init_#res#1 := init_~tmp___5~0#1; {149#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:31:12,097 INFO L290 TraceCheckUtils]: 16: Hoare triple {149#(= |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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {150#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:31:12,098 INFO L290 TraceCheckUtils]: 17: Hoare triple {150#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {147#false} is VALID [2022-02-21 04:31:12,098 INFO L290 TraceCheckUtils]: 18: Hoare triple {147#false} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~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; {147#false} is VALID [2022-02-21 04:31:12,099 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:12,100 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:31:12,100 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1945973627] [2022-02-21 04:31:12,101 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1945973627] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:31:12,102 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:31:12,102 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:31:12,104 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305388543] [2022-02-21 04:31:12,105 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:31:12,109 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:31:12,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:12,111 INFO L85 PathProgramCache]: Analyzing trace with hash 339208114, now seen corresponding path program 1 times [2022-02-21 04:31:12,111 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:12,112 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039871291] [2022-02-21 04:31:12,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:12,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:12,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:12,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {151#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; {151#true} is VALID [2022-02-21 04:31:12,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {151#true} assume !(0 != ~mode1~0 % 256); {151#true} is VALID [2022-02-21 04:31:12,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {151#true} assume !(~r1~0 < 2); {151#true} is VALID [2022-02-21 04:31:12,279 INFO L290 TraceCheckUtils]: 3: Hoare triple {151#true} ~mode1~0 := 1; {151#true} is VALID [2022-02-21 04:31:12,279 INFO L290 TraceCheckUtils]: 4: Hoare triple {151#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; {151#true} is VALID [2022-02-21 04:31:12,281 INFO L290 TraceCheckUtils]: 5: Hoare triple {151#true} assume !(0 != ~mode2~0 % 256); {151#true} is VALID [2022-02-21 04:31:12,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {151#true} assume !(~r2~0 < 2); {151#true} is VALID [2022-02-21 04:31:12,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {151#true} ~mode2~0 := 1; {151#true} is VALID [2022-02-21 04:31:12,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {151#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; {151#true} is VALID [2022-02-21 04:31:12,282 INFO L290 TraceCheckUtils]: 9: Hoare triple {151#true} assume !(0 != ~mode3~0 % 256); {151#true} is VALID [2022-02-21 04:31:12,282 INFO L290 TraceCheckUtils]: 10: Hoare triple {151#true} assume !(~r3~0 < 2); {151#true} is VALID [2022-02-21 04:31:12,283 INFO L290 TraceCheckUtils]: 11: Hoare triple {151#true} ~mode3~0 := 1; {151#true} is VALID [2022-02-21 04:31:12,283 INFO L290 TraceCheckUtils]: 12: Hoare triple {151#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; {151#true} is VALID [2022-02-21 04:31:12,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {151#true} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {153#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:31:12,284 INFO L290 TraceCheckUtils]: 14: Hoare triple {153#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {154#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:31:12,285 INFO L290 TraceCheckUtils]: 15: Hoare triple {154#(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; {155#(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:12,286 INFO L290 TraceCheckUtils]: 16: Hoare triple {155#(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); {152#false} is VALID [2022-02-21 04:31:12,287 INFO L290 TraceCheckUtils]: 17: Hoare triple {152#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; {152#false} is VALID [2022-02-21 04:31:12,287 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:12,288 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:31:12,288 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039871291] [2022-02-21 04:31:12,288 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039871291] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:31:12,288 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:31:12,289 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:31:12,289 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [228295656] [2022-02-21 04:31:12,289 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:31:12,290 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:31:12,292 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:31:12,319 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:31:12,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:31:12,339 INFO L87 Difference]: Start difference. First operand has 142 states, 141 states have (on average 1.75177304964539) internal successors, (247), 141 states have internal predecessors, (247), 0 states have call successors, (0), 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:12,950 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:12,950 INFO L93 Difference]: Finished difference Result 146 states and 247 transitions. [2022-02-21 04:31:12,950 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:31:12,951 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:12,969 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:12,974 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 146 states and 247 transitions. [2022-02-21 04:31:12,981 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2022-02-21 04:31:12,989 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 146 states to 137 states and 231 transitions. [2022-02-21 04:31:12,990 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2022-02-21 04:31:12,990 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2022-02-21 04:31:12,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 231 transitions. [2022-02-21 04:31:12,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:31:12,992 INFO L681 BuchiCegarLoop]: Abstraction has 137 states and 231 transitions. [2022-02-21 04:31:13,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 231 transitions. [2022-02-21 04:31:13,019 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2022-02-21 04:31:13,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:31:13,021 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states and 231 transitions. Second operand has 137 states, 137 states have (on average 1.686131386861314) internal successors, (231), 136 states have internal predecessors, (231), 0 states have call successors, (0), 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:13,022 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states and 231 transitions. Second operand has 137 states, 137 states have (on average 1.686131386861314) internal successors, (231), 136 states have internal predecessors, (231), 0 states have call successors, (0), 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:13,024 INFO L87 Difference]: Start difference. First operand 137 states and 231 transitions. Second operand has 137 states, 137 states have (on average 1.686131386861314) internal successors, (231), 136 states have internal predecessors, (231), 0 states have call successors, (0), 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:13,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:13,030 INFO L93 Difference]: Finished difference Result 137 states and 231 transitions. [2022-02-21 04:31:13,030 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 231 transitions. [2022-02-21 04:31:13,032 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:13,032 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:13,033 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 137 states have (on average 1.686131386861314) internal successors, (231), 136 states have internal predecessors, (231), 0 states have call successors, (0), 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 137 states and 231 transitions. [2022-02-21 04:31:13,033 INFO L87 Difference]: Start difference. First operand has 137 states, 137 states have (on average 1.686131386861314) internal successors, (231), 136 states have internal predecessors, (231), 0 states have call successors, (0), 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 137 states and 231 transitions. [2022-02-21 04:31:13,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:13,039 INFO L93 Difference]: Finished difference Result 137 states and 231 transitions. [2022-02-21 04:31:13,039 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 231 transitions. [2022-02-21 04:31:13,040 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:13,040 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:13,040 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:31:13,040 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:31:13,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 137 states have (on average 1.686131386861314) internal successors, (231), 136 states have internal predecessors, (231), 0 states have call successors, (0), 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:13,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 231 transitions. [2022-02-21 04:31:13,046 INFO L704 BuchiCegarLoop]: Abstraction has 137 states and 231 transitions. [2022-02-21 04:31:13,046 INFO L587 BuchiCegarLoop]: Abstraction has 137 states and 231 transitions. [2022-02-21 04:31:13,047 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:31:13,047 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 231 transitions. [2022-02-21 04:31:13,048 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2022-02-21 04:31:13,048 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:31:13,049 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:31:13,050 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:13,050 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:13,050 INFO L791 eck$LassoCheckResult]: Stem: 434#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; 377#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; 361#L258 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 362#L261-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 365#L271 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 366#L274-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 400#L284 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 355#L287-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 368#L297 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 369#L300-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 381#L310 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 345#L313-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 306#L323 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 308#L326-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 342#L336 assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 312#L336-1 init_#res#1 := init_~tmp___5~0#1; 313#L457 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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 335#L21 assume !(0 == assume_abort_if_not_~cond#1); 331#L20 assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~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; 332#L568-2 [2022-02-21 04:31:13,050 INFO L793 eck$LassoCheckResult]: Loop: 332#L568-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; 364#L82 assume !(0 != ~mode1~0 % 256); 407#L110 assume !(~r1~0 < 2); 315#L110-1 ~mode1~0 := 1; 336#L82-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; 429#L133 assume !(0 != ~mode2~0 % 256); 319#L161 assume !(~r2~0 < 2); 310#L161-1 ~mode2~0 := 1; 346#L133-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; 347#L184 assume !(0 != ~mode3~0 % 256); 410#L212 assume !(~r3~0 < 2); 384#L212-1 ~mode3~0 := 1; 415#L184-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; 416#L465 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 441#L466 assume ~st1~0 + ~nl1~0 <= 1; 442#L467 assume ~st2~0 + ~nl2~0 <= 1; 435#L468 assume ~st3~0 + ~nl3~0 <= 1; 321#L469 assume ~r1~0 >= 2; 322#L473 assume ~r1~0 < 2; 357#L478 assume ~r1~0 >= 2; 399#L483 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 330#L465-1 check_#res#1 := check_~tmp~1#1; 425#L513 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; 426#L598 assume !(0 == assert_~arg#1 % 256); 414#L593 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; 332#L568-2 [2022-02-21 04:31:13,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:13,051 INFO L85 PathProgramCache]: Analyzing trace with hash 1744745224, now seen corresponding path program 2 times [2022-02-21 04:31:13,051 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:13,051 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1891148943] [2022-02-21 04:31:13,052 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:13,052 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:13,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:13,138 INFO L290 TraceCheckUtils]: 0: Hoare triple {720#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; {720#true} is VALID [2022-02-21 04:31:13,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {720#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; {720#true} is VALID [2022-02-21 04:31:13,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {720#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {720#true} is VALID [2022-02-21 04:31:13,139 INFO L290 TraceCheckUtils]: 3: Hoare triple {720#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {720#true} is VALID [2022-02-21 04:31:13,139 INFO L290 TraceCheckUtils]: 4: Hoare triple {720#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {720#true} is VALID [2022-02-21 04:31:13,139 INFO L290 TraceCheckUtils]: 5: Hoare triple {720#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {720#true} is VALID [2022-02-21 04:31:13,139 INFO L290 TraceCheckUtils]: 6: Hoare triple {720#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {720#true} is VALID [2022-02-21 04:31:13,140 INFO L290 TraceCheckUtils]: 7: Hoare triple {720#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {720#true} is VALID [2022-02-21 04:31:13,140 INFO L290 TraceCheckUtils]: 8: Hoare triple {720#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {720#true} is VALID [2022-02-21 04:31:13,140 INFO L290 TraceCheckUtils]: 9: Hoare triple {720#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {720#true} is VALID [2022-02-21 04:31:13,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {720#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {720#true} is VALID [2022-02-21 04:31:13,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {720#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {720#true} is VALID [2022-02-21 04:31:13,144 INFO L290 TraceCheckUtils]: 12: Hoare triple {720#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {720#true} is VALID [2022-02-21 04:31:13,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {720#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {720#true} is VALID [2022-02-21 04:31:13,145 INFO L290 TraceCheckUtils]: 14: Hoare triple {720#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; {722#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} is VALID [2022-02-21 04:31:13,146 INFO L290 TraceCheckUtils]: 15: Hoare triple {722#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} init_#res#1 := init_~tmp___5~0#1; {723#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:31:13,146 INFO L290 TraceCheckUtils]: 16: Hoare triple {723#(= |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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {724#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:31:13,147 INFO L290 TraceCheckUtils]: 17: Hoare triple {724#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {721#false} is VALID [2022-02-21 04:31:13,148 INFO L290 TraceCheckUtils]: 18: Hoare triple {721#false} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~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; {721#false} is VALID [2022-02-21 04:31:13,150 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:13,150 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:31:13,150 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1891148943] [2022-02-21 04:31:13,151 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1891148943] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:31:13,151 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:31:13,151 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:31:13,151 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [970913067] [2022-02-21 04:31:13,151 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:31:13,152 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:31:13,153 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:13,153 INFO L85 PathProgramCache]: Analyzing trace with hash -191058054, now seen corresponding path program 1 times [2022-02-21 04:31:13,153 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:13,154 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278490258] [2022-02-21 04:31:13,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:13,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:13,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:13,212 INFO L290 TraceCheckUtils]: 0: Hoare triple {725#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; {725#true} is VALID [2022-02-21 04:31:13,213 INFO L290 TraceCheckUtils]: 1: Hoare triple {725#true} assume !(0 != ~mode1~0 % 256); {725#true} is VALID [2022-02-21 04:31:13,213 INFO L290 TraceCheckUtils]: 2: Hoare triple {725#true} assume !(~r1~0 < 2); {727#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:13,214 INFO L290 TraceCheckUtils]: 3: Hoare triple {727#(not (<= ~r1~0 1))} ~mode1~0 := 1; {727#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:13,214 INFO L290 TraceCheckUtils]: 4: Hoare triple {727#(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; {727#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:13,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {727#(not (<= ~r1~0 1))} assume !(0 != ~mode2~0 % 256); {727#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:13,215 INFO L290 TraceCheckUtils]: 6: Hoare triple {727#(not (<= ~r1~0 1))} assume !(~r2~0 < 2); {727#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:13,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {727#(not (<= ~r1~0 1))} ~mode2~0 := 1; {727#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:13,216 INFO L290 TraceCheckUtils]: 8: Hoare triple {727#(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; {727#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:13,217 INFO L290 TraceCheckUtils]: 9: Hoare triple {727#(not (<= ~r1~0 1))} assume !(0 != ~mode3~0 % 256); {727#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:13,217 INFO L290 TraceCheckUtils]: 10: Hoare triple {727#(not (<= ~r1~0 1))} assume !(~r3~0 < 2); {727#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:13,218 INFO L290 TraceCheckUtils]: 11: Hoare triple {727#(not (<= ~r1~0 1))} ~mode3~0 := 1; {727#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:13,218 INFO L290 TraceCheckUtils]: 12: Hoare triple {727#(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; {727#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:13,219 INFO L290 TraceCheckUtils]: 13: Hoare triple {727#(not (<= ~r1~0 1))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {727#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:13,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {727#(not (<= ~r1~0 1))} assume ~st1~0 + ~nl1~0 <= 1; {727#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:13,221 INFO L290 TraceCheckUtils]: 15: Hoare triple {727#(not (<= ~r1~0 1))} assume ~st2~0 + ~nl2~0 <= 1; {727#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:13,222 INFO L290 TraceCheckUtils]: 16: Hoare triple {727#(not (<= ~r1~0 1))} assume ~st3~0 + ~nl3~0 <= 1; {727#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:13,222 INFO L290 TraceCheckUtils]: 17: Hoare triple {727#(not (<= ~r1~0 1))} assume ~r1~0 >= 2; {727#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:13,223 INFO L290 TraceCheckUtils]: 18: Hoare triple {727#(not (<= ~r1~0 1))} assume ~r1~0 < 2; {726#false} is VALID [2022-02-21 04:31:13,223 INFO L290 TraceCheckUtils]: 19: Hoare triple {726#false} assume ~r1~0 >= 2; {726#false} is VALID [2022-02-21 04:31:13,223 INFO L290 TraceCheckUtils]: 20: Hoare triple {726#false} assume ~r1~0 < 2;check_~tmp~1#1 := 1; {726#false} is VALID [2022-02-21 04:31:13,223 INFO L290 TraceCheckUtils]: 21: Hoare triple {726#false} check_#res#1 := check_~tmp~1#1; {726#false} is VALID [2022-02-21 04:31:13,224 INFO L290 TraceCheckUtils]: 22: Hoare triple {726#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; {726#false} is VALID [2022-02-21 04:31:13,224 INFO L290 TraceCheckUtils]: 23: Hoare triple {726#false} assume !(0 == assert_~arg#1 % 256); {726#false} is VALID [2022-02-21 04:31:13,224 INFO L290 TraceCheckUtils]: 24: Hoare triple {726#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; {726#false} is VALID [2022-02-21 04:31:13,225 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:13,226 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:31:13,226 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278490258] [2022-02-21 04:31:13,226 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1278490258] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:31:13,227 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:31:13,228 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:31:13,228 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975369649] [2022-02-21 04:31:13,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:31:13,228 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:31:13,229 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:31:13,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:31:13,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:31:13,230 INFO L87 Difference]: Start difference. First operand 137 states and 231 transitions. cyclomatic complexity: 95 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:13,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:13,677 INFO L93 Difference]: Finished difference Result 140 states and 233 transitions. [2022-02-21 04:31:13,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:31:13,677 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:13,695 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:13,696 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 140 states and 233 transitions. [2022-02-21 04:31:13,701 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2022-02-21 04:31:13,708 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 140 states to 137 states and 201 transitions. [2022-02-21 04:31:13,708 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2022-02-21 04:31:13,709 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2022-02-21 04:31:13,712 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 201 transitions. [2022-02-21 04:31:13,714 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:31:13,714 INFO L681 BuchiCegarLoop]: Abstraction has 137 states and 201 transitions. [2022-02-21 04:31:13,715 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 201 transitions. [2022-02-21 04:31:13,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2022-02-21 04:31:13,727 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:31:13,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states and 201 transitions. Second operand has 137 states, 137 states have (on average 1.467153284671533) internal successors, (201), 136 states have internal predecessors, (201), 0 states have call successors, (0), 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:13,728 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states and 201 transitions. Second operand has 137 states, 137 states have (on average 1.467153284671533) internal successors, (201), 136 states have internal predecessors, (201), 0 states have call successors, (0), 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:13,729 INFO L87 Difference]: Start difference. First operand 137 states and 201 transitions. Second operand has 137 states, 137 states have (on average 1.467153284671533) internal successors, (201), 136 states have internal predecessors, (201), 0 states have call successors, (0), 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:13,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:13,734 INFO L93 Difference]: Finished difference Result 137 states and 201 transitions. [2022-02-21 04:31:13,734 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 201 transitions. [2022-02-21 04:31:13,738 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:13,738 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:13,738 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 137 states have (on average 1.467153284671533) internal successors, (201), 136 states have internal predecessors, (201), 0 states have call successors, (0), 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 137 states and 201 transitions. [2022-02-21 04:31:13,739 INFO L87 Difference]: Start difference. First operand has 137 states, 137 states have (on average 1.467153284671533) internal successors, (201), 136 states have internal predecessors, (201), 0 states have call successors, (0), 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 137 states and 201 transitions. [2022-02-21 04:31:13,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:13,743 INFO L93 Difference]: Finished difference Result 137 states and 201 transitions. [2022-02-21 04:31:13,743 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 201 transitions. [2022-02-21 04:31:13,744 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:13,744 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:13,744 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:31:13,744 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:31:13,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 137 states have (on average 1.467153284671533) internal successors, (201), 136 states have internal predecessors, (201), 0 states have call successors, (0), 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:13,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 201 transitions. [2022-02-21 04:31:13,748 INFO L704 BuchiCegarLoop]: Abstraction has 137 states and 201 transitions. [2022-02-21 04:31:13,748 INFO L587 BuchiCegarLoop]: Abstraction has 137 states and 201 transitions. [2022-02-21 04:31:13,749 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:31:13,749 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 201 transitions. [2022-02-21 04:31:13,751 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2022-02-21 04:31:13,752 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:31:13,752 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:31:13,755 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:31:13,755 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:13,755 INFO L791 eck$LassoCheckResult]: Stem: 1000#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; 943#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; 927#L258 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 928#L261-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 931#L271 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 932#L274-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 966#L284 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 921#L287-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 934#L297 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 935#L300-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 947#L310 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 911#L313-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 872#L323 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 874#L326-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 908#L336 assume ~id1~0 != ~id2~0; 979#L337 assume ~id1~0 != ~id3~0; 951#L338 assume ~id2~0 != ~id3~0; 952#L339 assume ~id1~0 >= 0; 993#L340 assume ~id2~0 >= 0; 988#L341 assume ~id3~0 >= 0; 939#L342 assume 0 == ~r1~0; 940#L343 assume 0 == ~r2~0; 924#L344 assume 0 == ~r3~0; 925#L345 assume 0 != init_~r122~0#1 % 256; 944#L346 assume 0 != init_~r132~0#1 % 256; 945#L347 assume 0 != init_~r212~0#1 % 256; 997#L348 assume 0 != init_~r232~0#1 % 256; 983#L349 assume 0 != init_~r312~0#1 % 256; 984#L350 assume 0 != init_~r322~0#1 % 256; 973#L351 assume ~max1~0 == ~id1~0; 974#L352 assume ~max2~0 == ~id2~0; 990#L353 assume ~max3~0 == ~id3~0; 960#L354 assume 0 == ~st1~0; 941#L355 assume 0 == ~st2~0; 942#L356 assume 0 == ~st3~0; 958#L357 assume 0 == ~nl1~0; 890#L358 assume 0 == ~nl2~0; 891#L359 assume 0 == ~nl3~0; 899#L360 assume 0 == ~mode1~0 % 256; 900#L361 assume 0 == ~mode2~0 % 256; 978#L362 assume 0 == ~mode3~0 % 256; 1005#L363 assume 0 != ~newmax1~0 % 256; 1006#L364 assume 0 != ~newmax2~0 % 256; 955#L365 assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; 878#L336-1 init_#res#1 := init_~tmp___5~0#1; 879#L457 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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 901#L21 assume !(0 == assume_abort_if_not_~cond#1); 897#L20 assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~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; 898#L568-2 [2022-02-21 04:31:13,756 INFO L793 eck$LassoCheckResult]: Loop: 898#L568-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; 930#L82 assume !(0 != ~mode1~0 % 256); 975#L110 assume !(~r1~0 < 2); 881#L110-1 ~mode1~0 := 1; 902#L82-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; 995#L133 assume !(0 != ~mode2~0 % 256); 885#L161 assume !(~r2~0 < 2); 876#L161-1 ~mode2~0 := 1; 912#L133-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; 913#L184 assume !(0 != ~mode3~0 % 256); 976#L212 assume !(~r3~0 < 2); 950#L212-1 ~mode3~0 := 1; 981#L184-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; 982#L465 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 1007#L466 assume ~st1~0 + ~nl1~0 <= 1; 1008#L467 assume ~st2~0 + ~nl2~0 <= 1; 1001#L468 assume ~st3~0 + ~nl3~0 <= 1; 887#L469 assume ~r1~0 >= 2; 888#L473 assume ~r1~0 < 2; 923#L478 assume ~r1~0 >= 2; 965#L483 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 896#L465-1 check_#res#1 := check_~tmp~1#1; 991#L513 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; 992#L598 assume !(0 == assert_~arg#1 % 256); 980#L593 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; 898#L568-2 [2022-02-21 04:31:13,757 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:13,757 INFO L85 PathProgramCache]: Analyzing trace with hash 431062094, now seen corresponding path program 1 times [2022-02-21 04:31:13,757 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:13,757 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394420222] [2022-02-21 04:31:13,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:13,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:13,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:31:13,798 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:31:13,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:31:13,909 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:31:13,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:13,910 INFO L85 PathProgramCache]: Analyzing trace with hash -191058054, now seen corresponding path program 2 times [2022-02-21 04:31:13,910 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:13,911 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1795758668] [2022-02-21 04:31:13,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:13,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:13,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:13,969 INFO L290 TraceCheckUtils]: 0: Hoare triple {1288#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; {1288#true} is VALID [2022-02-21 04:31:13,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {1288#true} assume !(0 != ~mode1~0 % 256); {1288#true} is VALID [2022-02-21 04:31:13,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {1288#true} assume !(~r1~0 < 2); {1290#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:13,970 INFO L290 TraceCheckUtils]: 3: Hoare triple {1290#(not (<= ~r1~0 1))} ~mode1~0 := 1; {1290#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:13,971 INFO L290 TraceCheckUtils]: 4: Hoare triple {1290#(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; {1290#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:13,971 INFO L290 TraceCheckUtils]: 5: Hoare triple {1290#(not (<= ~r1~0 1))} assume !(0 != ~mode2~0 % 256); {1290#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:13,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {1290#(not (<= ~r1~0 1))} assume !(~r2~0 < 2); {1290#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:13,972 INFO L290 TraceCheckUtils]: 7: Hoare triple {1290#(not (<= ~r1~0 1))} ~mode2~0 := 1; {1290#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:13,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {1290#(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; {1290#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:13,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {1290#(not (<= ~r1~0 1))} assume !(0 != ~mode3~0 % 256); {1290#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:13,973 INFO L290 TraceCheckUtils]: 10: Hoare triple {1290#(not (<= ~r1~0 1))} assume !(~r3~0 < 2); {1290#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:13,973 INFO L290 TraceCheckUtils]: 11: Hoare triple {1290#(not (<= ~r1~0 1))} ~mode3~0 := 1; {1290#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:13,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {1290#(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; {1290#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:13,974 INFO L290 TraceCheckUtils]: 13: Hoare triple {1290#(not (<= ~r1~0 1))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {1290#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:13,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {1290#(not (<= ~r1~0 1))} assume ~st1~0 + ~nl1~0 <= 1; {1290#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:13,974 INFO L290 TraceCheckUtils]: 15: Hoare triple {1290#(not (<= ~r1~0 1))} assume ~st2~0 + ~nl2~0 <= 1; {1290#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:13,984 INFO L290 TraceCheckUtils]: 16: Hoare triple {1290#(not (<= ~r1~0 1))} assume ~st3~0 + ~nl3~0 <= 1; {1290#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:13,985 INFO L290 TraceCheckUtils]: 17: Hoare triple {1290#(not (<= ~r1~0 1))} assume ~r1~0 >= 2; {1290#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:13,985 INFO L290 TraceCheckUtils]: 18: Hoare triple {1290#(not (<= ~r1~0 1))} assume ~r1~0 < 2; {1289#false} is VALID [2022-02-21 04:31:13,986 INFO L290 TraceCheckUtils]: 19: Hoare triple {1289#false} assume ~r1~0 >= 2; {1289#false} is VALID [2022-02-21 04:31:13,986 INFO L290 TraceCheckUtils]: 20: Hoare triple {1289#false} assume ~r1~0 < 2;check_~tmp~1#1 := 1; {1289#false} is VALID [2022-02-21 04:31:13,986 INFO L290 TraceCheckUtils]: 21: Hoare triple {1289#false} check_#res#1 := check_~tmp~1#1; {1289#false} is VALID [2022-02-21 04:31:13,986 INFO L290 TraceCheckUtils]: 22: Hoare triple {1289#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; {1289#false} is VALID [2022-02-21 04:31:13,986 INFO L290 TraceCheckUtils]: 23: Hoare triple {1289#false} assume !(0 == assert_~arg#1 % 256); {1289#false} is VALID [2022-02-21 04:31:13,989 INFO L290 TraceCheckUtils]: 24: Hoare triple {1289#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; {1289#false} is VALID [2022-02-21 04:31:13,989 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:13,989 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:31:13,990 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1795758668] [2022-02-21 04:31:13,990 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1795758668] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:31:13,990 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:31:13,990 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:31:13,990 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78053104] [2022-02-21 04:31:13,991 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:31:13,991 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:31:13,991 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:31:13,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:31:13,992 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:31:13,992 INFO L87 Difference]: Start difference. First operand 137 states and 201 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:14,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:14,206 INFO L93 Difference]: Finished difference Result 194 states and 287 transitions. [2022-02-21 04:31:14,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:31:14,207 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:14,230 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:14,231 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 194 states and 287 transitions. [2022-02-21 04:31:14,237 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 134 [2022-02-21 04:31:14,242 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 194 states to 194 states and 287 transitions. [2022-02-21 04:31:14,242 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 194 [2022-02-21 04:31:14,242 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 194 [2022-02-21 04:31:14,242 INFO L73 IsDeterministic]: Start isDeterministic. Operand 194 states and 287 transitions. [2022-02-21 04:31:14,243 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:31:14,243 INFO L681 BuchiCegarLoop]: Abstraction has 194 states and 287 transitions. [2022-02-21 04:31:14,243 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states and 287 transitions. [2022-02-21 04:31:14,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 194. [2022-02-21 04:31:14,247 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:31:14,248 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states and 287 transitions. Second operand has 194 states, 194 states have (on average 1.4793814432989691) internal successors, (287), 193 states have internal predecessors, (287), 0 states have call successors, (0), 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:14,249 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states and 287 transitions. Second operand has 194 states, 194 states have (on average 1.4793814432989691) internal successors, (287), 193 states have internal predecessors, (287), 0 states have call successors, (0), 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:14,249 INFO L87 Difference]: Start difference. First operand 194 states and 287 transitions. Second operand has 194 states, 194 states have (on average 1.4793814432989691) internal successors, (287), 193 states have internal predecessors, (287), 0 states have call successors, (0), 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:14,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:14,254 INFO L93 Difference]: Finished difference Result 194 states and 287 transitions. [2022-02-21 04:31:14,254 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 287 transitions. [2022-02-21 04:31:14,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:14,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:14,255 INFO L74 IsIncluded]: Start isIncluded. First operand has 194 states, 194 states have (on average 1.4793814432989691) internal successors, (287), 193 states have internal predecessors, (287), 0 states have call successors, (0), 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 194 states and 287 transitions. [2022-02-21 04:31:14,255 INFO L87 Difference]: Start difference. First operand has 194 states, 194 states have (on average 1.4793814432989691) internal successors, (287), 193 states have internal predecessors, (287), 0 states have call successors, (0), 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 194 states and 287 transitions. [2022-02-21 04:31:14,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:14,260 INFO L93 Difference]: Finished difference Result 194 states and 287 transitions. [2022-02-21 04:31:14,260 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 287 transitions. [2022-02-21 04:31:14,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:14,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:14,261 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:31:14,261 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:31:14,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 194 states have (on average 1.4793814432989691) internal successors, (287), 193 states have internal predecessors, (287), 0 states have call successors, (0), 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:14,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 287 transitions. [2022-02-21 04:31:14,266 INFO L704 BuchiCegarLoop]: Abstraction has 194 states and 287 transitions. [2022-02-21 04:31:14,266 INFO L587 BuchiCegarLoop]: Abstraction has 194 states and 287 transitions. [2022-02-21 04:31:14,266 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:31:14,266 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 194 states and 287 transitions. [2022-02-21 04:31:14,267 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 134 [2022-02-21 04:31:14,267 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:31:14,268 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:31:14,268 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:31:14,268 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:14,269 INFO L791 eck$LassoCheckResult]: Stem: 1620#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; 1560#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; 1541#L258 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 1542#L261-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 1546#L271 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 1547#L274-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 1583#L284 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 1532#L287-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 1549#L297 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 1550#L300-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 1564#L310 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 1525#L313-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 1485#L323 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 1487#L326-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 1522#L336 assume ~id1~0 != ~id2~0; 1596#L337 assume ~id1~0 != ~id3~0; 1568#L338 assume ~id2~0 != ~id3~0; 1569#L339 assume ~id1~0 >= 0; 1612#L340 assume ~id2~0 >= 0; 1605#L341 assume ~id3~0 >= 0; 1554#L342 assume 0 == ~r1~0; 1555#L343 assume 0 == ~r2~0; 1538#L344 assume 0 == ~r3~0; 1539#L345 assume 0 != init_~r122~0#1 % 256; 1561#L346 assume 0 != init_~r132~0#1 % 256; 1562#L347 assume 0 != init_~r212~0#1 % 256; 1617#L348 assume 0 != init_~r232~0#1 % 256; 1600#L349 assume 0 != init_~r312~0#1 % 256; 1601#L350 assume 0 != init_~r322~0#1 % 256; 1590#L351 assume ~max1~0 == ~id1~0; 1591#L352 assume ~max2~0 == ~id2~0; 1607#L353 assume ~max3~0 == ~id3~0; 1577#L354 assume 0 == ~st1~0; 1558#L355 assume 0 == ~st2~0; 1559#L356 assume 0 == ~st3~0; 1575#L357 assume 0 == ~nl1~0; 1502#L358 assume 0 == ~nl2~0; 1503#L359 assume 0 == ~nl3~0; 1511#L360 assume 0 == ~mode1~0 % 256; 1512#L361 assume 0 == ~mode2~0 % 256; 1595#L362 assume 0 == ~mode3~0 % 256; 1625#L363 assume 0 != ~newmax1~0 % 256; 1626#L364 assume 0 != ~newmax2~0 % 256; 1572#L365 assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; 1491#L336-1 init_#res#1 := init_~tmp___5~0#1; 1492#L457 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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 1513#L21 assume !(0 == assume_abort_if_not_~cond#1); 1509#L20 assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~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; 1510#L568-2 [2022-02-21 04:31:14,270 INFO L793 eck$LassoCheckResult]: Loop: 1510#L568-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; 1632#L82 assume !(0 != ~mode1~0 % 256); 1631#L110 assume ~r1~0 < 2; 1517#L111 assume !(0 != ~ep12~0 % 256); 1518#L111-1 assume !(0 != ~ep13~0 % 256); 1494#L110-1 ~mode1~0 := 1; 1521#L82-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; 1670#L133 assume !(0 != ~mode2~0 % 256); 1667#L161 assume !(~r2~0 < 2); 1658#L161-1 ~mode2~0 := 1; 1656#L133-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; 1654#L184 assume !(0 != ~mode3~0 % 256); 1647#L212 assume !(~r3~0 < 2); 1643#L212-1 ~mode3~0 := 1; 1642#L184-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; 1641#L465 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 1639#L466 assume ~st1~0 + ~nl1~0 <= 1; 1637#L467 assume ~st2~0 + ~nl2~0 <= 1; 1635#L468 assume ~st3~0 + ~nl3~0 <= 1; 1633#L469 assume !(~r1~0 >= 2); 1556#L472 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 1557#L473 assume ~r1~0 < 2; 1678#L478 assume !(~r1~0 >= 2); 1581#L482 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; 1582#L483 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 1640#L465-1 check_#res#1 := check_~tmp~1#1; 1638#L513 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; 1636#L598 assume !(0 == assert_~arg#1 % 256); 1634#L593 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; 1510#L568-2 [2022-02-21 04:31:14,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:14,270 INFO L85 PathProgramCache]: Analyzing trace with hash 431062094, now seen corresponding path program 2 times [2022-02-21 04:31:14,270 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:14,271 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [964784133] [2022-02-21 04:31:14,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:14,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:14,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:31:14,295 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:31:14,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:31:14,340 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:31:14,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:14,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1983288549, now seen corresponding path program 1 times [2022-02-21 04:31:14,341 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:14,341 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371848848] [2022-02-21 04:31:14,341 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:14,341 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:14,353 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:31:14,354 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:31:14,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:31:14,363 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:31:14,364 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:14,364 INFO L85 PathProgramCache]: Analyzing trace with hash 2100705208, now seen corresponding path program 1 times [2022-02-21 04:31:14,364 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:14,365 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208606080] [2022-02-21 04:31:14,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:14,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:14,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {2074#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; {2074#true} is VALID [2022-02-21 04:31:14,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {2074#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; {2074#true} is VALID [2022-02-21 04:31:14,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {2074#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {2074#true} is VALID [2022-02-21 04:31:14,417 INFO L290 TraceCheckUtils]: 3: Hoare triple {2074#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {2074#true} is VALID [2022-02-21 04:31:14,417 INFO L290 TraceCheckUtils]: 4: Hoare triple {2074#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {2074#true} is VALID [2022-02-21 04:31:14,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {2074#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {2074#true} is VALID [2022-02-21 04:31:14,418 INFO L290 TraceCheckUtils]: 6: Hoare triple {2074#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {2074#true} is VALID [2022-02-21 04:31:14,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {2074#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {2074#true} is VALID [2022-02-21 04:31:14,418 INFO L290 TraceCheckUtils]: 8: Hoare triple {2074#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {2074#true} is VALID [2022-02-21 04:31:14,418 INFO L290 TraceCheckUtils]: 9: Hoare triple {2074#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {2074#true} is VALID [2022-02-21 04:31:14,418 INFO L290 TraceCheckUtils]: 10: Hoare triple {2074#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {2074#true} is VALID [2022-02-21 04:31:14,418 INFO L290 TraceCheckUtils]: 11: Hoare triple {2074#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {2074#true} is VALID [2022-02-21 04:31:14,418 INFO L290 TraceCheckUtils]: 12: Hoare triple {2074#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {2074#true} is VALID [2022-02-21 04:31:14,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {2074#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {2074#true} is VALID [2022-02-21 04:31:14,419 INFO L290 TraceCheckUtils]: 14: Hoare triple {2074#true} assume ~id1~0 != ~id2~0; {2074#true} is VALID [2022-02-21 04:31:14,419 INFO L290 TraceCheckUtils]: 15: Hoare triple {2074#true} assume ~id1~0 != ~id3~0; {2074#true} is VALID [2022-02-21 04:31:14,419 INFO L290 TraceCheckUtils]: 16: Hoare triple {2074#true} assume ~id2~0 != ~id3~0; {2074#true} is VALID [2022-02-21 04:31:14,419 INFO L290 TraceCheckUtils]: 17: Hoare triple {2074#true} assume ~id1~0 >= 0; {2074#true} is VALID [2022-02-21 04:31:14,419 INFO L290 TraceCheckUtils]: 18: Hoare triple {2074#true} assume ~id2~0 >= 0; {2074#true} is VALID [2022-02-21 04:31:14,419 INFO L290 TraceCheckUtils]: 19: Hoare triple {2074#true} assume ~id3~0 >= 0; {2074#true} is VALID [2022-02-21 04:31:14,419 INFO L290 TraceCheckUtils]: 20: Hoare triple {2074#true} assume 0 == ~r1~0; {2074#true} is VALID [2022-02-21 04:31:14,420 INFO L290 TraceCheckUtils]: 21: Hoare triple {2074#true} assume 0 == ~r2~0; {2076#(= ~r2~0 0)} is VALID [2022-02-21 04:31:14,420 INFO L290 TraceCheckUtils]: 22: Hoare triple {2076#(= ~r2~0 0)} assume 0 == ~r3~0; {2076#(= ~r2~0 0)} is VALID [2022-02-21 04:31:14,421 INFO L290 TraceCheckUtils]: 23: Hoare triple {2076#(= ~r2~0 0)} assume 0 != init_~r122~0#1 % 256; {2076#(= ~r2~0 0)} is VALID [2022-02-21 04:31:14,421 INFO L290 TraceCheckUtils]: 24: Hoare triple {2076#(= ~r2~0 0)} assume 0 != init_~r132~0#1 % 256; {2076#(= ~r2~0 0)} is VALID [2022-02-21 04:31:14,421 INFO L290 TraceCheckUtils]: 25: Hoare triple {2076#(= ~r2~0 0)} assume 0 != init_~r212~0#1 % 256; {2076#(= ~r2~0 0)} is VALID [2022-02-21 04:31:14,422 INFO L290 TraceCheckUtils]: 26: Hoare triple {2076#(= ~r2~0 0)} assume 0 != init_~r232~0#1 % 256; {2076#(= ~r2~0 0)} is VALID [2022-02-21 04:31:14,423 INFO L290 TraceCheckUtils]: 27: Hoare triple {2076#(= ~r2~0 0)} assume 0 != init_~r312~0#1 % 256; {2076#(= ~r2~0 0)} is VALID [2022-02-21 04:31:14,423 INFO L290 TraceCheckUtils]: 28: Hoare triple {2076#(= ~r2~0 0)} assume 0 != init_~r322~0#1 % 256; {2076#(= ~r2~0 0)} is VALID [2022-02-21 04:31:14,424 INFO L290 TraceCheckUtils]: 29: Hoare triple {2076#(= ~r2~0 0)} assume ~max1~0 == ~id1~0; {2076#(= ~r2~0 0)} is VALID [2022-02-21 04:31:14,424 INFO L290 TraceCheckUtils]: 30: Hoare triple {2076#(= ~r2~0 0)} assume ~max2~0 == ~id2~0; {2076#(= ~r2~0 0)} is VALID [2022-02-21 04:31:14,424 INFO L290 TraceCheckUtils]: 31: Hoare triple {2076#(= ~r2~0 0)} assume ~max3~0 == ~id3~0; {2076#(= ~r2~0 0)} is VALID [2022-02-21 04:31:14,425 INFO L290 TraceCheckUtils]: 32: Hoare triple {2076#(= ~r2~0 0)} assume 0 == ~st1~0; {2076#(= ~r2~0 0)} is VALID [2022-02-21 04:31:14,425 INFO L290 TraceCheckUtils]: 33: Hoare triple {2076#(= ~r2~0 0)} assume 0 == ~st2~0; {2076#(= ~r2~0 0)} is VALID [2022-02-21 04:31:14,425 INFO L290 TraceCheckUtils]: 34: Hoare triple {2076#(= ~r2~0 0)} assume 0 == ~st3~0; {2076#(= ~r2~0 0)} is VALID [2022-02-21 04:31:14,426 INFO L290 TraceCheckUtils]: 35: Hoare triple {2076#(= ~r2~0 0)} assume 0 == ~nl1~0; {2076#(= ~r2~0 0)} is VALID [2022-02-21 04:31:14,426 INFO L290 TraceCheckUtils]: 36: Hoare triple {2076#(= ~r2~0 0)} assume 0 == ~nl2~0; {2076#(= ~r2~0 0)} is VALID [2022-02-21 04:31:14,426 INFO L290 TraceCheckUtils]: 37: Hoare triple {2076#(= ~r2~0 0)} assume 0 == ~nl3~0; {2076#(= ~r2~0 0)} is VALID [2022-02-21 04:31:14,427 INFO L290 TraceCheckUtils]: 38: Hoare triple {2076#(= ~r2~0 0)} assume 0 == ~mode1~0 % 256; {2076#(= ~r2~0 0)} is VALID [2022-02-21 04:31:14,427 INFO L290 TraceCheckUtils]: 39: Hoare triple {2076#(= ~r2~0 0)} assume 0 == ~mode2~0 % 256; {2076#(= ~r2~0 0)} is VALID [2022-02-21 04:31:14,427 INFO L290 TraceCheckUtils]: 40: Hoare triple {2076#(= ~r2~0 0)} assume 0 == ~mode3~0 % 256; {2076#(= ~r2~0 0)} is VALID [2022-02-21 04:31:14,428 INFO L290 TraceCheckUtils]: 41: Hoare triple {2076#(= ~r2~0 0)} assume 0 != ~newmax1~0 % 256; {2076#(= ~r2~0 0)} is VALID [2022-02-21 04:31:14,428 INFO L290 TraceCheckUtils]: 42: Hoare triple {2076#(= ~r2~0 0)} assume 0 != ~newmax2~0 % 256; {2076#(= ~r2~0 0)} is VALID [2022-02-21 04:31:14,428 INFO L290 TraceCheckUtils]: 43: Hoare triple {2076#(= ~r2~0 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {2076#(= ~r2~0 0)} is VALID [2022-02-21 04:31:14,429 INFO L290 TraceCheckUtils]: 44: Hoare triple {2076#(= ~r2~0 0)} init_#res#1 := init_~tmp___5~0#1; {2076#(= ~r2~0 0)} is VALID [2022-02-21 04:31:14,429 INFO L290 TraceCheckUtils]: 45: Hoare triple {2076#(= ~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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2076#(= ~r2~0 0)} is VALID [2022-02-21 04:31:14,430 INFO L290 TraceCheckUtils]: 46: Hoare triple {2076#(= ~r2~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {2076#(= ~r2~0 0)} is VALID [2022-02-21 04:31:14,430 INFO L290 TraceCheckUtils]: 47: Hoare triple {2076#(= ~r2~0 0)} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~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; {2076#(= ~r2~0 0)} is VALID [2022-02-21 04:31:14,431 INFO L290 TraceCheckUtils]: 48: Hoare triple {2076#(= ~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; {2076#(= ~r2~0 0)} is VALID [2022-02-21 04:31:14,431 INFO L290 TraceCheckUtils]: 49: Hoare triple {2076#(= ~r2~0 0)} assume !(0 != ~mode1~0 % 256); {2076#(= ~r2~0 0)} is VALID [2022-02-21 04:31:14,431 INFO L290 TraceCheckUtils]: 50: Hoare triple {2076#(= ~r2~0 0)} assume ~r1~0 < 2; {2076#(= ~r2~0 0)} is VALID [2022-02-21 04:31:14,432 INFO L290 TraceCheckUtils]: 51: Hoare triple {2076#(= ~r2~0 0)} assume !(0 != ~ep12~0 % 256); {2076#(= ~r2~0 0)} is VALID [2022-02-21 04:31:14,432 INFO L290 TraceCheckUtils]: 52: Hoare triple {2076#(= ~r2~0 0)} assume !(0 != ~ep13~0 % 256); {2076#(= ~r2~0 0)} is VALID [2022-02-21 04:31:14,432 INFO L290 TraceCheckUtils]: 53: Hoare triple {2076#(= ~r2~0 0)} ~mode1~0 := 1; {2076#(= ~r2~0 0)} is VALID [2022-02-21 04:31:14,433 INFO L290 TraceCheckUtils]: 54: Hoare triple {2076#(= ~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; {2076#(= ~r2~0 0)} is VALID [2022-02-21 04:31:14,433 INFO L290 TraceCheckUtils]: 55: Hoare triple {2076#(= ~r2~0 0)} assume !(0 != ~mode2~0 % 256); {2076#(= ~r2~0 0)} is VALID [2022-02-21 04:31:14,434 INFO L290 TraceCheckUtils]: 56: Hoare triple {2076#(= ~r2~0 0)} assume !(~r2~0 < 2); {2075#false} is VALID [2022-02-21 04:31:14,434 INFO L290 TraceCheckUtils]: 57: Hoare triple {2075#false} ~mode2~0 := 1; {2075#false} is VALID [2022-02-21 04:31:14,434 INFO L290 TraceCheckUtils]: 58: Hoare triple {2075#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; {2075#false} is VALID [2022-02-21 04:31:14,434 INFO L290 TraceCheckUtils]: 59: Hoare triple {2075#false} assume !(0 != ~mode3~0 % 256); {2075#false} is VALID [2022-02-21 04:31:14,434 INFO L290 TraceCheckUtils]: 60: Hoare triple {2075#false} assume !(~r3~0 < 2); {2075#false} is VALID [2022-02-21 04:31:14,434 INFO L290 TraceCheckUtils]: 61: Hoare triple {2075#false} ~mode3~0 := 1; {2075#false} is VALID [2022-02-21 04:31:14,434 INFO L290 TraceCheckUtils]: 62: Hoare triple {2075#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; {2075#false} is VALID [2022-02-21 04:31:14,434 INFO L290 TraceCheckUtils]: 63: Hoare triple {2075#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {2075#false} is VALID [2022-02-21 04:31:14,435 INFO L290 TraceCheckUtils]: 64: Hoare triple {2075#false} assume ~st1~0 + ~nl1~0 <= 1; {2075#false} is VALID [2022-02-21 04:31:14,435 INFO L290 TraceCheckUtils]: 65: Hoare triple {2075#false} assume ~st2~0 + ~nl2~0 <= 1; {2075#false} is VALID [2022-02-21 04:31:14,435 INFO L290 TraceCheckUtils]: 66: Hoare triple {2075#false} assume ~st3~0 + ~nl3~0 <= 1; {2075#false} is VALID [2022-02-21 04:31:14,435 INFO L290 TraceCheckUtils]: 67: Hoare triple {2075#false} assume !(~r1~0 >= 2); {2075#false} is VALID [2022-02-21 04:31:14,435 INFO L290 TraceCheckUtils]: 68: Hoare triple {2075#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {2075#false} is VALID [2022-02-21 04:31:14,435 INFO L290 TraceCheckUtils]: 69: Hoare triple {2075#false} assume ~r1~0 < 2; {2075#false} is VALID [2022-02-21 04:31:14,435 INFO L290 TraceCheckUtils]: 70: Hoare triple {2075#false} assume !(~r1~0 >= 2); {2075#false} is VALID [2022-02-21 04:31:14,435 INFO L290 TraceCheckUtils]: 71: Hoare triple {2075#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {2075#false} is VALID [2022-02-21 04:31:14,436 INFO L290 TraceCheckUtils]: 72: Hoare triple {2075#false} assume ~r1~0 < 2;check_~tmp~1#1 := 1; {2075#false} is VALID [2022-02-21 04:31:14,436 INFO L290 TraceCheckUtils]: 73: Hoare triple {2075#false} check_#res#1 := check_~tmp~1#1; {2075#false} is VALID [2022-02-21 04:31:14,436 INFO L290 TraceCheckUtils]: 74: Hoare triple {2075#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; {2075#false} is VALID [2022-02-21 04:31:14,436 INFO L290 TraceCheckUtils]: 75: Hoare triple {2075#false} assume !(0 == assert_~arg#1 % 256); {2075#false} is VALID [2022-02-21 04:31:14,436 INFO L290 TraceCheckUtils]: 76: Hoare triple {2075#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; {2075#false} is VALID [2022-02-21 04:31:14,446 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:31:14,446 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:31:14,446 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208606080] [2022-02-21 04:31:14,447 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208606080] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:31:14,447 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:31:14,447 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:31:14,447 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062156410] [2022-02-21 04:31:14,447 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:31:15,082 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:31:15,083 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:31:15,083 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:31:15,083 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:31:15,083 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:31:15,084 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:15,084 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:31:15,084 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:31:15,084 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2022-02-21 04:31:15,084 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:31:15,084 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:31:15,104 INFO L141 MapEliminator]: 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:15,111 INFO L141 MapEliminator]: 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:15,114 INFO L141 MapEliminator]: 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:15,119 INFO L141 MapEliminator]: 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:15,122 INFO L141 MapEliminator]: 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:15,133 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:15,136 INFO L141 MapEliminator]: 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:15,138 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:15,145 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:15,147 INFO L141 MapEliminator]: 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:15,150 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:15,154 INFO L141 MapEliminator]: 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:15,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:15,159 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:15,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:15,165 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:15,167 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:15,173 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:15,191 INFO L141 MapEliminator]: 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:15,193 INFO L141 MapEliminator]: 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:15,199 INFO L141 MapEliminator]: 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:15,202 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:15,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:15,209 INFO L141 MapEliminator]: 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:15,775 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:31:15,775 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:31:15,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:15,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:15,779 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:15,783 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:31:15,784 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:31:15,799 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:15,815 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:31:15,815 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:15,847 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:15,847 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:15,847 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:15,848 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:15,850 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:15,851 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:31:15,851 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:31:15,858 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:31:15,859 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:15,884 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:15,885 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:15,885 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:15,886 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:15,891 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:15,892 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:31:15,892 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:31:15,943 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:15,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:15,944 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:15,945 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:15,961 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:15,962 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:31:15,962 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:31:16,137 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:31:16,140 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:16,141 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:31:16,141 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:31:16,141 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:31:16,141 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:31:16,141 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:31:16,141 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:16,141 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:31:16,141 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:31:16,141 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.3.2.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2022-02-21 04:31:16,141 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:31:16,141 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:31:16,143 INFO L141 MapEliminator]: 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:16,148 INFO L141 MapEliminator]: 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:16,157 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:16,162 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:16,164 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:16,177 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:16,180 INFO L141 MapEliminator]: 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:16,183 INFO L141 MapEliminator]: 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:16,186 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:16,188 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:16,195 INFO L141 MapEliminator]: 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:16,198 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:16,201 INFO L141 MapEliminator]: 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:16,206 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:16,209 INFO L141 MapEliminator]: 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:16,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:16,217 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:16,221 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:16,228 INFO L141 MapEliminator]: 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:16,232 INFO L141 MapEliminator]: 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:16,237 INFO L141 MapEliminator]: 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:16,239 INFO L141 MapEliminator]: 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:16,241 INFO L141 MapEliminator]: 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:16,261 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:16,809 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:31:16,813 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:31:16,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:16,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:16,816 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:16,824 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:16,831 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:16,831 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:16,832 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:16,832 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:16,832 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:16,834 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:16,834 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:16,837 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:16,852 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:16,876 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:16,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:16,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:16,878 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:16,886 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:16,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:16,893 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:16,893 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:16,893 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:16,893 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:16,894 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:16,894 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:16,897 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:16,911 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:16,939 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:16,940 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:16,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:16,941 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:16,943 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:16,944 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:16,951 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:16,951 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:16,951 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:16,951 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:16,951 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:16,952 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:16,952 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:16,967 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:16,990 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:16,991 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:16,991 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:16,993 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:17,000 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:17,007 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:17,007 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:17,007 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:17,007 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:17,008 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:17,008 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:17,008 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:17,011 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:17,023 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:17,048 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:17,049 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:17,049 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:17,050 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:17,058 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:17,066 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:17,066 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:17,066 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:17,066 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:17,066 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:17,069 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:17,069 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:17,071 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:17,087 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:17,112 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:17,113 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:17,113 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:17,114 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:17,115 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:17,117 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:17,124 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:17,124 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:17,124 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:17,124 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:17,124 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:17,125 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:17,125 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:17,139 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:17,165 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:17,165 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:17,166 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:17,167 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:17,168 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:17,170 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:17,176 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:17,176 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:17,176 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:17,176 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:17,176 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:17,177 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:17,177 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:17,191 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:17,215 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:17,216 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:17,216 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:17,217 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:17,226 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:17,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:17,233 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:17,234 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:17,234 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:17,234 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:17,234 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:17,234 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:17,236 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:17,247 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:17,274 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:17,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:17,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:17,276 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:17,277 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 04:31:17,279 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:17,285 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:17,285 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:17,286 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:17,286 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:17,286 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:17,286 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:17,286 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:17,297 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:17,318 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:17,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:17,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:17,320 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:17,321 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 04:31:17,323 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:17,329 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:17,329 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:17,329 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:17,329 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:17,329 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:17,330 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:17,330 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:17,332 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:17,347 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:17,347 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:17,347 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:17,348 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:17,349 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 04:31:17,350 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:17,357 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:17,357 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:17,357 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:17,357 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:17,357 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:17,357 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:17,357 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:17,362 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:17,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:17,379 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:17,380 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:17,381 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:17,384 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 04:31:17,385 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:17,390 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:17,390 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:17,391 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:17,391 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:17,391 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:17,391 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:17,391 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:17,396 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:17,412 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Ended with exit code 0 [2022-02-21 04:31:17,412 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:17,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:17,413 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:17,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 04:31:17,416 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:17,421 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:17,422 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:17,422 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:17,422 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:17,422 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:17,423 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:17,423 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:17,426 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:17,442 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Ended with exit code 0 [2022-02-21 04:31:17,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:17,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:17,443 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:17,444 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 04:31:17,445 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:17,451 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:17,451 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:17,451 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:17,451 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:17,451 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:17,451 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:17,451 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:17,452 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:17,468 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:17,468 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:17,468 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:17,469 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:17,477 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 04:31:17,479 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:17,485 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:17,485 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:17,485 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:17,485 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:17,485 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:17,485 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:17,486 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:17,486 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:17,502 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:17,502 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:17,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:17,503 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:17,504 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 04:31:17,505 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:17,513 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:17,513 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:17,513 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:17,513 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:17,514 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:17,515 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:17,515 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:17,531 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:31:17,553 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:31:17,553 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:31:17,554 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:17,554 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:17,564 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:17,566 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 04:31:17,600 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:31:17,600 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:31:17,600 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:31:17,600 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:17,625 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:17,649 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:31:17,655 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:17,674 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:17,695 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:17,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:17,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:31:17,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:17,772 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:31:17,893 INFO L290 TraceCheckUtils]: 0: Hoare triple {2077#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; {2077#unseeded} is VALID [2022-02-21 04:31:17,895 INFO L290 TraceCheckUtils]: 1: Hoare triple {2077#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; {2077#unseeded} is VALID [2022-02-21 04:31:17,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {2077#unseeded} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {2077#unseeded} is VALID [2022-02-21 04:31:17,897 INFO L290 TraceCheckUtils]: 3: Hoare triple {2077#unseeded} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {2077#unseeded} is VALID [2022-02-21 04:31:17,897 INFO L290 TraceCheckUtils]: 4: Hoare triple {2077#unseeded} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {2077#unseeded} is VALID [2022-02-21 04:31:17,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {2077#unseeded} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {2077#unseeded} is VALID [2022-02-21 04:31:17,898 INFO L290 TraceCheckUtils]: 6: Hoare triple {2077#unseeded} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {2077#unseeded} is VALID [2022-02-21 04:31:17,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {2077#unseeded} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {2077#unseeded} is VALID [2022-02-21 04:31:17,899 INFO L290 TraceCheckUtils]: 8: Hoare triple {2077#unseeded} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {2077#unseeded} is VALID [2022-02-21 04:31:17,899 INFO L290 TraceCheckUtils]: 9: Hoare triple {2077#unseeded} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {2077#unseeded} is VALID [2022-02-21 04:31:17,900 INFO L290 TraceCheckUtils]: 10: Hoare triple {2077#unseeded} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {2077#unseeded} is VALID [2022-02-21 04:31:17,900 INFO L290 TraceCheckUtils]: 11: Hoare triple {2077#unseeded} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {2077#unseeded} is VALID [2022-02-21 04:31:17,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {2077#unseeded} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {2077#unseeded} is VALID [2022-02-21 04:31:17,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {2077#unseeded} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {2077#unseeded} is VALID [2022-02-21 04:31:17,901 INFO L290 TraceCheckUtils]: 14: Hoare triple {2077#unseeded} assume ~id1~0 != ~id2~0; {2077#unseeded} is VALID [2022-02-21 04:31:17,902 INFO L290 TraceCheckUtils]: 15: Hoare triple {2077#unseeded} assume ~id1~0 != ~id3~0; {2077#unseeded} is VALID [2022-02-21 04:31:17,902 INFO L290 TraceCheckUtils]: 16: Hoare triple {2077#unseeded} assume ~id2~0 != ~id3~0; {2077#unseeded} is VALID [2022-02-21 04:31:17,902 INFO L290 TraceCheckUtils]: 17: Hoare triple {2077#unseeded} assume ~id1~0 >= 0; {2077#unseeded} is VALID [2022-02-21 04:31:17,903 INFO L290 TraceCheckUtils]: 18: Hoare triple {2077#unseeded} assume ~id2~0 >= 0; {2077#unseeded} is VALID [2022-02-21 04:31:17,903 INFO L290 TraceCheckUtils]: 19: Hoare triple {2077#unseeded} assume ~id3~0 >= 0; {2077#unseeded} is VALID [2022-02-21 04:31:17,907 INFO L290 TraceCheckUtils]: 20: Hoare triple {2077#unseeded} assume 0 == ~r1~0; {2077#unseeded} is VALID [2022-02-21 04:31:17,908 INFO L290 TraceCheckUtils]: 21: Hoare triple {2077#unseeded} assume 0 == ~r2~0; {2077#unseeded} is VALID [2022-02-21 04:31:17,908 INFO L290 TraceCheckUtils]: 22: Hoare triple {2077#unseeded} assume 0 == ~r3~0; {2077#unseeded} is VALID [2022-02-21 04:31:17,908 INFO L290 TraceCheckUtils]: 23: Hoare triple {2077#unseeded} assume 0 != init_~r122~0#1 % 256; {2077#unseeded} is VALID [2022-02-21 04:31:17,909 INFO L290 TraceCheckUtils]: 24: Hoare triple {2077#unseeded} assume 0 != init_~r132~0#1 % 256; {2077#unseeded} is VALID [2022-02-21 04:31:17,909 INFO L290 TraceCheckUtils]: 25: Hoare triple {2077#unseeded} assume 0 != init_~r212~0#1 % 256; {2077#unseeded} is VALID [2022-02-21 04:31:17,909 INFO L290 TraceCheckUtils]: 26: Hoare triple {2077#unseeded} assume 0 != init_~r232~0#1 % 256; {2077#unseeded} is VALID [2022-02-21 04:31:17,910 INFO L290 TraceCheckUtils]: 27: Hoare triple {2077#unseeded} assume 0 != init_~r312~0#1 % 256; {2077#unseeded} is VALID [2022-02-21 04:31:17,910 INFO L290 TraceCheckUtils]: 28: Hoare triple {2077#unseeded} assume 0 != init_~r322~0#1 % 256; {2077#unseeded} is VALID [2022-02-21 04:31:17,911 INFO L290 TraceCheckUtils]: 29: Hoare triple {2077#unseeded} assume ~max1~0 == ~id1~0; {2077#unseeded} is VALID [2022-02-21 04:31:17,911 INFO L290 TraceCheckUtils]: 30: Hoare triple {2077#unseeded} assume ~max2~0 == ~id2~0; {2077#unseeded} is VALID [2022-02-21 04:31:17,911 INFO L290 TraceCheckUtils]: 31: Hoare triple {2077#unseeded} assume ~max3~0 == ~id3~0; {2077#unseeded} is VALID [2022-02-21 04:31:17,912 INFO L290 TraceCheckUtils]: 32: Hoare triple {2077#unseeded} assume 0 == ~st1~0; {2077#unseeded} is VALID [2022-02-21 04:31:17,912 INFO L290 TraceCheckUtils]: 33: Hoare triple {2077#unseeded} assume 0 == ~st2~0; {2077#unseeded} is VALID [2022-02-21 04:31:17,912 INFO L290 TraceCheckUtils]: 34: Hoare triple {2077#unseeded} assume 0 == ~st3~0; {2077#unseeded} is VALID [2022-02-21 04:31:17,913 INFO L290 TraceCheckUtils]: 35: Hoare triple {2077#unseeded} assume 0 == ~nl1~0; {2077#unseeded} is VALID [2022-02-21 04:31:17,913 INFO L290 TraceCheckUtils]: 36: Hoare triple {2077#unseeded} assume 0 == ~nl2~0; {2077#unseeded} is VALID [2022-02-21 04:31:17,914 INFO L290 TraceCheckUtils]: 37: Hoare triple {2077#unseeded} assume 0 == ~nl3~0; {2077#unseeded} is VALID [2022-02-21 04:31:17,914 INFO L290 TraceCheckUtils]: 38: Hoare triple {2077#unseeded} assume 0 == ~mode1~0 % 256; {2077#unseeded} is VALID [2022-02-21 04:31:17,914 INFO L290 TraceCheckUtils]: 39: Hoare triple {2077#unseeded} assume 0 == ~mode2~0 % 256; {2077#unseeded} is VALID [2022-02-21 04:31:17,914 INFO L290 TraceCheckUtils]: 40: Hoare triple {2077#unseeded} assume 0 == ~mode3~0 % 256; {2077#unseeded} is VALID [2022-02-21 04:31:17,915 INFO L290 TraceCheckUtils]: 41: Hoare triple {2077#unseeded} assume 0 != ~newmax1~0 % 256; {2077#unseeded} is VALID [2022-02-21 04:31:17,915 INFO L290 TraceCheckUtils]: 42: Hoare triple {2077#unseeded} assume 0 != ~newmax2~0 % 256; {2077#unseeded} is VALID [2022-02-21 04:31:17,915 INFO L290 TraceCheckUtils]: 43: Hoare triple {2077#unseeded} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {2077#unseeded} is VALID [2022-02-21 04:31:17,916 INFO L290 TraceCheckUtils]: 44: Hoare triple {2077#unseeded} init_#res#1 := init_~tmp___5~0#1; {2077#unseeded} is VALID [2022-02-21 04:31:17,916 INFO L290 TraceCheckUtils]: 45: Hoare triple {2077#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;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2077#unseeded} is VALID [2022-02-21 04:31:17,916 INFO L290 TraceCheckUtils]: 46: Hoare triple {2077#unseeded} assume !(0 == assume_abort_if_not_~cond#1); {2077#unseeded} is VALID [2022-02-21 04:31:17,917 INFO L290 TraceCheckUtils]: 47: Hoare triple {2077#unseeded} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~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; {2077#unseeded} is VALID [2022-02-21 04:31:17,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:17,943 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:31:17,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:17,958 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:31:18,249 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:18,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {2080#(>= 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; {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:18,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(0 != ~mode1~0 % 256); {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:18,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume ~r1~0 < 2; {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:18,279 INFO L290 TraceCheckUtils]: 3: Hoare triple {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(0 != ~ep12~0 % 256); {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:18,280 INFO L290 TraceCheckUtils]: 4: Hoare triple {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(0 != ~ep13~0 % 256); {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:18,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} ~mode1~0 := 1; {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:18,281 INFO L290 TraceCheckUtils]: 6: Hoare triple {2236#(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; {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:18,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(0 != ~mode2~0 % 256); {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:18,282 INFO L290 TraceCheckUtils]: 8: Hoare triple {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(~r2~0 < 2); {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:18,282 INFO L290 TraceCheckUtils]: 9: Hoare triple {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} ~mode2~0 := 1; {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:18,283 INFO L290 TraceCheckUtils]: 10: Hoare triple {2236#(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; {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:18,283 INFO L290 TraceCheckUtils]: 11: Hoare triple {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(0 != ~mode3~0 % 256); {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:18,284 INFO L290 TraceCheckUtils]: 12: Hoare triple {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(~r3~0 < 2); {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:18,284 INFO L290 TraceCheckUtils]: 13: Hoare triple {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} ~mode3~0 := 1; {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:18,286 INFO L290 TraceCheckUtils]: 14: Hoare triple {2236#(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; {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:18,289 INFO L290 TraceCheckUtils]: 15: Hoare triple {2236#(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; {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:18,290 INFO L290 TraceCheckUtils]: 16: Hoare triple {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume ~st1~0 + ~nl1~0 <= 1; {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:18,296 INFO L290 TraceCheckUtils]: 17: Hoare triple {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume ~st2~0 + ~nl2~0 <= 1; {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:18,298 INFO L290 TraceCheckUtils]: 18: Hoare triple {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume ~st3~0 + ~nl3~0 <= 1; {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:18,298 INFO L290 TraceCheckUtils]: 19: Hoare triple {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(~r1~0 >= 2); {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:18,299 INFO L290 TraceCheckUtils]: 20: Hoare triple {2236#(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; {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:18,300 INFO L290 TraceCheckUtils]: 21: Hoare triple {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume ~r1~0 < 2; {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:18,300 INFO L290 TraceCheckUtils]: 22: Hoare triple {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(~r1~0 >= 2); {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:18,301 INFO L290 TraceCheckUtils]: 23: Hoare triple {2236#(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; {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:18,303 INFO L290 TraceCheckUtils]: 24: Hoare triple {2236#(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; {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:18,304 INFO L290 TraceCheckUtils]: 25: Hoare triple {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} check_#res#1 := check_~tmp~1#1; {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:18,305 INFO L290 TraceCheckUtils]: 26: Hoare triple {2236#(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; {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:18,305 INFO L290 TraceCheckUtils]: 27: Hoare triple {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(0 == assert_~arg#1 % 256); {2236#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:18,306 INFO L290 TraceCheckUtils]: 28: Hoare triple {2236#(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; {2090#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11))))} is VALID [2022-02-21 04:31:18,306 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:18,307 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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:18,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:31:18,336 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,337 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,340 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:18,341 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 194 states and 287 transitions. cyclomatic complexity: 94 Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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:18,575 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 194 states and 287 transitions. cyclomatic complexity: 94. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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 327 states and 496 transitions. Complement of second has 4 states. [2022-02-21 04:31:18,575 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:18,575 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:31:18,576 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 194 states and 287 transitions. cyclomatic complexity: 94 [2022-02-21 04:31:18,576 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:31:18,576 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:31:18,576 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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:18,581 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:31:18,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:31:18,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:31:18,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 327 states and 496 transitions. [2022-02-21 04:31:18,585 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:31:18,585 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:31:18,587 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 194 states and 287 transitions. cyclomatic complexity: 94 [2022-02-21 04:31:18,642 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 134 examples of accepted words. [2022-02-21 04:31:18,642 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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:18,645 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:31:18,646 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:31:18,646 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 327 states and 496 transitions. cyclomatic complexity: 170 [2022-02-21 04:31:18,646 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 327 states and 496 transitions. cyclomatic complexity: 170 [2022-02-21 04:31:18,646 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:31:18,646 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:31:18,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 48 letters. Loop has 29 letters. [2022-02-21 04:31:18,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 48 letters. Loop has 29 letters. [2022-02-21 04:31:18,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:31:18,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:31:18,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 327 letters. Loop has 327 letters. [2022-02-21 04:31:18,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 327 letters. Loop has 327 letters. [2022-02-21 04:31:18,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 327 letters. Loop has 327 letters. [2022-02-21 04:31:18,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 194 letters. Loop has 194 letters. [2022-02-21 04:31:18,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 194 letters. Loop has 194 letters. [2022-02-21 04:31:18,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 194 letters. Loop has 194 letters. [2022-02-21 04:31:18,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:31:18,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:31:18,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 67 letters. Loop has 27 letters. [2022-02-21 04:31:18,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 67 letters. Loop has 27 letters. [2022-02-21 04:31:18,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 68 letters. Loop has 27 letters. [2022-02-21 04:31:18,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 68 letters. Loop has 27 letters. [2022-02-21 04:31:18,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 30 letters. [2022-02-21 04:31:18,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 30 letters. [2022-02-21 04:31:18,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 57 letters. Loop has 30 letters. [2022-02-21 04:31:18,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 75 letters. Loop has 27 letters. [2022-02-21 04:31:18,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 75 letters. Loop has 27 letters. [2022-02-21 04:31:18,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 75 letters. Loop has 27 letters. [2022-02-21 04:31:18,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 76 letters. Loop has 27 letters. [2022-02-21 04:31:18,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 76 letters. Loop has 27 letters. [2022-02-21 04:31:18,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 76 letters. Loop has 27 letters. [2022-02-21 04:31:18,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 29 letters. [2022-02-21 04:31:18,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 56 letters. Loop has 29 letters. [2022-02-21 04:31:18,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 30 letters. [2022-02-21 04:31:18,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 56 letters. Loop has 30 letters. [2022-02-21 04:31:18,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 68 letters. Loop has 29 letters. [2022-02-21 04:31:18,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 68 letters. Loop has 29 letters. [2022-02-21 04:31:18,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 69 letters. Loop has 29 letters. [2022-02-21 04:31:18,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 69 letters. Loop has 29 letters. [2022-02-21 04:31:18,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 31 letters. [2022-02-21 04:31:18,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 54 letters. Loop has 31 letters. [2022-02-21 04:31:18,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:31:18,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:31:18,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:31:18,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:31:18,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:31:18,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 27 letters. [2022-02-21 04:31:18,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 59 letters. Loop has 27 letters. [2022-02-21 04:31:18,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 32 letters. [2022-02-21 04:31:18,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 53 letters. Loop has 32 letters. [2022-02-21 04:31:18,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 32 letters. [2022-02-21 04:31:18,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 57 letters. Loop has 32 letters. [2022-02-21 04:31:18,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 51 letters. Loop has 31 letters. [2022-02-21 04:31:18,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 51 letters. Loop has 31 letters. [2022-02-21 04:31:18,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 51 letters. Loop has 30 letters. [2022-02-21 04:31:18,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 51 letters. Loop has 30 letters. [2022-02-21 04:31:18,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 32 letters. [2022-02-21 04:31:18,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 55 letters. Loop has 32 letters. [2022-02-21 04:31:18,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:31:18,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:31:18,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:31:18,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:31:18,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:31:18,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 71 letters. Loop has 29 letters. [2022-02-21 04:31:18,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 29 letters. [2022-02-21 04:31:18,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 71 letters. Loop has 29 letters. [2022-02-21 04:31:18,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 72 letters. Loop has 29 letters. [2022-02-21 04:31:18,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 29 letters. [2022-02-21 04:31:18,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 72 letters. Loop has 29 letters. [2022-02-21 04:31:18,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 33 letters. [2022-02-21 04:31:18,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 33 letters. [2022-02-21 04:31:18,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 57 letters. Loop has 33 letters. [2022-02-21 04:31:18,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 30 letters. [2022-02-21 04:31:18,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 30 letters. [2022-02-21 04:31:18,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 30 letters. [2022-02-21 04:31:18,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 31 letters. [2022-02-21 04:31:18,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 31 letters. [2022-02-21 04:31:18,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 59 letters. Loop has 31 letters. [2022-02-21 04:31:18,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:31:18,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:31:18,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:31:18,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 77 letters. Loop has 27 letters. [2022-02-21 04:31:18,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 77 letters. Loop has 27 letters. [2022-02-21 04:31:18,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 77 letters. Loop has 27 letters. [2022-02-21 04:31:18,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 27 letters. [2022-02-21 04:31:18,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 27 letters. [2022-02-21 04:31:18,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 29 letters. [2022-02-21 04:31:18,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 59 letters. Loop has 29 letters. [2022-02-21 04:31:18,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 74 letters. Loop has 27 letters. [2022-02-21 04:31:18,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 27 letters. [2022-02-21 04:31:18,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 74 letters. Loop has 27 letters. [2022-02-21 04:31:18,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 27 letters. [2022-02-21 04:31:18,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 27 letters. [2022-02-21 04:31:18,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 27 letters. [2022-02-21 04:31:18,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 61 letters. Loop has 27 letters. [2022-02-21 04:31:18,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 52 letters. Loop has 31 letters. [2022-02-21 04:31:18,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 52 letters. Loop has 31 letters. [2022-02-21 04:31:18,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 52 letters. Loop has 30 letters. [2022-02-21 04:31:18,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 52 letters. Loop has 30 letters. [2022-02-21 04:31:18,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 50 letters. Loop has 30 letters. [2022-02-21 04:31:18,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 50 letters. Loop has 30 letters. [2022-02-21 04:31:18,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 72 letters. Loop has 27 letters. [2022-02-21 04:31:18,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 27 letters. [2022-02-21 04:31:18,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 72 letters. Loop has 27 letters. [2022-02-21 04:31:18,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 73 letters. Loop has 27 letters. [2022-02-21 04:31:18,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 27 letters. [2022-02-21 04:31:18,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 73 letters. Loop has 27 letters. [2022-02-21 04:31:18,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:31:18,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:31:18,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:31:18,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 69 letters. Loop has 27 letters. [2022-02-21 04:31:18,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 69 letters. Loop has 27 letters. [2022-02-21 04:31:18,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 32 letters. [2022-02-21 04:31:18,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 56 letters. Loop has 32 letters. [2022-02-21 04:31:18,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 27 letters. [2022-02-21 04:31:18,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 53 letters. Loop has 27 letters. [2022-02-21 04:31:18,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 30 letters. [2022-02-21 04:31:18,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 54 letters. Loop has 30 letters. [2022-02-21 04:31:18,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 30 letters. [2022-02-21 04:31:18,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 53 letters. Loop has 30 letters. [2022-02-21 04:31:18,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 29 letters. [2022-02-21 04:31:18,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 29 letters. [2022-02-21 04:31:18,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 30 letters. [2022-02-21 04:31:18,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 30 letters. [2022-02-21 04:31:18,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 61 letters. Loop has 30 letters. [2022-02-21 04:31:18,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 64 letters. Loop has 27 letters. [2022-02-21 04:31:18,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 64 letters. Loop has 27 letters. [2022-02-21 04:31:18,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:31:18,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:31:18,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:31:18,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 30 letters. [2022-02-21 04:31:18,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 30 letters. [2022-02-21 04:31:18,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 30 letters. [2022-02-21 04:31:18,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 32 letters. [2022-02-21 04:31:18,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 32 letters. [2022-02-21 04:31:18,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 61 letters. Loop has 32 letters. [2022-02-21 04:31:18,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 27 letters. [2022-02-21 04:31:18,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 62 letters. Loop has 27 letters. [2022-02-21 04:31:18,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 63 letters. Loop has 27 letters. [2022-02-21 04:31:18,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 63 letters. Loop has 27 letters. [2022-02-21 04:31:18,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 63 letters. Loop has 34 letters. [2022-02-21 04:31:18,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 34 letters. [2022-02-21 04:31:18,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 63 letters. Loop has 34 letters. [2022-02-21 04:31:18,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 64 letters. Loop has 34 letters. [2022-02-21 04:31:18,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 34 letters. [2022-02-21 04:31:18,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 64 letters. Loop has 34 letters. [2022-02-21 04:31:18,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 50 letters. Loop has 29 letters. [2022-02-21 04:31:18,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 50 letters. Loop has 29 letters. [2022-02-21 04:31:18,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 49 letters. Loop has 29 letters. [2022-02-21 04:31:18,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 49 letters. Loop has 29 letters. [2022-02-21 04:31:18,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 67 letters. Loop has 29 letters. [2022-02-21 04:31:18,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 67 letters. Loop has 29 letters. [2022-02-21 04:31:18,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 76 letters. Loop has 29 letters. [2022-02-21 04:31:18,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 76 letters. Loop has 29 letters. [2022-02-21 04:31:18,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 76 letters. Loop has 29 letters. [2022-02-21 04:31:18,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 66 letters. Loop has 29 letters. [2022-02-21 04:31:18,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 66 letters. Loop has 29 letters. [2022-02-21 04:31:18,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 75 letters. Loop has 29 letters. [2022-02-21 04:31:18,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 75 letters. Loop has 29 letters. [2022-02-21 04:31:18,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 75 letters. Loop has 29 letters. [2022-02-21 04:31:18,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 65 letters. Loop has 29 letters. [2022-02-21 04:31:18,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 65 letters. Loop has 29 letters. [2022-02-21 04:31:18,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 74 letters. Loop has 29 letters. [2022-02-21 04:31:18,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 29 letters. [2022-02-21 04:31:18,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 74 letters. Loop has 29 letters. [2022-02-21 04:31:18,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 64 letters. Loop has 29 letters. [2022-02-21 04:31:18,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 64 letters. Loop has 29 letters. [2022-02-21 04:31:18,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,728 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 73 letters. Loop has 29 letters. [2022-02-21 04:31:18,728 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 29 letters. [2022-02-21 04:31:18,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 73 letters. Loop has 29 letters. [2022-02-21 04:31:18,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 63 letters. Loop has 29 letters. [2022-02-21 04:31:18,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,730 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 63 letters. Loop has 29 letters. [2022-02-21 04:31:18,730 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 29 letters. [2022-02-21 04:31:18,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,731 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,731 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 62 letters. Loop has 29 letters. [2022-02-21 04:31:18,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 29 letters. [2022-02-21 04:31:18,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,732 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,732 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 61 letters. Loop has 29 letters. [2022-02-21 04:31:18,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 64 letters. Loop has 32 letters. [2022-02-21 04:31:18,733 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,733 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 32 letters. [2022-02-21 04:31:18,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 64 letters. Loop has 32 letters. [2022-02-21 04:31:18,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,734 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:31:18,734 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:31:18,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,735 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:31:18,735 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 64 letters. Loop has 33 letters. [2022-02-21 04:31:18,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 33 letters. [2022-02-21 04:31:18,736 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,736 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 64 letters. Loop has 33 letters. [2022-02-21 04:31:18,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 29 letters. [2022-02-21 04:31:18,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,737 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,737 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 29 letters. [2022-02-21 04:31:18,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 31 letters. [2022-02-21 04:31:18,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 31 letters. [2022-02-21 04:31:18,738 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,738 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 61 letters. Loop has 31 letters. [2022-02-21 04:31:18,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 65 letters. Loop has 34 letters. [2022-02-21 04:31:18,739 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,739 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 34 letters. [2022-02-21 04:31:18,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 65 letters. Loop has 34 letters. [2022-02-21 04:31:18,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:31:18,740 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,740 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:31:18,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:31:18,741 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,741 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 64 letters. Loop has 34 letters. [2022-02-21 04:31:18,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 34 letters. [2022-02-21 04:31:18,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,742 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 64 letters. Loop has 34 letters. [2022-02-21 04:31:18,742 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 31 letters. [2022-02-21 04:31:18,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 31 letters. [2022-02-21 04:31:18,743 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,743 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 62 letters. Loop has 31 letters. [2022-02-21 04:31:18,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:31:18,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:31:18,744 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,744 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:31:18,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 29 letters. [2022-02-21 04:31:18,745 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,745 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 59 letters. Loop has 29 letters. [2022-02-21 04:31:18,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:31:18,746 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,746 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:31:18,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:31:18,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,747 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 29 letters. [2022-02-21 04:31:18,747 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 29 letters. [2022-02-21 04:31:18,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,748 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:31:18,748 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:31:18,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:31:18,749 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,749 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 29 letters. [2022-02-21 04:31:18,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,750 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,750 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 57 letters. Loop has 29 letters. [2022-02-21 04:31:18,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:31:18,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,751 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:31:18,751 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:31:18,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,752 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 33 letters. [2022-02-21 04:31:18,752 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 33 letters. [2022-02-21 04:31:18,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,763 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 62 letters. Loop has 33 letters. [2022-02-21 04:31:18,763 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 32 letters. [2022-02-21 04:31:18,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 32 letters. [2022-02-21 04:31:18,764 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,764 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 61 letters. Loop has 32 letters. [2022-02-21 04:31:18,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 33 letters. [2022-02-21 04:31:18,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 33 letters. [2022-02-21 04:31:18,765 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,765 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 33 letters. [2022-02-21 04:31:18,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 33 letters. [2022-02-21 04:31:18,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,766 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 33 letters. [2022-02-21 04:31:18,766 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 61 letters. Loop has 33 letters. [2022-02-21 04:31:18,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:31:18,767 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,767 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:31:18,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:31:18,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 34 letters. [2022-02-21 04:31:18,768 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,768 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 34 letters. [2022-02-21 04:31:18,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 34 letters. [2022-02-21 04:31:18,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,769 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 31 letters. [2022-02-21 04:31:18,769 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 31 letters. [2022-02-21 04:31:18,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 31 letters. [2022-02-21 04:31:18,770 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,770 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 29 letters. [2022-02-21 04:31:18,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,771 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 56 letters. Loop has 29 letters. [2022-02-21 04:31:18,771 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 31 letters. [2022-02-21 04:31:18,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 31 letters. [2022-02-21 04:31:18,772 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,772 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 57 letters. Loop has 31 letters. [2022-02-21 04:31:18,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 34 letters. [2022-02-21 04:31:18,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 34 letters. [2022-02-21 04:31:18,773 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,773 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 61 letters. Loop has 34 letters. [2022-02-21 04:31:18,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 29 letters. [2022-02-21 04:31:18,774 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,774 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 55 letters. Loop has 29 letters. [2022-02-21 04:31:18,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,775 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:31:18,775 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:31:18,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 34 letters. [2022-02-21 04:31:18,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 34 letters. [2022-02-21 04:31:18,777 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,777 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 34 letters. [2022-02-21 04:31:18,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 34 letters. [2022-02-21 04:31:18,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,778 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,778 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 59 letters. Loop has 34 letters. [2022-02-21 04:31:18,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 30 letters. [2022-02-21 04:31:18,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,779 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,779 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 56 letters. Loop has 30 letters. [2022-02-21 04:31:18,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 31 letters. [2022-02-21 04:31:18,780 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,780 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 56 letters. Loop has 31 letters. [2022-02-21 04:31:18,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 30 letters. [2022-02-21 04:31:18,781 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,781 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 55 letters. Loop has 30 letters. [2022-02-21 04:31:18,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,782 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 31 letters. [2022-02-21 04:31:18,782 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 55 letters. Loop has 31 letters. [2022-02-21 04:31:18,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,783 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 70 letters. Loop has 29 letters. [2022-02-21 04:31:18,783 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 70 letters. Loop has 29 letters. [2022-02-21 04:31:18,784 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,784 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 30 letters. [2022-02-21 04:31:18,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 30 letters. [2022-02-21 04:31:18,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 57 letters. Loop has 30 letters. [2022-02-21 04:31:18,785 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,785 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 27 letters. [2022-02-21 04:31:18,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,786 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 55 letters. Loop has 27 letters. [2022-02-21 04:31:18,786 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:31:18,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,787 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,787 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:31:18,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 30 letters. [2022-02-21 04:31:18,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,788 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,788 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 53 letters. Loop has 30 letters. [2022-02-21 04:31:18,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 29 letters. [2022-02-21 04:31:18,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,789 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,789 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 53 letters. Loop has 29 letters. [2022-02-21 04:31:18,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:31:18,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,790 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,790 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:31:18,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 31 letters. [2022-02-21 04:31:18,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,791 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 31 letters. [2022-02-21 04:31:18,791 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 31 letters. [2022-02-21 04:31:18,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 30 letters. [2022-02-21 04:31:18,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,792 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 30 letters. [2022-02-21 04:31:18,792 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 30 letters. [2022-02-21 04:31:18,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 27 letters. [2022-02-21 04:31:18,793 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,793 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 54 letters. Loop has 27 letters. [2022-02-21 04:31:18,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 29 letters. [2022-02-21 04:31:18,794 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,794 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 55 letters. Loop has 29 letters. [2022-02-21 04:31:18,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 65 letters. Loop has 27 letters. [2022-02-21 04:31:18,795 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,795 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 65 letters. Loop has 27 letters. [2022-02-21 04:31:18,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,796 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 66 letters. Loop has 27 letters. [2022-02-21 04:31:18,796 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 66 letters. Loop has 27 letters. [2022-02-21 04:31:18,797 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,797 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 32 letters. [2022-02-21 04:31:18,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 57 letters. Loop has 32 letters. [2022-02-21 04:31:18,798 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,798 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 33 letters. [2022-02-21 04:31:18,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,799 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,799 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 33 letters. [2022-02-21 04:31:18,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:31:18,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,800 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,800 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:31:18,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 70 letters. Loop has 27 letters. [2022-02-21 04:31:18,801 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,801 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 70 letters. Loop has 27 letters. [2022-02-21 04:31:18,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,802 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 71 letters. Loop has 27 letters. [2022-02-21 04:31:18,802 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 71 letters. Loop has 27 letters. [2022-02-21 04:31:18,803 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,803 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 48 letters. Loop has 29 letters. [2022-02-21 04:31:18,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,804 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 48 letters. Loop has 29 letters. [2022-02-21 04:31:18,804 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 51 letters. Loop has 27 letters. [2022-02-21 04:31:18,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,805 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,805 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 51 letters. Loop has 27 letters. [2022-02-21 04:31:18,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 52 letters. Loop has 27 letters. [2022-02-21 04:31:18,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,806 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,806 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 52 letters. Loop has 27 letters. [2022-02-21 04:31:18,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 51 letters. Loop has 29 letters. [2022-02-21 04:31:18,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,807 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,807 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 51 letters. Loop has 29 letters. [2022-02-21 04:31:18,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 52 letters. Loop has 29 letters. [2022-02-21 04:31:18,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,808 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,808 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 52 letters. Loop has 29 letters. [2022-02-21 04:31:18,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 52 letters. Loop has 30 letters. [2022-02-21 04:31:18,809 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,809 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 52 letters. Loop has 30 letters. [2022-02-21 04:31:18,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 30 letters. [2022-02-21 04:31:18,810 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,810 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 54 letters. Loop has 30 letters. [2022-02-21 04:31:18,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,811 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 29 letters. [2022-02-21 04:31:18,811 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 54 letters. Loop has 29 letters. [2022-02-21 04:31:18,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,812 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 27 letters. [2022-02-21 04:31:18,812 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 56 letters. Loop has 27 letters. [2022-02-21 04:31:18,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,813 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 27 letters. [2022-02-21 04:31:18,813 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 57 letters. Loop has 27 letters. [2022-02-21 04:31:18,814 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,814 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 30 letters. [2022-02-21 04:31:18,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 30 letters. [2022-02-21 04:31:18,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 59 letters. Loop has 30 letters. [2022-02-21 04:31:18,815 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,815 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 30 letters. [2022-02-21 04:31:18,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 30 letters. [2022-02-21 04:31:18,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,816 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 30 letters. [2022-02-21 04:31:18,816 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 31 letters. [2022-02-21 04:31:18,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 31 letters. [2022-02-21 04:31:18,817 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,817 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 31 letters. [2022-02-21 04:31:18,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 30 letters. [2022-02-21 04:31:18,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 30 letters. [2022-02-21 04:31:18,818 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,818 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 61 letters. Loop has 30 letters. [2022-02-21 04:31:18,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 30 letters. [2022-02-21 04:31:18,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 30 letters. [2022-02-21 04:31:18,819 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,819 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 62 letters. Loop has 30 letters. [2022-02-21 04:31:18,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 31 letters. [2022-02-21 04:31:18,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,820 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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 31 letters. [2022-02-21 04:31:18,820 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 62 letters. Loop has 31 letters. [2022-02-21 04:31:18,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 194 states and 287 transitions. cyclomatic complexity: 94 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:31:18,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states 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:18,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 327 states and 496 transitions. cyclomatic complexity: 170 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:31:18,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,822 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:31:18,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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:18,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2022-02-21 04:31:18,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 201 transitions. Stem has 48 letters. Loop has 29 letters. [2022-02-21 04:31:18,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 201 transitions. Stem has 77 letters. Loop has 29 letters. [2022-02-21 04:31:18,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 201 transitions. Stem has 48 letters. Loop has 58 letters. [2022-02-21 04:31:18,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:18,826 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 327 states and 496 transitions. cyclomatic complexity: 170 [2022-02-21 04:31:18,836 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:31:18,836 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 327 states to 0 states and 0 transitions. [2022-02-21 04:31:18,836 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:31:18,837 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:31:18,837 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:31:18,837 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:31:18,837 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:31:18,837 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:31:18,837 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:31:18,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:31:18,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:31:18,838 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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:18,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:18,838 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 04:31:18,838 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 04:31:18,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 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:18,893 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:31:18,894 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-02-21 04:31:18,894 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:31:18,894 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 04:31:18,894 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:31:18,894 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:31:18,894 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:31:18,894 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:31:18,894 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:31:18,895 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:31:18,895 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:31:18,895 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:31:18,895 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:31:18,895 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:31:18,895 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:31:18,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:31:18 BoogieIcfgContainer [2022-02-21 04:31:18,901 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:31:18,902 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:31:18,902 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:31:18,902 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:31:18,903 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:11" (3/4) ... [2022-02-21 04:31:18,905 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:31:18,905 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:31:18,906 INFO L158 Benchmark]: Toolchain (without parser) took 8530.05ms. Allocated memory was 88.1MB in the beginning and 167.8MB in the end (delta: 79.7MB). Free memory was 48.7MB in the beginning and 101.8MB in the end (delta: -53.1MB). Peak memory consumption was 27.3MB. Max. memory is 16.1GB. [2022-02-21 04:31:18,906 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 88.1MB. Free memory is still 65.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:31:18,907 INFO L158 Benchmark]: CACSL2BoogieTranslator took 365.89ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 48.5MB in the beginning and 73.3MB in the end (delta: -24.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 04:31:18,907 INFO L158 Benchmark]: Boogie Procedure Inliner took 94.36ms. Allocated memory is still 107.0MB. Free memory was 73.3MB in the beginning and 69.6MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:31:18,907 INFO L158 Benchmark]: Boogie Preprocessor took 74.87ms. Allocated memory is still 107.0MB. Free memory was 69.6MB in the beginning and 67.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 04:31:18,908 INFO L158 Benchmark]: RCFGBuilder took 731.13ms. Allocated memory is still 107.0MB. Free memory was 67.0MB in the beginning and 80.2MB in the end (delta: -13.2MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. [2022-02-21 04:31:18,908 INFO L158 Benchmark]: BuchiAutomizer took 7251.63ms. Allocated memory was 107.0MB in the beginning and 167.8MB in the end (delta: 60.8MB). Free memory was 80.2MB in the beginning and 102.9MB in the end (delta: -22.7MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. [2022-02-21 04:31:18,908 INFO L158 Benchmark]: Witness Printer took 3.21ms. Allocated memory is still 167.8MB. Free memory was 102.9MB in the beginning and 101.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:31:18,909 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.20ms. Allocated memory is still 88.1MB. Free memory is still 65.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 365.89ms. Allocated memory was 88.1MB in the beginning and 107.0MB in the end (delta: 18.9MB). Free memory was 48.5MB in the beginning and 73.3MB in the end (delta: -24.8MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 94.36ms. Allocated memory is still 107.0MB. Free memory was 73.3MB in the beginning and 69.6MB in the end (delta: 3.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.87ms. Allocated memory is still 107.0MB. Free memory was 69.6MB in the beginning and 67.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 731.13ms. Allocated memory is still 107.0MB. Free memory was 67.0MB in the beginning and 80.2MB in the end (delta: -13.2MB). Peak memory consumption was 35.5MB. Max. memory is 16.1GB. * BuchiAutomizer took 7251.63ms. Allocated memory was 107.0MB in the beginning and 167.8MB in the end (delta: 60.8MB). Free memory was 80.2MB in the beginning and 102.9MB in the end (delta: -22.7MB). Peak memory consumption was 38.2MB. Max. memory is 16.1GB. * Witness Printer took 3.21ms. Allocated memory is still 167.8MB. Free memory was 102.9MB in the beginning and 101.8MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. 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 7.1s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 4.2s. Construction of modules took 0.0s. Büchi inclusion checks took 2.5s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 194 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 279 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 279 mSDsluCounter, 2539 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1671 mSDsCounter, 47 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 46 IncrementalHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 47 mSolverCounterUnsat, 868 mSDtfsCounter, 46 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: 37ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.3s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 04:31:18,943 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