./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash bed48b88780a9161d07013a5b96d251b4e7830e1504dd411292edd1687355823 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:27:07,208 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:27:07,209 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:27:07,264 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:27:07,265 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:27:07,268 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:27:07,270 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:27:07,274 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:27:07,275 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:27:07,276 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:27:07,277 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:27:07,278 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:27:07,278 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:27:07,281 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:27:07,283 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:27:07,284 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:27:07,285 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:27:07,286 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:27:07,287 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:27:07,290 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:27:07,293 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:27:07,294 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:27:07,294 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:27:07,295 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:27:07,299 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:27:07,302 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:27:07,302 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:27:07,302 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:27:07,303 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:27:07,304 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:27:07,304 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:27:07,304 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:27:07,305 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:27:07,306 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:27:07,307 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:27:07,307 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:27:07,308 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:27:07,308 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:27:07,308 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:27:07,309 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:27:07,309 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:27:07,310 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:27:07,329 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:27:07,334 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:27:07,334 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:27:07,334 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:27:07,335 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:27:07,335 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:27:07,336 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:27:07,336 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:27:07,336 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:27:07,336 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:27:07,337 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:27:07,337 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:27:07,337 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:27:07,337 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:27:07,337 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:27:07,337 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:27:07,338 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:27:07,338 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:27:07,338 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:27:07,338 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:27:07,338 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:27:07,338 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:27:07,338 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:27:07,339 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:27:07,339 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:27:07,339 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:27:07,339 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:27:07,340 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:27:07,340 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:27:07,340 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:27:07,340 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:27:07,342 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:27:07,342 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 -> bed48b88780a9161d07013a5b96d251b4e7830e1504dd411292edd1687355823 [2022-02-21 04:27:07,538 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:27:07,563 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:27:07,565 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:27:07,566 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:27:07,566 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:27:07,567 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c [2022-02-21 04:27:07,612 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1effa55ba/f82d41fd239f4a23b5c4723d66440a9c/FLAGa2a1322bc [2022-02-21 04:27:08,012 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:27:08,012 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c [2022-02-21 04:27:08,030 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1effa55ba/f82d41fd239f4a23b5c4723d66440a9c/FLAGa2a1322bc [2022-02-21 04:27:08,040 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1effa55ba/f82d41fd239f4a23b5c4723d66440a9c [2022-02-21 04:27:08,042 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:27:08,043 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:27:08,044 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:27:08,044 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:27:08,057 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:27:08,058 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:27:08" (1/1) ... [2022-02-21 04:27:08,059 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3133cb20 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:08, skipping insertion in model container [2022-02-21 04:27:08,059 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:27:08" (1/1) ... [2022-02-21 04:27:08,063 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:27:08,092 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:27:08,405 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c[28194,28207] [2022-02-21 04:27:08,406 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:27:08,411 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:27:08,486 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_floodmax.4.4.ufo.BOUNDED-8.pals.c[28194,28207] [2022-02-21 04:27:08,486 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:27:08,511 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:27:08,511 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:08 WrapperNode [2022-02-21 04:27:08,511 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:27:08,512 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:27:08,512 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:27:08,512 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:27:08,517 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:08" (1/1) ... [2022-02-21 04:27:08,526 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:08" (1/1) ... [2022-02-21 04:27:08,571 INFO L137 Inliner]: procedures = 23, calls = 15, calls flagged for inlining = 10, calls inlined = 10, statements flattened = 925 [2022-02-21 04:27:08,571 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:27:08,572 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:27:08,572 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:27:08,572 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:27:08,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:08" (1/1) ... [2022-02-21 04:27:08,582 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:08" (1/1) ... [2022-02-21 04:27:08,588 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:08" (1/1) ... [2022-02-21 04:27:08,589 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:08" (1/1) ... [2022-02-21 04:27:08,600 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:08" (1/1) ... [2022-02-21 04:27:08,608 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:08" (1/1) ... [2022-02-21 04:27:08,611 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:08" (1/1) ... [2022-02-21 04:27:08,614 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:27:08,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:27:08,637 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:27:08,637 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:27:08,647 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:08" (1/1) ... [2022-02-21 04:27:08,654 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:08,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:08,669 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:08,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 04:27:08,709 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:27:08,709 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:27:08,709 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:27:08,709 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:27:08,831 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:27:08,834 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:27:09,522 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:27:09,529 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:27:09,530 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 04:27:09,531 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:27:09 BoogieIcfgContainer [2022-02-21 04:27:09,531 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:27:09,532 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:27:09,532 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:27:09,534 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:27:09,535 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:27:09,535 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:27:08" (1/3) ... [2022-02-21 04:27:09,535 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9a058b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:27:09, skipping insertion in model container [2022-02-21 04:27:09,536 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:27:09,536 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:27:08" (2/3) ... [2022-02-21 04:27:09,536 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@9a058b1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:27:09, skipping insertion in model container [2022-02-21 04:27:09,536 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:27:09,536 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:27:09" (3/3) ... [2022-02-21 04:27:09,537 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_floodmax.4.4.ufo.BOUNDED-8.pals.c [2022-02-21 04:27:09,562 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:27:09,563 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:27:09,563 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:27:09,563 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:27:09,563 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:27:09,563 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:27:09,563 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:27:09,563 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:27:09,585 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 303 states, 302 states have (on average 1.804635761589404) internal successors, (545), 302 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:27:09,641 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 107 [2022-02-21 04:27:09,642 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:27:09,642 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:27:09,649 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:27:09,649 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:27:09,649 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:27:09,655 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 303 states, 302 states have (on average 1.804635761589404) internal successors, (545), 302 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:27:09,680 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 107 [2022-02-21 04:27:09,680 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:27:09,680 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:27:09,682 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:27:09,682 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:27:09,688 INFO L791 eck$LassoCheckResult]: Stem: 293#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0; 204#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~nondet55#1, main_#t~ret56#1, main_#t~ret57#1, main_#t~post58#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~ep13~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~ep14~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~ep21~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~ep23~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~ep24~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~ep31~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~ep32~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~ep34~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~ep41~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep42~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep43~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id1~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~r1~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st1~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~nl1~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~m1~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~max1~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode1~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~id2~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~r2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~nl2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~m2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~max2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~mode2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~r3~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~st3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~nl3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~m3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~max3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~mode3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~id4~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~r4~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~st4~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~nl4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~m4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~max4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~mode4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0; 176#L393true assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 132#L404true init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 296#L414true assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 277#L425true init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 261#L435true assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; 275#L446true init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 121#L456true assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; 150#L467true init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 193#L477true assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; 67#L488true init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 85#L498true assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; 47#L509true init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 246#L519true assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; 44#L530true init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); 187#L540true assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; 194#L551true init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); 69#L561true assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; 117#L572true init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); 300#L582true assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; 74#L593true init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); 292#L603true assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; 203#L614true init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); 206#L624true assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; 24#L635true init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); 158#L645true assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; 103#L656true init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); 170#L666true assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; 8#L677true init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); 55#L687true assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; 262#L698true init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); 12#L708true assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; 233#L719true init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); 201#L729true assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; 210#L740true init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); 273#L750true assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; 98#L761true init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); 265#L771true assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; 140#L782true init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); 169#L792true assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; 22#L803true init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); 45#L813true assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; 267#L824true init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); 131#L834true assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; 134#L845true init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); 14#L855true assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; 167#L866true init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); 97#L876true assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; 143#L887true init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); 164#L897true assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; 122#L897-1true init_#res#1 := init_~tmp___23~0#1; 305#L1066true main_#t~ret56#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret56#1;havoc main_#t~ret56#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 108#L21true assume !(0 == assume_abort_if_not_~cond#1); 173#L20true assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 101#L1203-2true [2022-02-21 04:27:09,692 INFO L793 eck$LassoCheckResult]: Loop: 101#L1203-2true assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1; 124#L109true assume !(0 != ~mode1~0 % 256); 46#L141true assume !(~r1~0 < 2); 285#L141-1true ~mode1~0 := 1; 146#L109-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1; 197#L162true assume !(0 != ~mode2~0 % 256); 263#L194true assume !(~r2~0 < 3); 6#L194-1true ~mode2~0 := 1; 58#L162-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1; 155#L215true assume !(0 != ~mode3~0 % 256); 119#L247true assume !(~r3~0 < 3); 286#L247-1true ~mode3~0 := 1; 294#L215-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1; 182#L268true assume !(0 != ~mode4~0 % 256); 231#L300true assume !(~r4~0 < 3); 48#L300-1true ~mode4~0 := 1; 270#L268-2true assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 200#L1074true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; 195#L1074-1true check_#res#1 := check_~tmp~1#1; 253#L1126true main_#t~ret57#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret57#1;havoc main_#t~ret57#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 43#L1246true assume !(0 == assert_~arg#1 % 256); 36#L1241true assume { :end_inline_assert } true;main_#t~post58#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post58#1;havoc main_#t~post58#1; 101#L1203-2true [2022-02-21 04:27:09,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:27:09,703 INFO L85 PathProgramCache]: Analyzing trace with hash 2041231622, now seen corresponding path program 1 times [2022-02-21 04:27:09,708 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:27:09,709 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626447576] [2022-02-21 04:27:09,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:27:09,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:27:09,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:27:09,976 INFO L290 TraceCheckUtils]: 0: Hoare triple {307#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0; {307#true} is VALID [2022-02-21 04:27:09,976 INFO L290 TraceCheckUtils]: 1: Hoare triple {307#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~nondet55#1, main_#t~ret56#1, main_#t~ret57#1, main_#t~post58#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~ep13~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~ep14~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~ep21~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~ep23~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~ep24~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~ep31~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~ep32~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~ep34~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~ep41~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep42~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep43~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id1~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~r1~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st1~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~nl1~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~m1~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~max1~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode1~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~id2~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~r2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~nl2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~m2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~max2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~mode2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~r3~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~st3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~nl3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~m3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~max3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~mode3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~id4~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~r4~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~st4~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~nl4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~m4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~max4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~mode4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0; {307#true} is VALID [2022-02-21 04:27:09,977 INFO L290 TraceCheckUtils]: 2: Hoare triple {307#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:09,977 INFO L290 TraceCheckUtils]: 3: Hoare triple {307#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:09,977 INFO L290 TraceCheckUtils]: 4: Hoare triple {307#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:09,977 INFO L290 TraceCheckUtils]: 5: Hoare triple {307#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:09,977 INFO L290 TraceCheckUtils]: 6: Hoare triple {307#true} assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:09,978 INFO L290 TraceCheckUtils]: 7: Hoare triple {307#true} init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:09,978 INFO L290 TraceCheckUtils]: 8: Hoare triple {307#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:09,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {307#true} init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:09,979 INFO L290 TraceCheckUtils]: 10: Hoare triple {307#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:09,979 INFO L290 TraceCheckUtils]: 11: Hoare triple {307#true} init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:09,979 INFO L290 TraceCheckUtils]: 12: Hoare triple {307#true} assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:09,979 INFO L290 TraceCheckUtils]: 13: Hoare triple {307#true} init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:09,979 INFO L290 TraceCheckUtils]: 14: Hoare triple {307#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:09,979 INFO L290 TraceCheckUtils]: 15: Hoare triple {307#true} init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:09,980 INFO L290 TraceCheckUtils]: 16: Hoare triple {307#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:09,980 INFO L290 TraceCheckUtils]: 17: Hoare triple {307#true} init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:09,980 INFO L290 TraceCheckUtils]: 18: Hoare triple {307#true} assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:09,980 INFO L290 TraceCheckUtils]: 19: Hoare triple {307#true} init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:09,980 INFO L290 TraceCheckUtils]: 20: Hoare triple {307#true} assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:09,981 INFO L290 TraceCheckUtils]: 21: Hoare triple {307#true} init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:09,982 INFO L290 TraceCheckUtils]: 22: Hoare triple {307#true} assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:09,982 INFO L290 TraceCheckUtils]: 23: Hoare triple {307#true} init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:09,982 INFO L290 TraceCheckUtils]: 24: Hoare triple {307#true} assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:09,982 INFO L290 TraceCheckUtils]: 25: Hoare triple {307#true} init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:09,982 INFO L290 TraceCheckUtils]: 26: Hoare triple {307#true} assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:09,982 INFO L290 TraceCheckUtils]: 27: Hoare triple {307#true} init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:09,983 INFO L290 TraceCheckUtils]: 28: Hoare triple {307#true} assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:09,983 INFO L290 TraceCheckUtils]: 29: Hoare triple {307#true} init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:09,983 INFO L290 TraceCheckUtils]: 30: Hoare triple {307#true} assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:09,983 INFO L290 TraceCheckUtils]: 31: Hoare triple {307#true} init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:09,983 INFO L290 TraceCheckUtils]: 32: Hoare triple {307#true} assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:09,984 INFO L290 TraceCheckUtils]: 33: Hoare triple {307#true} init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:09,984 INFO L290 TraceCheckUtils]: 34: Hoare triple {307#true} assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:09,984 INFO L290 TraceCheckUtils]: 35: Hoare triple {307#true} init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:09,984 INFO L290 TraceCheckUtils]: 36: Hoare triple {307#true} assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:09,984 INFO L290 TraceCheckUtils]: 37: Hoare triple {307#true} init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:09,985 INFO L290 TraceCheckUtils]: 38: Hoare triple {307#true} assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:09,985 INFO L290 TraceCheckUtils]: 39: Hoare triple {307#true} init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:09,985 INFO L290 TraceCheckUtils]: 40: Hoare triple {307#true} assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:09,985 INFO L290 TraceCheckUtils]: 41: Hoare triple {307#true} init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:09,986 INFO L290 TraceCheckUtils]: 42: Hoare triple {307#true} assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:09,986 INFO L290 TraceCheckUtils]: 43: Hoare triple {307#true} init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:09,986 INFO L290 TraceCheckUtils]: 44: Hoare triple {307#true} assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:09,986 INFO L290 TraceCheckUtils]: 45: Hoare triple {307#true} init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:09,987 INFO L290 TraceCheckUtils]: 46: Hoare triple {307#true} assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:09,987 INFO L290 TraceCheckUtils]: 47: Hoare triple {307#true} init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:09,987 INFO L290 TraceCheckUtils]: 48: Hoare triple {307#true} assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; {307#true} is VALID [2022-02-21 04:27:09,990 INFO L290 TraceCheckUtils]: 49: Hoare triple {307#true} init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); {307#true} is VALID [2022-02-21 04:27:09,991 INFO L290 TraceCheckUtils]: 50: Hoare triple {307#true} assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; {309#(= |ULTIMATE.start_init_~tmp___23~0#1| 0)} is VALID [2022-02-21 04:27:09,991 INFO L290 TraceCheckUtils]: 51: Hoare triple {309#(= |ULTIMATE.start_init_~tmp___23~0#1| 0)} init_#res#1 := init_~tmp___23~0#1; {310#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:27:09,994 INFO L290 TraceCheckUtils]: 52: Hoare triple {310#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret56#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret56#1;havoc main_#t~ret56#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {311#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:27:09,994 INFO L290 TraceCheckUtils]: 53: Hoare triple {311#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {308#false} is VALID [2022-02-21 04:27:09,995 INFO L290 TraceCheckUtils]: 54: Hoare triple {308#false} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {308#false} is VALID [2022-02-21 04:27:09,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:27:09,996 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:27:09,996 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626447576] [2022-02-21 04:27:09,997 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626447576] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:27:09,998 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:27:09,998 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:27:09,999 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1199159145] [2022-02-21 04:27:10,000 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:27:10,003 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:27:10,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:27:10,010 INFO L85 PathProgramCache]: Analyzing trace with hash -1319514639, now seen corresponding path program 1 times [2022-02-21 04:27:10,010 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:27:10,010 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [610592839] [2022-02-21 04:27:10,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:27:10,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:27:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:27:10,171 INFO L290 TraceCheckUtils]: 0: Hoare triple {312#true} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1; {312#true} is VALID [2022-02-21 04:27:10,172 INFO L290 TraceCheckUtils]: 1: Hoare triple {312#true} assume !(0 != ~mode1~0 % 256); {312#true} is VALID [2022-02-21 04:27:10,172 INFO L290 TraceCheckUtils]: 2: Hoare triple {312#true} assume !(~r1~0 < 2); {312#true} is VALID [2022-02-21 04:27:10,176 INFO L290 TraceCheckUtils]: 3: Hoare triple {312#true} ~mode1~0 := 1; {312#true} is VALID [2022-02-21 04:27:10,176 INFO L290 TraceCheckUtils]: 4: Hoare triple {312#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1; {312#true} is VALID [2022-02-21 04:27:10,177 INFO L290 TraceCheckUtils]: 5: Hoare triple {312#true} assume !(0 != ~mode2~0 % 256); {312#true} is VALID [2022-02-21 04:27:10,177 INFO L290 TraceCheckUtils]: 6: Hoare triple {312#true} assume !(~r2~0 < 3); {312#true} is VALID [2022-02-21 04:27:10,177 INFO L290 TraceCheckUtils]: 7: Hoare triple {312#true} ~mode2~0 := 1; {312#true} is VALID [2022-02-21 04:27:10,177 INFO L290 TraceCheckUtils]: 8: Hoare triple {312#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1; {312#true} is VALID [2022-02-21 04:27:10,178 INFO L290 TraceCheckUtils]: 9: Hoare triple {312#true} assume !(0 != ~mode3~0 % 256); {312#true} is VALID [2022-02-21 04:27:10,178 INFO L290 TraceCheckUtils]: 10: Hoare triple {312#true} assume !(~r3~0 < 3); {312#true} is VALID [2022-02-21 04:27:10,178 INFO L290 TraceCheckUtils]: 11: Hoare triple {312#true} ~mode3~0 := 1; {312#true} is VALID [2022-02-21 04:27:10,178 INFO L290 TraceCheckUtils]: 12: Hoare triple {312#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1; {312#true} is VALID [2022-02-21 04:27:10,179 INFO L290 TraceCheckUtils]: 13: Hoare triple {312#true} assume !(0 != ~mode4~0 % 256); {312#true} is VALID [2022-02-21 04:27:10,179 INFO L290 TraceCheckUtils]: 14: Hoare triple {312#true} assume !(~r4~0 < 3); {312#true} is VALID [2022-02-21 04:27:10,179 INFO L290 TraceCheckUtils]: 15: Hoare triple {312#true} ~mode4~0 := 1; {312#true} is VALID [2022-02-21 04:27:10,179 INFO L290 TraceCheckUtils]: 16: Hoare triple {312#true} assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {312#true} is VALID [2022-02-21 04:27:10,180 INFO L290 TraceCheckUtils]: 17: Hoare triple {312#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1);check_~tmp~1#1 := 0; {314#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:27:10,180 INFO L290 TraceCheckUtils]: 18: Hoare triple {314#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {315#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:27:10,181 INFO L290 TraceCheckUtils]: 19: Hoare triple {315#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret57#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret57#1;havoc main_#t~ret57#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {316#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} is VALID [2022-02-21 04:27:10,182 INFO L290 TraceCheckUtils]: 20: Hoare triple {316#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} assume !(0 == assert_~arg#1 % 256); {313#false} is VALID [2022-02-21 04:27:10,182 INFO L290 TraceCheckUtils]: 21: Hoare triple {313#false} assume { :end_inline_assert } true;main_#t~post58#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post58#1;havoc main_#t~post58#1; {313#false} is VALID [2022-02-21 04:27:10,182 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:27:10,183 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:27:10,183 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [610592839] [2022-02-21 04:27:10,183 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [610592839] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:27:10,183 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:27:10,184 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:27:10,184 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531244060] [2022-02-21 04:27:10,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:27:10,185 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:27:10,185 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:27:10,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:27:10,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:27:10,208 INFO L87 Difference]: Start difference. First operand has 303 states, 302 states have (on average 1.804635761589404) internal successors, (545), 302 states have internal predecessors, (545), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:27:11,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:27:11,178 INFO L93 Difference]: Finished difference Result 307 states and 545 transitions. [2022-02-21 04:27:11,178 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:27:11,179 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.4) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:27:11,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:27:11,206 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 307 states and 545 transitions. [2022-02-21 04:27:11,237 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2022-02-21 04:27:11,271 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 307 states to 298 states and 528 transitions. [2022-02-21 04:27:11,272 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 298 [2022-02-21 04:27:11,273 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 298 [2022-02-21 04:27:11,274 INFO L73 IsDeterministic]: Start isDeterministic. Operand 298 states and 528 transitions. [2022-02-21 04:27:11,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:27:11,277 INFO L681 BuchiCegarLoop]: Abstraction has 298 states and 528 transitions. [2022-02-21 04:27:11,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 298 states and 528 transitions. [2022-02-21 04:27:11,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 298 to 298. [2022-02-21 04:27:11,339 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:27:11,341 INFO L82 GeneralOperation]: Start isEquivalent. First operand 298 states and 528 transitions. Second operand has 298 states, 298 states have (on average 1.7718120805369129) internal successors, (528), 297 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:27:11,342 INFO L74 IsIncluded]: Start isIncluded. First operand 298 states and 528 transitions. Second operand has 298 states, 298 states have (on average 1.7718120805369129) internal successors, (528), 297 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:27:11,344 INFO L87 Difference]: Start difference. First operand 298 states and 528 transitions. Second operand has 298 states, 298 states have (on average 1.7718120805369129) internal successors, (528), 297 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:27:11,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:27:11,384 INFO L93 Difference]: Finished difference Result 298 states and 528 transitions. [2022-02-21 04:27:11,384 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 528 transitions. [2022-02-21 04:27:11,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:27:11,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:27:11,387 INFO L74 IsIncluded]: Start isIncluded. First operand has 298 states, 298 states have (on average 1.7718120805369129) internal successors, (528), 297 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 298 states and 528 transitions. [2022-02-21 04:27:11,388 INFO L87 Difference]: Start difference. First operand has 298 states, 298 states have (on average 1.7718120805369129) internal successors, (528), 297 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 298 states and 528 transitions. [2022-02-21 04:27:11,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:27:11,395 INFO L93 Difference]: Finished difference Result 298 states and 528 transitions. [2022-02-21 04:27:11,395 INFO L276 IsEmpty]: Start isEmpty. Operand 298 states and 528 transitions. [2022-02-21 04:27:11,396 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:27:11,396 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:27:11,396 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:27:11,396 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:27:11,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 298 states, 298 states have (on average 1.7718120805369129) internal successors, (528), 297 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:27:11,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 298 states to 298 states and 528 transitions. [2022-02-21 04:27:11,405 INFO L704 BuchiCegarLoop]: Abstraction has 298 states and 528 transitions. [2022-02-21 04:27:11,405 INFO L587 BuchiCegarLoop]: Abstraction has 298 states and 528 transitions. [2022-02-21 04:27:11,405 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:27:11,405 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 298 states and 528 transitions. [2022-02-21 04:27:11,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 106 [2022-02-21 04:27:11,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:27:11,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:27:11,408 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:27:11,408 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:27:11,408 INFO L791 eck$LassoCheckResult]: Stem: 925#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0; 895#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~nondet55#1, main_#t~ret56#1, main_#t~ret57#1, main_#t~post58#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~ep13~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~ep14~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~ep21~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~ep23~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~ep24~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~ep31~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~ep32~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~ep34~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~ep41~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep42~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep43~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id1~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~r1~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st1~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~nl1~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~m1~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~max1~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode1~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~id2~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~r2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~nl2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~m2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~max2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~mode2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~r3~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~st3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~nl3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~m3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~max3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~mode3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~id4~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~r4~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~st4~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~nl4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~m4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~max4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~mode4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0; 878#L393 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 779#L404 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 848#L414 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 667#L425 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 922#L435 assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; 713#L446 init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 833#L456 assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; 746#L467 init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 862#L477 assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; 756#L488 init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 757#L498 assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; 695#L509 init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 728#L519 assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; 718#L530 init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); 720#L540 assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; 832#L551 init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); 760#L561 assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; 737#L572 init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); 828#L582 assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; 671#L593 init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); 769#L603 assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; 701#L614 init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); 894#L624 assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; 680#L635 init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); 681#L645 assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; 704#L656 init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); 812#L666 assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; 641#L677 init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); 642#L687 assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; 709#L698 init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); 651#L708 assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; 652#L719 init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); 892#L729 assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; 630#L740 init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); 898#L750 assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; 805#L761 init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); 806#L771 assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; 771#L782 init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); 854#L792 assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; 647#L803 init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); 679#L813 assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; 721#L824 init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); 847#L834 assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; 698#L845 init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); 656#L855 assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; 657#L866 init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); 804#L876 assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; 675#L887 init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); 856#L897 assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; 634#L897-1 init_#res#1 := init_~tmp___23~0#1; 834#L1066 main_#t~ret56#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret56#1;havoc main_#t~ret56#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 817#L21 assume !(0 == assume_abort_if_not_~cond#1); 818#L20 assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 707#L1203-2 [2022-02-21 04:27:11,408 INFO L793 eck$LassoCheckResult]: Loop: 707#L1203-2 assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1; 809#L109 assume !(0 != ~mode1~0 % 256); 723#L141 assume !(~r1~0 < 2); 724#L141-1 ~mode1~0 := 1; 858#L109-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1; 859#L162 assume !(0 != ~mode2~0 % 256); 889#L194 assume !(~r2~0 < 3); 636#L194-1 ~mode2~0 := 1; 637#L162-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1; 745#L215 assume !(0 != ~mode3~0 % 256); 829#L247 assume !(~r3~0 < 3); 692#L247-1 ~mode3~0 := 1; 886#L215-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1; 880#L268 assume !(0 != ~mode4~0 % 256); 881#L300 assume !(~r4~0 < 3); 726#L300-1 ~mode4~0 := 1; 727#L268-2 assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 891#L1074 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 837#L1075 assume ~st1~0 + ~nl1~0 <= 1; 838#L1076 assume ~st2~0 + ~nl2~0 <= 1; 861#L1077 assume ~st3~0 + ~nl3~0 <= 1; 735#L1078 assume ~st4~0 + ~nl4~0 <= 1; 648#L1079 assume ~r1~0 >= 3; 650#L1083 assume ~r1~0 < 3; 867#L1088 assume ~r1~0 >= 3; 884#L1093 assume ~r1~0 < 3;check_~tmp~1#1 := 1; 872#L1074-1 check_#res#1 := check_~tmp~1#1; 887#L1126 main_#t~ret57#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret57#1;havoc main_#t~ret57#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 719#L1246 assume !(0 == assert_~arg#1 % 256); 706#L1241 assume { :end_inline_assert } true;main_#t~post58#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post58#1;havoc main_#t~post58#1; 707#L1203-2 [2022-02-21 04:27:11,409 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:27:11,409 INFO L85 PathProgramCache]: Analyzing trace with hash 2041231622, now seen corresponding path program 2 times [2022-02-21 04:27:11,409 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:27:11,409 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392549439] [2022-02-21 04:27:11,410 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:27:11,410 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:27:11,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:27:11,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {1525#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0; {1525#true} is VALID [2022-02-21 04:27:11,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {1525#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~nondet55#1, main_#t~ret56#1, main_#t~ret57#1, main_#t~post58#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~ep13~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~ep14~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~ep21~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~ep23~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~ep24~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~ep31~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~ep32~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~ep34~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~ep41~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep42~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep43~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id1~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~r1~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st1~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~nl1~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~m1~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~max1~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode1~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~id2~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~r2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~nl2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~m2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~max2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~mode2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~r3~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~st3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~nl3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~m3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~max3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~mode3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~id4~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~r4~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~st4~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~nl4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~m4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~max4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~mode4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0; {1525#true} is VALID [2022-02-21 04:27:11,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {1525#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:11,521 INFO L290 TraceCheckUtils]: 3: Hoare triple {1525#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:11,521 INFO L290 TraceCheckUtils]: 4: Hoare triple {1525#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:11,521 INFO L290 TraceCheckUtils]: 5: Hoare triple {1525#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:11,521 INFO L290 TraceCheckUtils]: 6: Hoare triple {1525#true} assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:11,522 INFO L290 TraceCheckUtils]: 7: Hoare triple {1525#true} init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:11,522 INFO L290 TraceCheckUtils]: 8: Hoare triple {1525#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:11,522 INFO L290 TraceCheckUtils]: 9: Hoare triple {1525#true} init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:11,522 INFO L290 TraceCheckUtils]: 10: Hoare triple {1525#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:11,522 INFO L290 TraceCheckUtils]: 11: Hoare triple {1525#true} init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:11,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {1525#true} assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:11,523 INFO L290 TraceCheckUtils]: 13: Hoare triple {1525#true} init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:11,523 INFO L290 TraceCheckUtils]: 14: Hoare triple {1525#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:11,523 INFO L290 TraceCheckUtils]: 15: Hoare triple {1525#true} init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:11,523 INFO L290 TraceCheckUtils]: 16: Hoare triple {1525#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:11,523 INFO L290 TraceCheckUtils]: 17: Hoare triple {1525#true} init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:11,523 INFO L290 TraceCheckUtils]: 18: Hoare triple {1525#true} assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:11,524 INFO L290 TraceCheckUtils]: 19: Hoare triple {1525#true} init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:11,524 INFO L290 TraceCheckUtils]: 20: Hoare triple {1525#true} assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:11,524 INFO L290 TraceCheckUtils]: 21: Hoare triple {1525#true} init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:11,524 INFO L290 TraceCheckUtils]: 22: Hoare triple {1525#true} assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:11,524 INFO L290 TraceCheckUtils]: 23: Hoare triple {1525#true} init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:11,524 INFO L290 TraceCheckUtils]: 24: Hoare triple {1525#true} assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:11,525 INFO L290 TraceCheckUtils]: 25: Hoare triple {1525#true} init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:11,525 INFO L290 TraceCheckUtils]: 26: Hoare triple {1525#true} assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:11,525 INFO L290 TraceCheckUtils]: 27: Hoare triple {1525#true} init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:11,525 INFO L290 TraceCheckUtils]: 28: Hoare triple {1525#true} assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:11,525 INFO L290 TraceCheckUtils]: 29: Hoare triple {1525#true} init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:11,526 INFO L290 TraceCheckUtils]: 30: Hoare triple {1525#true} assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:11,526 INFO L290 TraceCheckUtils]: 31: Hoare triple {1525#true} init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:11,526 INFO L290 TraceCheckUtils]: 32: Hoare triple {1525#true} assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:11,526 INFO L290 TraceCheckUtils]: 33: Hoare triple {1525#true} init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:11,526 INFO L290 TraceCheckUtils]: 34: Hoare triple {1525#true} assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:11,526 INFO L290 TraceCheckUtils]: 35: Hoare triple {1525#true} init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:11,527 INFO L290 TraceCheckUtils]: 36: Hoare triple {1525#true} assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:11,527 INFO L290 TraceCheckUtils]: 37: Hoare triple {1525#true} init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:11,527 INFO L290 TraceCheckUtils]: 38: Hoare triple {1525#true} assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:11,527 INFO L290 TraceCheckUtils]: 39: Hoare triple {1525#true} init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:11,527 INFO L290 TraceCheckUtils]: 40: Hoare triple {1525#true} assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:11,527 INFO L290 TraceCheckUtils]: 41: Hoare triple {1525#true} init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:11,528 INFO L290 TraceCheckUtils]: 42: Hoare triple {1525#true} assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:11,528 INFO L290 TraceCheckUtils]: 43: Hoare triple {1525#true} init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:11,528 INFO L290 TraceCheckUtils]: 44: Hoare triple {1525#true} assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:11,528 INFO L290 TraceCheckUtils]: 45: Hoare triple {1525#true} init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:11,528 INFO L290 TraceCheckUtils]: 46: Hoare triple {1525#true} assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:11,529 INFO L290 TraceCheckUtils]: 47: Hoare triple {1525#true} init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:11,529 INFO L290 TraceCheckUtils]: 48: Hoare triple {1525#true} assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; {1525#true} is VALID [2022-02-21 04:27:11,529 INFO L290 TraceCheckUtils]: 49: Hoare triple {1525#true} init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); {1525#true} is VALID [2022-02-21 04:27:11,529 INFO L290 TraceCheckUtils]: 50: Hoare triple {1525#true} assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; {1527#(= |ULTIMATE.start_init_~tmp___23~0#1| 0)} is VALID [2022-02-21 04:27:11,530 INFO L290 TraceCheckUtils]: 51: Hoare triple {1527#(= |ULTIMATE.start_init_~tmp___23~0#1| 0)} init_#res#1 := init_~tmp___23~0#1; {1528#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:27:11,530 INFO L290 TraceCheckUtils]: 52: Hoare triple {1528#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret56#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret56#1;havoc main_#t~ret56#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1529#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:27:11,531 INFO L290 TraceCheckUtils]: 53: Hoare triple {1529#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {1526#false} is VALID [2022-02-21 04:27:11,531 INFO L290 TraceCheckUtils]: 54: Hoare triple {1526#false} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1526#false} is VALID [2022-02-21 04:27:11,531 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:27:11,531 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:27:11,531 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392549439] [2022-02-21 04:27:11,532 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392549439] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:27:11,532 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:27:11,532 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:27:11,532 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960268542] [2022-02-21 04:27:11,532 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:27:11,533 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:27:11,533 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:27:11,533 INFO L85 PathProgramCache]: Analyzing trace with hash 94444480, now seen corresponding path program 1 times [2022-02-21 04:27:11,533 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:27:11,533 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665447604] [2022-02-21 04:27:11,534 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:27:11,534 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:27:11,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:27:11,573 INFO L290 TraceCheckUtils]: 0: Hoare triple {1530#true} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1; {1530#true} is VALID [2022-02-21 04:27:11,573 INFO L290 TraceCheckUtils]: 1: Hoare triple {1530#true} assume !(0 != ~mode1~0 % 256); {1530#true} is VALID [2022-02-21 04:27:11,573 INFO L290 TraceCheckUtils]: 2: Hoare triple {1530#true} assume !(~r1~0 < 2); {1530#true} is VALID [2022-02-21 04:27:11,573 INFO L290 TraceCheckUtils]: 3: Hoare triple {1530#true} ~mode1~0 := 1; {1530#true} is VALID [2022-02-21 04:27:11,573 INFO L290 TraceCheckUtils]: 4: Hoare triple {1530#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1; {1530#true} is VALID [2022-02-21 04:27:11,573 INFO L290 TraceCheckUtils]: 5: Hoare triple {1530#true} assume !(0 != ~mode2~0 % 256); {1530#true} is VALID [2022-02-21 04:27:11,573 INFO L290 TraceCheckUtils]: 6: Hoare triple {1530#true} assume !(~r2~0 < 3); {1530#true} is VALID [2022-02-21 04:27:11,573 INFO L290 TraceCheckUtils]: 7: Hoare triple {1530#true} ~mode2~0 := 1; {1530#true} is VALID [2022-02-21 04:27:11,574 INFO L290 TraceCheckUtils]: 8: Hoare triple {1530#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1; {1530#true} is VALID [2022-02-21 04:27:11,574 INFO L290 TraceCheckUtils]: 9: Hoare triple {1530#true} assume !(0 != ~mode3~0 % 256); {1530#true} is VALID [2022-02-21 04:27:11,574 INFO L290 TraceCheckUtils]: 10: Hoare triple {1530#true} assume !(~r3~0 < 3); {1530#true} is VALID [2022-02-21 04:27:11,574 INFO L290 TraceCheckUtils]: 11: Hoare triple {1530#true} ~mode3~0 := 1; {1530#true} is VALID [2022-02-21 04:27:11,574 INFO L290 TraceCheckUtils]: 12: Hoare triple {1530#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1; {1530#true} is VALID [2022-02-21 04:27:11,574 INFO L290 TraceCheckUtils]: 13: Hoare triple {1530#true} assume !(0 != ~mode4~0 % 256); {1530#true} is VALID [2022-02-21 04:27:11,574 INFO L290 TraceCheckUtils]: 14: Hoare triple {1530#true} assume !(~r4~0 < 3); {1530#true} is VALID [2022-02-21 04:27:11,574 INFO L290 TraceCheckUtils]: 15: Hoare triple {1530#true} ~mode4~0 := 1; {1530#true} is VALID [2022-02-21 04:27:11,574 INFO L290 TraceCheckUtils]: 16: Hoare triple {1530#true} assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1530#true} is VALID [2022-02-21 04:27:11,575 INFO L290 TraceCheckUtils]: 17: Hoare triple {1530#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {1530#true} is VALID [2022-02-21 04:27:11,575 INFO L290 TraceCheckUtils]: 18: Hoare triple {1530#true} assume ~st1~0 + ~nl1~0 <= 1; {1530#true} is VALID [2022-02-21 04:27:11,575 INFO L290 TraceCheckUtils]: 19: Hoare triple {1530#true} assume ~st2~0 + ~nl2~0 <= 1; {1530#true} is VALID [2022-02-21 04:27:11,575 INFO L290 TraceCheckUtils]: 20: Hoare triple {1530#true} assume ~st3~0 + ~nl3~0 <= 1; {1530#true} is VALID [2022-02-21 04:27:11,575 INFO L290 TraceCheckUtils]: 21: Hoare triple {1530#true} assume ~st4~0 + ~nl4~0 <= 1; {1530#true} is VALID [2022-02-21 04:27:11,575 INFO L290 TraceCheckUtils]: 22: Hoare triple {1530#true} assume ~r1~0 >= 3; {1532#(not (<= ~r1~0 2))} is VALID [2022-02-21 04:27:11,576 INFO L290 TraceCheckUtils]: 23: Hoare triple {1532#(not (<= ~r1~0 2))} assume ~r1~0 < 3; {1531#false} is VALID [2022-02-21 04:27:11,576 INFO L290 TraceCheckUtils]: 24: Hoare triple {1531#false} assume ~r1~0 >= 3; {1531#false} is VALID [2022-02-21 04:27:11,576 INFO L290 TraceCheckUtils]: 25: Hoare triple {1531#false} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {1531#false} is VALID [2022-02-21 04:27:11,576 INFO L290 TraceCheckUtils]: 26: Hoare triple {1531#false} check_#res#1 := check_~tmp~1#1; {1531#false} is VALID [2022-02-21 04:27:11,576 INFO L290 TraceCheckUtils]: 27: Hoare triple {1531#false} main_#t~ret57#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret57#1;havoc main_#t~ret57#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1531#false} is VALID [2022-02-21 04:27:11,576 INFO L290 TraceCheckUtils]: 28: Hoare triple {1531#false} assume !(0 == assert_~arg#1 % 256); {1531#false} is VALID [2022-02-21 04:27:11,576 INFO L290 TraceCheckUtils]: 29: Hoare triple {1531#false} assume { :end_inline_assert } true;main_#t~post58#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post58#1;havoc main_#t~post58#1; {1531#false} is VALID [2022-02-21 04:27:11,577 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:27:11,577 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:27:11,577 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665447604] [2022-02-21 04:27:11,577 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665447604] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:27:11,577 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:27:11,577 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:27:11,577 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289976726] [2022-02-21 04:27:11,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:27:11,578 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:27:11,578 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:27:11,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:27:11,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:27:11,578 INFO L87 Difference]: Start difference. First operand 298 states and 528 transitions. cyclomatic complexity: 231 Second operand has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:27:12,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:27:12,047 INFO L93 Difference]: Finished difference Result 383 states and 662 transitions. [2022-02-21 04:27:12,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:27:12,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 10.0) internal successors, (30), 3 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:27:12,071 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:27:12,071 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 383 states and 662 transitions. [2022-02-21 04:27:12,080 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 191 [2022-02-21 04:27:12,088 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 383 states to 383 states and 662 transitions. [2022-02-21 04:27:12,088 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 383 [2022-02-21 04:27:12,089 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 383 [2022-02-21 04:27:12,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 383 states and 662 transitions. [2022-02-21 04:27:12,090 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:27:12,090 INFO L681 BuchiCegarLoop]: Abstraction has 383 states and 662 transitions. [2022-02-21 04:27:12,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 383 states and 662 transitions. [2022-02-21 04:27:12,098 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 383 to 383. [2022-02-21 04:27:12,098 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:27:12,099 INFO L82 GeneralOperation]: Start isEquivalent. First operand 383 states and 662 transitions. Second operand has 383 states, 383 states have (on average 1.7284595300261096) internal successors, (662), 382 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:27:12,099 INFO L74 IsIncluded]: Start isIncluded. First operand 383 states and 662 transitions. Second operand has 383 states, 383 states have (on average 1.7284595300261096) internal successors, (662), 382 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:27:12,100 INFO L87 Difference]: Start difference. First operand 383 states and 662 transitions. Second operand has 383 states, 383 states have (on average 1.7284595300261096) internal successors, (662), 382 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:27:12,109 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:27:12,110 INFO L93 Difference]: Finished difference Result 383 states and 662 transitions. [2022-02-21 04:27:12,110 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 662 transitions. [2022-02-21 04:27:12,111 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:27:12,111 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:27:12,112 INFO L74 IsIncluded]: Start isIncluded. First operand has 383 states, 383 states have (on average 1.7284595300261096) internal successors, (662), 382 states have internal predecessors, (662), 0 states have call successors, (0), 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 383 states and 662 transitions. [2022-02-21 04:27:12,113 INFO L87 Difference]: Start difference. First operand has 383 states, 383 states have (on average 1.7284595300261096) internal successors, (662), 382 states have internal predecessors, (662), 0 states have call successors, (0), 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 383 states and 662 transitions. [2022-02-21 04:27:12,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:27:12,124 INFO L93 Difference]: Finished difference Result 383 states and 662 transitions. [2022-02-21 04:27:12,124 INFO L276 IsEmpty]: Start isEmpty. Operand 383 states and 662 transitions. [2022-02-21 04:27:12,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:27:12,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:27:12,125 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:27:12,125 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:27:12,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 383 states, 383 states have (on average 1.7284595300261096) internal successors, (662), 382 states have internal predecessors, (662), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:27:12,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 383 states to 383 states and 662 transitions. [2022-02-21 04:27:12,136 INFO L704 BuchiCegarLoop]: Abstraction has 383 states and 662 transitions. [2022-02-21 04:27:12,136 INFO L587 BuchiCegarLoop]: Abstraction has 383 states and 662 transitions. [2022-02-21 04:27:12,136 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:27:12,137 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 383 states and 662 transitions. [2022-02-21 04:27:12,138 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 191 [2022-02-21 04:27:12,138 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:27:12,138 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:27:12,139 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:27:12,140 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:27:12,140 INFO L791 eck$LassoCheckResult]: Stem: 2218#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0; 2186#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~nondet55#1, main_#t~ret56#1, main_#t~ret57#1, main_#t~post58#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~ep13~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~ep14~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~ep21~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~ep23~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~ep24~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~ep31~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~ep32~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~ep34~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~ep41~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep42~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep43~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id1~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~r1~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st1~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~nl1~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~m1~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~max1~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode1~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~id2~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~r2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~nl2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~m2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~max2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~mode2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~r3~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~st3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~nl3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~m3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~max3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~mode3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~id4~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~r4~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~st4~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~nl4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~m4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~max4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~mode4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0; 2169#L393 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 2068#L404 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 2138#L414 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 1952#L425 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 2214#L435 assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; 2000#L446 init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 2123#L456 assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; 2032#L467 init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 2152#L477 assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; 2042#L488 init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 2043#L498 assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; 1982#L509 init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 2012#L519 assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; 2005#L530 init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); 2007#L540 assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; 2122#L551 init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); 2047#L561 assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; 2023#L572 init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); 2118#L582 assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; 1958#L593 init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); 2056#L603 assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; 1988#L614 init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); 2185#L624 assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; 1967#L635 init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); 1968#L645 assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; 1991#L656 init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); 2099#L666 assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; 1929#L677 init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); 1930#L687 assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; 1996#L698 init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); 1938#L708 assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; 1939#L719 init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); 2183#L729 assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; 1918#L740 init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); 2189#L750 assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; 2094#L761 init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); 2095#L771 assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; 2058#L782 init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); 2144#L792 assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; 1932#L803 init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); 1963#L813 assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; 2008#L824 init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); 2137#L834 assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; 1985#L845 init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); 1943#L855 assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; 1944#L866 init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); 2093#L876 assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; 1962#L887 init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); 2146#L897 assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; 1922#L897-1 init_#res#1 := init_~tmp___23~0#1; 2124#L1066 main_#t~ret56#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret56#1;havoc main_#t~ret56#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 2106#L21 assume !(0 == assume_abort_if_not_~cond#1); 2107#L20 assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 2167#L1203-2 [2022-02-21 04:27:12,140 INFO L793 eck$LassoCheckResult]: Loop: 2167#L1203-2 assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1; 2279#L109 assume !(0 != ~mode1~0 % 256); 2278#L141 assume !(~r1~0 < 2); 2045#L141-1 ~mode1~0 := 1; 2275#L109-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1; 2273#L162 assume !(0 != ~mode2~0 % 256); 2274#L194 assume !(~r2~0 < 3); 2260#L194-1 ~mode2~0 := 1; 2255#L162-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1; 2253#L215 assume !(0 != ~mode3~0 % 256); 2254#L247 assume !(~r3~0 < 3); 2242#L247-1 ~mode3~0 := 1; 2241#L215-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1; 2237#L268 assume !(0 != ~mode4~0 % 256); 2233#L300 assume !(~r4~0 < 3); 2226#L300-1 ~mode4~0 := 1; 2225#L268-2 assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 2224#L1074 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; 2223#L1075 assume ~st1~0 + ~nl1~0 <= 1; 2222#L1076 assume ~st2~0 + ~nl2~0 <= 1; 2221#L1077 assume ~st3~0 + ~nl3~0 <= 1; 2220#L1078 assume ~st4~0 + ~nl4~0 <= 1; 2219#L1079 assume !(~r1~0 >= 3); 2061#L1082 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; 2062#L1083 assume ~r1~0 < 3; 2298#L1088 assume !(~r1~0 >= 3); 2174#L1092 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0; 2175#L1093 assume ~r1~0 < 3;check_~tmp~1#1 := 1; 2292#L1074-1 check_#res#1 := check_~tmp~1#1; 2289#L1126 main_#t~ret57#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret57#1;havoc main_#t~ret57#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 2285#L1246 assume !(0 == assert_~arg#1 % 256); 2284#L1241 assume { :end_inline_assert } true;main_#t~post58#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post58#1;havoc main_#t~post58#1; 2167#L1203-2 [2022-02-21 04:27:12,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:27:12,141 INFO L85 PathProgramCache]: Analyzing trace with hash 2041231622, now seen corresponding path program 3 times [2022-02-21 04:27:12,141 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:27:12,141 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075106184] [2022-02-21 04:27:12,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:27:12,142 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:27:12,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:27:12,229 INFO L290 TraceCheckUtils]: 0: Hoare triple {3068#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0; {3068#true} is VALID [2022-02-21 04:27:12,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {3068#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~nondet55#1, main_#t~ret56#1, main_#t~ret57#1, main_#t~post58#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~ep13~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~ep14~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~ep21~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~ep23~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~ep24~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~ep31~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~ep32~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~ep34~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~ep41~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep42~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep43~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id1~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~r1~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st1~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~nl1~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~m1~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~max1~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode1~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~id2~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~r2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~nl2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~m2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~max2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~mode2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~r3~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~st3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~nl3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~m3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~max3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~mode3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~id4~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~r4~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~st4~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~nl4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~m4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~max4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~mode4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0; {3068#true} is VALID [2022-02-21 04:27:12,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {3068#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:12,229 INFO L290 TraceCheckUtils]: 3: Hoare triple {3068#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:12,229 INFO L290 TraceCheckUtils]: 4: Hoare triple {3068#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:12,230 INFO L290 TraceCheckUtils]: 5: Hoare triple {3068#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:12,230 INFO L290 TraceCheckUtils]: 6: Hoare triple {3068#true} assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:12,230 INFO L290 TraceCheckUtils]: 7: Hoare triple {3068#true} init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:12,230 INFO L290 TraceCheckUtils]: 8: Hoare triple {3068#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:12,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {3068#true} init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:12,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {3068#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:12,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {3068#true} init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:12,230 INFO L290 TraceCheckUtils]: 12: Hoare triple {3068#true} assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:12,230 INFO L290 TraceCheckUtils]: 13: Hoare triple {3068#true} init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:12,230 INFO L290 TraceCheckUtils]: 14: Hoare triple {3068#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:12,230 INFO L290 TraceCheckUtils]: 15: Hoare triple {3068#true} init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:12,230 INFO L290 TraceCheckUtils]: 16: Hoare triple {3068#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:12,230 INFO L290 TraceCheckUtils]: 17: Hoare triple {3068#true} init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:12,230 INFO L290 TraceCheckUtils]: 18: Hoare triple {3068#true} assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:12,231 INFO L290 TraceCheckUtils]: 19: Hoare triple {3068#true} init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:12,231 INFO L290 TraceCheckUtils]: 20: Hoare triple {3068#true} assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:12,231 INFO L290 TraceCheckUtils]: 21: Hoare triple {3068#true} init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:12,231 INFO L290 TraceCheckUtils]: 22: Hoare triple {3068#true} assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:12,231 INFO L290 TraceCheckUtils]: 23: Hoare triple {3068#true} init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:12,231 INFO L290 TraceCheckUtils]: 24: Hoare triple {3068#true} assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:12,231 INFO L290 TraceCheckUtils]: 25: Hoare triple {3068#true} init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:12,231 INFO L290 TraceCheckUtils]: 26: Hoare triple {3068#true} assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:12,231 INFO L290 TraceCheckUtils]: 27: Hoare triple {3068#true} init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:12,231 INFO L290 TraceCheckUtils]: 28: Hoare triple {3068#true} assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:12,231 INFO L290 TraceCheckUtils]: 29: Hoare triple {3068#true} init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:12,231 INFO L290 TraceCheckUtils]: 30: Hoare triple {3068#true} assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:12,231 INFO L290 TraceCheckUtils]: 31: Hoare triple {3068#true} init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:12,232 INFO L290 TraceCheckUtils]: 32: Hoare triple {3068#true} assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:12,232 INFO L290 TraceCheckUtils]: 33: Hoare triple {3068#true} init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:12,232 INFO L290 TraceCheckUtils]: 34: Hoare triple {3068#true} assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:12,232 INFO L290 TraceCheckUtils]: 35: Hoare triple {3068#true} init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:12,232 INFO L290 TraceCheckUtils]: 36: Hoare triple {3068#true} assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:12,232 INFO L290 TraceCheckUtils]: 37: Hoare triple {3068#true} init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:12,232 INFO L290 TraceCheckUtils]: 38: Hoare triple {3068#true} assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:12,232 INFO L290 TraceCheckUtils]: 39: Hoare triple {3068#true} init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:12,232 INFO L290 TraceCheckUtils]: 40: Hoare triple {3068#true} assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:12,232 INFO L290 TraceCheckUtils]: 41: Hoare triple {3068#true} init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:12,232 INFO L290 TraceCheckUtils]: 42: Hoare triple {3068#true} assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:12,232 INFO L290 TraceCheckUtils]: 43: Hoare triple {3068#true} init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:12,232 INFO L290 TraceCheckUtils]: 44: Hoare triple {3068#true} assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:12,232 INFO L290 TraceCheckUtils]: 45: Hoare triple {3068#true} init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:12,233 INFO L290 TraceCheckUtils]: 46: Hoare triple {3068#true} assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:12,233 INFO L290 TraceCheckUtils]: 47: Hoare triple {3068#true} init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:12,233 INFO L290 TraceCheckUtils]: 48: Hoare triple {3068#true} assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; {3068#true} is VALID [2022-02-21 04:27:12,233 INFO L290 TraceCheckUtils]: 49: Hoare triple {3068#true} init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); {3068#true} is VALID [2022-02-21 04:27:12,233 INFO L290 TraceCheckUtils]: 50: Hoare triple {3068#true} assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; {3070#(= |ULTIMATE.start_init_~tmp___23~0#1| 0)} is VALID [2022-02-21 04:27:12,233 INFO L290 TraceCheckUtils]: 51: Hoare triple {3070#(= |ULTIMATE.start_init_~tmp___23~0#1| 0)} init_#res#1 := init_~tmp___23~0#1; {3071#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:27:12,234 INFO L290 TraceCheckUtils]: 52: Hoare triple {3071#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret56#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret56#1;havoc main_#t~ret56#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3072#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:27:12,234 INFO L290 TraceCheckUtils]: 53: Hoare triple {3072#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {3069#false} is VALID [2022-02-21 04:27:12,234 INFO L290 TraceCheckUtils]: 54: Hoare triple {3069#false} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {3069#false} is VALID [2022-02-21 04:27:12,234 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:27:12,234 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:27:12,235 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075106184] [2022-02-21 04:27:12,235 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075106184] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:27:12,235 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:27:12,235 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:27:12,235 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878966367] [2022-02-21 04:27:12,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:27:12,235 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:27:12,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:27:12,235 INFO L85 PathProgramCache]: Analyzing trace with hash 1593842464, now seen corresponding path program 1 times [2022-02-21 04:27:12,235 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:27:12,236 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919400765] [2022-02-21 04:27:12,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:27:12,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:27:12,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:27:12,245 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:27:12,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:27:12,279 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:27:12,942 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:27:12,943 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:27:12,943 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:27:12,943 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:27:12,943 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:27:12,943 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:12,943 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:27:12,943 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:27:12,944 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.4.4.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2022-02-21 04:27:12,944 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:27:12,944 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:27:12,960 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:12,968 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:12,970 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:12,972 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:12,973 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:12,974 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:12,976 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:12,979 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:12,980 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:12,982 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:12,984 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:12,987 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:12,989 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:12,991 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:12,992 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:12,994 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:12,997 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:13,004 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:13,005 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:13,008 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:13,011 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:13,045 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:13,046 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:13,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:13,052 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:13,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:13,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:13,620 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:27:13,621 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:27:13,622 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:13,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:13,636 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:13,642 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:27:13,642 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:27:13,652 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 04:27:13,667 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 04:27:13,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:13,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:13,670 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:13,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 04:27:13,677 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:27:13,677 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:27:13,809 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:27:13,812 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:13,813 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:27:13,813 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:27:13,813 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:27:13,813 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:27:13,813 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:27:13,813 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:13,813 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:27:13,813 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:27:13,813 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_floodmax.4.4.ufo.BOUNDED-8.pals.c_Iteration3_Loop [2022-02-21 04:27:13,813 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:27:13,813 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:27:13,816 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:13,823 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:13,825 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:13,827 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:13,828 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:13,830 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:13,832 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:13,836 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:13,838 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:13,840 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:13,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:13,881 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:13,883 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:13,885 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:13,886 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:13,888 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:13,890 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:13,894 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:13,903 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:13,905 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:13,907 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:13,913 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:13,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:13,921 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:13,926 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:13,929 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:13,931 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:27:14,485 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:27:14,488 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:27:14,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:14,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:14,490 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:14,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 04:27:14,492 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:27:14,497 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:14,497 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:14,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:14,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:14,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:14,500 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:14,500 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:14,515 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:14,532 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:14,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:14,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:14,533 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:14,539 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 04:27:14,540 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:27:14,546 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:14,547 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:14,547 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:14,547 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:14,547 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:14,547 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:14,547 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:14,556 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:14,582 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:14,582 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:14,582 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:14,584 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:14,585 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 04:27:14,586 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:27:14,592 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:14,592 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:14,592 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:14,592 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:14,592 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:14,593 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:14,593 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:14,607 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:14,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:14,626 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:14,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:14,627 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:14,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 04:27:14,629 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:27:14,635 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:14,635 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:14,635 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:14,635 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:14,635 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:14,635 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:14,635 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:14,650 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:14,667 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:14,668 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:14,668 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:14,669 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:14,670 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 04:27:14,671 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:27:14,677 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:14,677 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:14,677 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:14,677 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:14,677 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:14,678 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:14,678 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:14,679 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:14,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:14,696 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:14,697 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:14,698 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:14,714 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:27:14,720 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:14,720 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:14,720 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:14,720 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:14,720 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:14,720 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 04:27:14,721 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:14,721 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:14,724 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:14,741 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:14,742 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:14,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:14,743 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:14,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 04:27:14,745 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:27:14,750 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:14,750 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:14,751 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:14,751 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:14,751 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:14,752 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:14,752 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:14,761 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:14,777 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:14,777 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:14,777 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:14,778 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:14,779 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 04:27:14,780 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:27:14,785 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:14,786 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:14,786 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:14,786 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:14,786 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:14,786 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:14,786 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:14,787 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:14,802 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Ended with exit code 0 [2022-02-21 04:27:14,803 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:14,803 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:14,809 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:14,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 04:27:14,811 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:27:14,816 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:14,816 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:14,816 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:14,816 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:14,816 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:14,817 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:14,817 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:14,832 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:14,847 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:14,848 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:14,848 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:14,849 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:14,850 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 04:27:14,851 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:27:14,857 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:14,857 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:14,857 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:14,858 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:14,858 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:14,864 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:14,864 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:14,891 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:14,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:14,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:14,908 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:14,909 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:14,910 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 04:27:14,911 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:27:14,916 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:14,917 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:14,917 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:14,917 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:14,917 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:14,918 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:14,918 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:14,919 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:14,934 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:14,935 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:14,935 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:14,936 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:14,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 04:27:14,942 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:27:14,948 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:14,948 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:14,948 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:14,948 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:14,948 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:14,948 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:14,948 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:14,949 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:14,964 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:14,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:14,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:14,965 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:14,966 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 04:27:14,967 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:27:14,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:14,972 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:14,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:14,973 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:14,973 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:14,973 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:14,973 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:14,974 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:14,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:14,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:14,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:14,990 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:14,990 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 04:27:14,991 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:27:14,996 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:14,997 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:14,997 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:14,997 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:14,997 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:14,997 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:14,997 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:15,012 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:15,028 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:15,028 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:15,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:15,029 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:15,030 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 04:27:15,031 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:27:15,037 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:15,037 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:15,037 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:15,037 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:15,037 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:15,038 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:15,038 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:15,039 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:15,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 04:27:15,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:15,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:15,056 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:15,059 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:27:15,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 04:27:15,065 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:15,065 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:15,065 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:15,065 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:15,065 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:15,065 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:15,065 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:15,066 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:27:15,082 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Ended with exit code 0 [2022-02-21 04:27:15,082 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:15,082 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:15,083 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:15,087 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 04:27:15,087 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:27:15,092 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:27:15,092 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:27:15,092 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:27:15,092 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:27:15,093 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:27:15,093 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:27:15,093 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:27:15,100 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:27:15,104 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:27:15,104 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:27:15,105 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:27:15,105 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:27:15,106 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:27:15,107 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 04:27:15,149 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:27:15,149 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:27:15,149 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:27:15,149 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 15 Supporting invariants [] [2022-02-21 04:27:15,165 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:27:15,184 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:27:15,191 INFO L390 LassoCheck]: Loop: "assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1;" "assume !(0 != ~mode1~0 % 256);" "assume !(~r1~0 < 2);" "~mode1~0 := 1;" "assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1;" "assume !(0 != ~mode2~0 % 256);" "assume !(~r2~0 < 3);" "~mode2~0 := 1;" "assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1;" "assume !(0 != ~mode3~0 % 256);" "assume !(~r3~0 < 3);" "~mode3~0 := 1;" "assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1;" "assume !(0 != ~mode4~0 % 256);" "assume !(~r4~0 < 3);" "~mode4~0 := 1;" "assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1;" "assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1;" "assume ~st1~0 + ~nl1~0 <= 1;" "assume ~st2~0 + ~nl2~0 <= 1;" "assume ~st3~0 + ~nl3~0 <= 1;" "assume ~st4~0 + ~nl4~0 <= 1;" "assume !(~r1~0 >= 3);" "assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0;" "assume ~r1~0 < 3;" "assume !(~r1~0 >= 3);" "assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0;" "assume ~r1~0 < 3;check_~tmp~1#1 := 1;" "check_#res#1 := check_~tmp~1#1;" "main_#t~ret57#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret57#1;havoc main_#t~ret57#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "assume { :end_inline_assert } true;main_#t~post58#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post58#1;havoc main_#t~post58#1;" [2022-02-21 04:27:15,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:27:15,266 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:27:15,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:27:15,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 388 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:27:15,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:27:15,396 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:27:15,482 INFO L290 TraceCheckUtils]: 0: Hoare triple {3075#unseeded} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(39, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p14~0 := 0;~p14_old~0 := 0;~p14_new~0 := 0;~ep14~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p24~0 := 0;~p24_old~0 := 0;~p24_new~0 := 0;~ep24~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~p34~0 := 0;~p34_old~0 := 0;~p34_new~0 := 0;~ep34~0 := 0;~p41~0 := 0;~p41_old~0 := 0;~p41_new~0 := 0;~ep41~0 := 0;~p42~0 := 0;~p42_old~0 := 0;~p42_new~0 := 0;~ep42~0 := 0;~p43~0 := 0;~p43_old~0 := 0;~p43_new~0 := 0;~ep43~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~id4~0 := 0;~r4~0 := 0;~st4~0 := 0;~nl4~0 := 0;~m4~0 := 0;~max4~0 := 0;~mode4~0 := 0; {3075#unseeded} is VALID [2022-02-21 04:27:15,482 INFO L290 TraceCheckUtils]: 1: Hoare triple {3075#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~nondet40#1, main_#t~nondet41#1, main_#t~nondet42#1, main_#t~nondet43#1, main_#t~nondet44#1, main_#t~nondet45#1, main_#t~nondet46#1, main_#t~nondet47#1, main_#t~nondet48#1, main_#t~nondet49#1, main_#t~nondet50#1, main_#t~nondet51#1, main_#t~nondet52#1, main_#t~nondet53#1, main_#t~nondet54#1, main_#t~nondet55#1, main_#t~ret56#1, main_#t~ret57#1, main_#t~post58#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~ep13~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~ep14~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~ep21~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~ep23~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~ep24~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~ep31~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~ep32~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~ep34~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~ep41~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~ep42~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~ep43~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~id1~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~r1~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~st1~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~nl1~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~m1~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~max1~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~mode1~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~id2~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~r2~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~st2~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~nl2~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~m2~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;~max2~0 := main_#t~nondet40#1;havoc main_#t~nondet40#1;~mode2~0 := main_#t~nondet41#1;havoc main_#t~nondet41#1;~id3~0 := main_#t~nondet42#1;havoc main_#t~nondet42#1;~r3~0 := main_#t~nondet43#1;havoc main_#t~nondet43#1;~st3~0 := main_#t~nondet44#1;havoc main_#t~nondet44#1;~nl3~0 := main_#t~nondet45#1;havoc main_#t~nondet45#1;~m3~0 := main_#t~nondet46#1;havoc main_#t~nondet46#1;~max3~0 := main_#t~nondet47#1;havoc main_#t~nondet47#1;~mode3~0 := main_#t~nondet48#1;havoc main_#t~nondet48#1;~id4~0 := main_#t~nondet49#1;havoc main_#t~nondet49#1;~r4~0 := main_#t~nondet50#1;havoc main_#t~nondet50#1;~st4~0 := main_#t~nondet51#1;havoc main_#t~nondet51#1;~nl4~0 := main_#t~nondet52#1;havoc main_#t~nondet52#1;~m4~0 := main_#t~nondet53#1;havoc main_#t~nondet53#1;~max4~0 := main_#t~nondet54#1;havoc main_#t~nondet54#1;~mode4~0 := main_#t~nondet55#1;havoc main_#t~nondet55#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r141~0#1, init_~r211~0#1, init_~r231~0#1, init_~r241~0#1, init_~r311~0#1, init_~r321~0#1, init_~r341~0#1, init_~r411~0#1, init_~r421~0#1, init_~r431~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r142~0#1, init_~tmp___1~0#1, init_~r212~0#1, init_~tmp___2~0#1, init_~r232~0#1, init_~tmp___3~0#1, init_~r242~0#1, init_~tmp___4~0#1, init_~r312~0#1, init_~tmp___5~0#1, init_~r322~0#1, init_~tmp___6~0#1, init_~r342~0#1, init_~tmp___7~0#1, init_~r412~0#1, init_~tmp___8~0#1, init_~r422~0#1, init_~tmp___9~0#1, init_~r432~0#1, init_~tmp___10~0#1, init_~r123~0#1, init_~tmp___11~0#1, init_~r133~0#1, init_~tmp___12~0#1, init_~r143~0#1, init_~tmp___13~0#1, init_~r213~0#1, init_~tmp___14~0#1, init_~r233~0#1, init_~tmp___15~0#1, init_~r243~0#1, init_~tmp___16~0#1, init_~r313~0#1, init_~tmp___17~0#1, init_~r323~0#1, init_~tmp___18~0#1, init_~r343~0#1, init_~tmp___19~0#1, init_~r413~0#1, init_~tmp___20~0#1, init_~r423~0#1, init_~tmp___21~0#1, init_~r433~0#1, init_~tmp___22~0#1, init_~tmp___23~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r141~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r241~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r341~0#1;havoc init_~r411~0#1;havoc init_~r421~0#1;havoc init_~r431~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r142~0#1;havoc init_~tmp___1~0#1;havoc init_~r212~0#1;havoc init_~tmp___2~0#1;havoc init_~r232~0#1;havoc init_~tmp___3~0#1;havoc init_~r242~0#1;havoc init_~tmp___4~0#1;havoc init_~r312~0#1;havoc init_~tmp___5~0#1;havoc init_~r322~0#1;havoc init_~tmp___6~0#1;havoc init_~r342~0#1;havoc init_~tmp___7~0#1;havoc init_~r412~0#1;havoc init_~tmp___8~0#1;havoc init_~r422~0#1;havoc init_~tmp___9~0#1;havoc init_~r432~0#1;havoc init_~tmp___10~0#1;havoc init_~r123~0#1;havoc init_~tmp___11~0#1;havoc init_~r133~0#1;havoc init_~tmp___12~0#1;havoc init_~r143~0#1;havoc init_~tmp___13~0#1;havoc init_~r213~0#1;havoc init_~tmp___14~0#1;havoc init_~r233~0#1;havoc init_~tmp___15~0#1;havoc init_~r243~0#1;havoc init_~tmp___16~0#1;havoc init_~r313~0#1;havoc init_~tmp___17~0#1;havoc init_~r323~0#1;havoc init_~tmp___18~0#1;havoc init_~r343~0#1;havoc init_~tmp___19~0#1;havoc init_~r413~0#1;havoc init_~tmp___20~0#1;havoc init_~r423~0#1;havoc init_~tmp___21~0#1;havoc init_~r433~0#1;havoc init_~tmp___22~0#1;havoc init_~tmp___23~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r141~0#1 := ~ep14~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r241~0#1 := ~ep24~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0;init_~r341~0#1 := ~ep34~0;init_~r411~0#1 := ~ep41~0;init_~r421~0#1 := ~ep42~0;init_~r431~0#1 := ~ep43~0; {3075#unseeded} is VALID [2022-02-21 04:27:15,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {3075#unseeded} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:15,483 INFO L290 TraceCheckUtils]: 3: Hoare triple {3075#unseeded} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:15,483 INFO L290 TraceCheckUtils]: 4: Hoare triple {3075#unseeded} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:15,484 INFO L290 TraceCheckUtils]: 5: Hoare triple {3075#unseeded} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:15,484 INFO L290 TraceCheckUtils]: 6: Hoare triple {3075#unseeded} assume 0 != init_~r141~0#1 % 256;init_~tmp___1~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:15,484 INFO L290 TraceCheckUtils]: 7: Hoare triple {3075#unseeded} init_~r142~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:15,485 INFO L290 TraceCheckUtils]: 8: Hoare triple {3075#unseeded} assume 0 != init_~r211~0#1 % 256;init_~tmp___2~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:15,485 INFO L290 TraceCheckUtils]: 9: Hoare triple {3075#unseeded} init_~r212~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:15,485 INFO L290 TraceCheckUtils]: 10: Hoare triple {3075#unseeded} assume 0 != init_~r231~0#1 % 256;init_~tmp___3~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:15,486 INFO L290 TraceCheckUtils]: 11: Hoare triple {3075#unseeded} init_~r232~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:15,486 INFO L290 TraceCheckUtils]: 12: Hoare triple {3075#unseeded} assume 0 != init_~r241~0#1 % 256;init_~tmp___4~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:15,486 INFO L290 TraceCheckUtils]: 13: Hoare triple {3075#unseeded} init_~r242~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:15,487 INFO L290 TraceCheckUtils]: 14: Hoare triple {3075#unseeded} assume 0 != init_~r311~0#1 % 256;init_~tmp___5~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:15,487 INFO L290 TraceCheckUtils]: 15: Hoare triple {3075#unseeded} init_~r312~0#1 := (if 0 == init_~tmp___5~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:15,487 INFO L290 TraceCheckUtils]: 16: Hoare triple {3075#unseeded} assume 0 != init_~r321~0#1 % 256;init_~tmp___6~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:15,487 INFO L290 TraceCheckUtils]: 17: Hoare triple {3075#unseeded} init_~r322~0#1 := (if 0 == init_~tmp___6~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:15,488 INFO L290 TraceCheckUtils]: 18: Hoare triple {3075#unseeded} assume 0 != init_~r341~0#1 % 256;init_~tmp___7~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:15,488 INFO L290 TraceCheckUtils]: 19: Hoare triple {3075#unseeded} init_~r342~0#1 := (if 0 == init_~tmp___7~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:15,488 INFO L290 TraceCheckUtils]: 20: Hoare triple {3075#unseeded} assume 0 != init_~r411~0#1 % 256;init_~tmp___8~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:15,489 INFO L290 TraceCheckUtils]: 21: Hoare triple {3075#unseeded} init_~r412~0#1 := (if 0 == init_~tmp___8~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:15,493 INFO L290 TraceCheckUtils]: 22: Hoare triple {3075#unseeded} assume 0 != init_~r421~0#1 % 256;init_~tmp___9~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:15,494 INFO L290 TraceCheckUtils]: 23: Hoare triple {3075#unseeded} init_~r422~0#1 := (if 0 == init_~tmp___9~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:15,494 INFO L290 TraceCheckUtils]: 24: Hoare triple {3075#unseeded} assume 0 != init_~r431~0#1 % 256;init_~tmp___10~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:15,496 INFO L290 TraceCheckUtils]: 25: Hoare triple {3075#unseeded} init_~r432~0#1 := (if 0 == init_~tmp___10~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:15,498 INFO L290 TraceCheckUtils]: 26: Hoare triple {3075#unseeded} assume 0 != init_~r122~0#1 % 256;init_~tmp___11~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:15,499 INFO L290 TraceCheckUtils]: 27: Hoare triple {3075#unseeded} init_~r123~0#1 := (if 0 == init_~tmp___11~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:15,501 INFO L290 TraceCheckUtils]: 28: Hoare triple {3075#unseeded} assume 0 != init_~r132~0#1 % 256;init_~tmp___12~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:15,501 INFO L290 TraceCheckUtils]: 29: Hoare triple {3075#unseeded} init_~r133~0#1 := (if 0 == init_~tmp___12~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:15,501 INFO L290 TraceCheckUtils]: 30: Hoare triple {3075#unseeded} assume 0 != init_~r142~0#1 % 256;init_~tmp___13~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:15,502 INFO L290 TraceCheckUtils]: 31: Hoare triple {3075#unseeded} init_~r143~0#1 := (if 0 == init_~tmp___13~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:15,502 INFO L290 TraceCheckUtils]: 32: Hoare triple {3075#unseeded} assume 0 != init_~r212~0#1 % 256;init_~tmp___14~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:15,503 INFO L290 TraceCheckUtils]: 33: Hoare triple {3075#unseeded} init_~r213~0#1 := (if 0 == init_~tmp___14~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:15,504 INFO L290 TraceCheckUtils]: 34: Hoare triple {3075#unseeded} assume 0 != init_~r232~0#1 % 256;init_~tmp___15~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:15,504 INFO L290 TraceCheckUtils]: 35: Hoare triple {3075#unseeded} init_~r233~0#1 := (if 0 == init_~tmp___15~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:15,504 INFO L290 TraceCheckUtils]: 36: Hoare triple {3075#unseeded} assume 0 != init_~r242~0#1 % 256;init_~tmp___16~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:15,507 INFO L290 TraceCheckUtils]: 37: Hoare triple {3075#unseeded} init_~r243~0#1 := (if 0 == init_~tmp___16~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:15,509 INFO L290 TraceCheckUtils]: 38: Hoare triple {3075#unseeded} assume 0 != init_~r312~0#1 % 256;init_~tmp___17~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:15,510 INFO L290 TraceCheckUtils]: 39: Hoare triple {3075#unseeded} init_~r313~0#1 := (if 0 == init_~tmp___17~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:15,510 INFO L290 TraceCheckUtils]: 40: Hoare triple {3075#unseeded} assume 0 != init_~r322~0#1 % 256;init_~tmp___18~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:15,510 INFO L290 TraceCheckUtils]: 41: Hoare triple {3075#unseeded} init_~r323~0#1 := (if 0 == init_~tmp___18~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:15,510 INFO L290 TraceCheckUtils]: 42: Hoare triple {3075#unseeded} assume 0 != init_~r342~0#1 % 256;init_~tmp___19~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:15,511 INFO L290 TraceCheckUtils]: 43: Hoare triple {3075#unseeded} init_~r343~0#1 := (if 0 == init_~tmp___19~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:15,511 INFO L290 TraceCheckUtils]: 44: Hoare triple {3075#unseeded} assume 0 != init_~r412~0#1 % 256;init_~tmp___20~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:15,511 INFO L290 TraceCheckUtils]: 45: Hoare triple {3075#unseeded} init_~r413~0#1 := (if 0 == init_~tmp___20~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:15,511 INFO L290 TraceCheckUtils]: 46: Hoare triple {3075#unseeded} assume 0 != init_~r422~0#1 % 256;init_~tmp___21~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:15,512 INFO L290 TraceCheckUtils]: 47: Hoare triple {3075#unseeded} init_~r423~0#1 := (if 0 == init_~tmp___21~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:15,512 INFO L290 TraceCheckUtils]: 48: Hoare triple {3075#unseeded} assume 0 != init_~r432~0#1 % 256;init_~tmp___22~0#1 := 1; {3075#unseeded} is VALID [2022-02-21 04:27:15,512 INFO L290 TraceCheckUtils]: 49: Hoare triple {3075#unseeded} init_~r433~0#1 := (if 0 == init_~tmp___22~0#1 then 0 else 1); {3075#unseeded} is VALID [2022-02-21 04:27:15,513 INFO L290 TraceCheckUtils]: 50: Hoare triple {3075#unseeded} assume !(~id1~0 != ~id2~0);init_~tmp___23~0#1 := 0; {3075#unseeded} is VALID [2022-02-21 04:27:15,513 INFO L290 TraceCheckUtils]: 51: Hoare triple {3075#unseeded} init_#res#1 := init_~tmp___23~0#1; {3075#unseeded} is VALID [2022-02-21 04:27:15,513 INFO L290 TraceCheckUtils]: 52: Hoare triple {3075#unseeded} main_#t~ret56#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret56#1;havoc main_#t~ret56#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3075#unseeded} is VALID [2022-02-21 04:27:15,513 INFO L290 TraceCheckUtils]: 53: Hoare triple {3075#unseeded} assume !(0 == assume_abort_if_not_~cond#1); {3075#unseeded} is VALID [2022-02-21 04:27:15,514 INFO L290 TraceCheckUtils]: 54: Hoare triple {3075#unseeded} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~nomsg~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~nomsg~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~nomsg~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~nomsg~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~nomsg~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~nomsg~0;~p43_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {3075#unseeded} is VALID [2022-02-21 04:27:15,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:27:15,537 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:27:15,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:27:15,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:27:15,672 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Ended with exit code 0 [2022-02-21 04:27:15,859 INFO L290 TraceCheckUtils]: 0: Hoare triple {3078#(>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|)))} assume !!(main_~i2~0#1 < 8);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_#t~ite6#1; {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:15,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 != ~mode1~0 % 256); {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:15,860 INFO L290 TraceCheckUtils]: 2: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(~r1~0 < 2); {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:15,860 INFO L290 TraceCheckUtils]: 3: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} ~mode1~0 := 1; {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:15,861 INFO L290 TraceCheckUtils]: 4: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite7#1, node2_#t~ite8#1, node2_#t~ite9#1; {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:15,862 INFO L290 TraceCheckUtils]: 5: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 != ~mode2~0 % 256); {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:15,862 INFO L290 TraceCheckUtils]: 6: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(~r2~0 < 3); {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:15,863 INFO L290 TraceCheckUtils]: 7: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} ~mode2~0 := 1; {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:15,863 INFO L290 TraceCheckUtils]: 8: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite10#1, node3_#t~ite11#1, node3_#t~ite12#1; {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:15,864 INFO L290 TraceCheckUtils]: 9: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 != ~mode3~0 % 256); {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:15,864 INFO L290 TraceCheckUtils]: 10: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(~r3~0 < 3); {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:15,864 INFO L290 TraceCheckUtils]: 11: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} ~mode3~0 := 1; {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:15,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite13#1, node4_#t~ite14#1, node4_#t~ite15#1; {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:15,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 != ~mode4~0 % 256); {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:15,866 INFO L290 TraceCheckUtils]: 14: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(~r4~0 < 3); {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:15,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} ~mode4~0 := 1; {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:15,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume { :end_inline_node4 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p14_old~0 := ~p14_new~0;~p14_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p24_old~0 := ~p24_new~0;~p24_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;~p34_old~0 := ~p34_new~0;~p34_new~0 := ~nomsg~0;~p41_old~0 := ~p41_new~0;~p41_new~0 := ~nomsg~0;~p42_old~0 := ~p42_new~0;~p42_new~0 := ~nomsg~0;~p43_old~0 := ~p43_new~0;~p43_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:15,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 <= 1; {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:15,868 INFO L290 TraceCheckUtils]: 18: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~st1~0 + ~nl1~0 <= 1; {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:15,868 INFO L290 TraceCheckUtils]: 19: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~st2~0 + ~nl2~0 <= 1; {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:15,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~st3~0 + ~nl3~0 <= 1; {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:15,869 INFO L290 TraceCheckUtils]: 21: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~st4~0 + ~nl4~0 <= 1; {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:15,869 INFO L290 TraceCheckUtils]: 22: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(~r1~0 >= 3); {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:15,870 INFO L290 TraceCheckUtils]: 23: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0; {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:15,870 INFO L290 TraceCheckUtils]: 24: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~r1~0 < 3; {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:15,871 INFO L290 TraceCheckUtils]: 25: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(~r1~0 >= 3); {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:15,871 INFO L290 TraceCheckUtils]: 26: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0 + ~nl4~0; {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:15,872 INFO L290 TraceCheckUtils]: 27: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume ~r1~0 < 3;check_~tmp~1#1 := 1; {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:15,872 INFO L290 TraceCheckUtils]: 28: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} check_#res#1 := check_~tmp~1#1; {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:15,872 INFO L290 TraceCheckUtils]: 29: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} main_#t~ret57#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret57#1;havoc main_#t~ret57#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:15,873 INFO L290 TraceCheckUtils]: 30: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume !(0 == assert_~arg#1 % 256); {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} is VALID [2022-02-21 04:27:15,874 INFO L290 TraceCheckUtils]: 31: Hoare triple {3255#(and (>= oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 8))} assume { :end_inline_assert } true;main_#t~post58#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post58#1;havoc main_#t~post58#1; {3088#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ 15 (* (- 2) |ULTIMATE.start_main_~i2~0#1|)))))} is VALID [2022-02-21 04:27:15,874 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:27:15,875 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:27:15,900 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:27:15,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 32 letters. [2022-02-21 04:27:15,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:15,904 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 04:27:15,904 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 383 states and 662 transitions. cyclomatic complexity: 280 Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:27:16,401 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 383 states and 662 transitions. cyclomatic complexity: 280. Second operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 573 states and 970 transitions. Complement of second has 4 states. [2022-02-21 04:27:16,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 04:27:16,401 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:27:16,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 383 states and 662 transitions. cyclomatic complexity: 280 [2022-02-21 04:27:16,401 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:27:16,401 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:27:16,401 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:27:16,406 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:27:16,406 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:27:16,406 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:27:16,407 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 573 states and 970 transitions. [2022-02-21 04:27:16,409 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:27:16,409 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:27:16,411 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 383 states and 662 transitions. cyclomatic complexity: 280 [2022-02-21 04:27:16,477 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 191 examples of accepted words. [2022-02-21 04:27:16,478 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:27:16,480 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:27:16,480 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:27:16,480 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 573 states and 970 transitions. cyclomatic complexity: 398 [2022-02-21 04:27:16,481 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 573 states and 970 transitions. cyclomatic complexity: 398 [2022-02-21 04:27:16,481 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:27:16,481 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:27:16,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 55 letters. Loop has 32 letters. [2022-02-21 04:27:16,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 32 letters. [2022-02-21 04:27:16,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 55 letters. Loop has 32 letters. [2022-02-21 04:27:16,482 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,482 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:27:16,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:27:16,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:27:16,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 573 letters. Loop has 573 letters. [2022-02-21 04:27:16,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 573 letters. Loop has 573 letters. [2022-02-21 04:27:16,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 573 letters. Loop has 573 letters. [2022-02-21 04:27:16,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 383 letters. Loop has 383 letters. [2022-02-21 04:27:16,484 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,484 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 383 letters. Loop has 383 letters. [2022-02-21 04:27:16,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 383 letters. Loop has 383 letters. [2022-02-21 04:27:16,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:27:16,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:27:16,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,485 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:27:16,485 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 36 letters. [2022-02-21 04:27:16,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 36 letters. [2022-02-21 04:27:16,486 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,486 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 36 letters. [2022-02-21 04:27:16,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:27:16,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:27:16,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,487 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:27:16,487 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:27:16,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:27:16,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,488 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:27:16,488 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 37 letters. [2022-02-21 04:27:16,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 37 letters. [2022-02-21 04:27:16,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 37 letters. [2022-02-21 04:27:16,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:27:16,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:27:16,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:27:16,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 78 letters. Loop has 32 letters. [2022-02-21 04:27:16,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 78 letters. Loop has 32 letters. [2022-02-21 04:27:16,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 78 letters. Loop has 32 letters. [2022-02-21 04:27:16,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 79 letters. Loop has 32 letters. [2022-02-21 04:27:16,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 79 letters. Loop has 32 letters. [2022-02-21 04:27:16,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 79 letters. Loop has 32 letters. [2022-02-21 04:27:16,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 73 letters. Loop has 35 letters. [2022-02-21 04:27:16,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 35 letters. [2022-02-21 04:27:16,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 73 letters. Loop has 35 letters. [2022-02-21 04:27:16,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 73 letters. Loop has 36 letters. [2022-02-21 04:27:16,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 36 letters. [2022-02-21 04:27:16,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 73 letters. Loop has 36 letters. [2022-02-21 04:27:16,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 65 letters. Loop has 35 letters. [2022-02-21 04:27:16,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 35 letters. [2022-02-21 04:27:16,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 65 letters. Loop has 35 letters. [2022-02-21 04:27:16,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:27:16,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:27:16,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:27:16,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 66 letters. Loop has 36 letters. [2022-02-21 04:27:16,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 36 letters. [2022-02-21 04:27:16,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 66 letters. Loop has 36 letters. [2022-02-21 04:27:16,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 60 letters. Loop has 37 letters. [2022-02-21 04:27:16,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 37 letters. [2022-02-21 04:27:16,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 60 letters. Loop has 37 letters. [2022-02-21 04:27:16,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 61 letters. Loop has 37 letters. [2022-02-21 04:27:16,498 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,498 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 37 letters. [2022-02-21 04:27:16,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 61 letters. Loop has 37 letters. [2022-02-21 04:27:16,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 74 letters. Loop has 35 letters. [2022-02-21 04:27:16,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,499 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 35 letters. [2022-02-21 04:27:16,499 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 74 letters. Loop has 35 letters. [2022-02-21 04:27:16,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 75 letters. Loop has 37 letters. [2022-02-21 04:27:16,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,500 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 75 letters. Loop has 37 letters. [2022-02-21 04:27:16,500 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 75 letters. Loop has 37 letters. [2022-02-21 04:27:16,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 37 letters. [2022-02-21 04:27:16,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 37 letters. [2022-02-21 04:27:16,501 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,501 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 37 letters. [2022-02-21 04:27:16,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 62 letters. Loop has 37 letters. [2022-02-21 04:27:16,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 37 letters. [2022-02-21 04:27:16,502 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,502 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 62 letters. Loop has 37 letters. [2022-02-21 04:27:16,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 36 letters. [2022-02-21 04:27:16,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 36 letters. [2022-02-21 04:27:16,503 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,503 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 36 letters. [2022-02-21 04:27:16,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 88 letters. Loop has 32 letters. [2022-02-21 04:27:16,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 88 letters. Loop has 32 letters. [2022-02-21 04:27:16,504 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,504 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 88 letters. Loop has 32 letters. [2022-02-21 04:27:16,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 36 letters. [2022-02-21 04:27:16,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 36 letters. [2022-02-21 04:27:16,505 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,505 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 36 letters. [2022-02-21 04:27:16,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:27:16,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:27:16,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,506 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:27:16,506 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:27:16,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:27:16,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,507 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:27:16,507 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 36 letters. [2022-02-21 04:27:16,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 36 letters. [2022-02-21 04:27:16,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 36 letters. [2022-02-21 04:27:16,508 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,508 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 77 letters. Loop has 37 letters. [2022-02-21 04:27:16,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 77 letters. Loop has 37 letters. [2022-02-21 04:27:16,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,509 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 77 letters. Loop has 37 letters. [2022-02-21 04:27:16,509 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 58 letters. Loop has 35 letters. [2022-02-21 04:27:16,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 35 letters. [2022-02-21 04:27:16,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 58 letters. Loop has 35 letters. [2022-02-21 04:27:16,510 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,510 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 59 letters. Loop has 37 letters. [2022-02-21 04:27:16,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 37 letters. [2022-02-21 04:27:16,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 59 letters. Loop has 37 letters. [2022-02-21 04:27:16,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,511 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 70 letters. Loop has 37 letters. [2022-02-21 04:27:16,511 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 37 letters. [2022-02-21 04:27:16,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 70 letters. Loop has 37 letters. [2022-02-21 04:27:16,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,512 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:27:16,512 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:27:16,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:27:16,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 32 letters. [2022-02-21 04:27:16,513 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,513 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 32 letters. [2022-02-21 04:27:16,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 32 letters. [2022-02-21 04:27:16,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:27:16,514 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,514 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:27:16,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:27:16,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 57 letters. Loop has 35 letters. [2022-02-21 04:27:16,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,515 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 35 letters. [2022-02-21 04:27:16,515 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 57 letters. Loop has 35 letters. [2022-02-21 04:27:16,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 77 letters. Loop has 32 letters. [2022-02-21 04:27:16,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 77 letters. Loop has 32 letters. [2022-02-21 04:27:16,516 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,516 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 77 letters. Loop has 32 letters. [2022-02-21 04:27:16,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 78 letters. Loop has 32 letters. [2022-02-21 04:27:16,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 78 letters. Loop has 32 letters. [2022-02-21 04:27:16,517 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,517 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 78 letters. Loop has 32 letters. [2022-02-21 04:27:16,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 76 letters. Loop has 37 letters. [2022-02-21 04:27:16,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 76 letters. Loop has 37 letters. [2022-02-21 04:27:16,518 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,518 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 76 letters. Loop has 37 letters. [2022-02-21 04:27:16,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:27:16,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:27:16,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,519 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:27:16,519 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 64 letters. Loop has 32 letters. [2022-02-21 04:27:16,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 32 letters. [2022-02-21 04:27:16,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 64 letters. Loop has 32 letters. [2022-02-21 04:27:16,520 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,520 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 76 letters. Loop has 36 letters. [2022-02-21 04:27:16,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 76 letters. Loop has 36 letters. [2022-02-21 04:27:16,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 76 letters. Loop has 36 letters. [2022-02-21 04:27:16,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,521 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 79 letters. Loop has 32 letters. [2022-02-21 04:27:16,521 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 79 letters. Loop has 32 letters. [2022-02-21 04:27:16,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 79 letters. Loop has 32 letters. [2022-02-21 04:27:16,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 79 letters. Loop has 32 letters. [2022-02-21 04:27:16,522 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,522 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 79 letters. Loop has 32 letters. [2022-02-21 04:27:16,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 79 letters. Loop has 32 letters. [2022-02-21 04:27:16,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 80 letters. Loop has 32 letters. [2022-02-21 04:27:16,523 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,523 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 80 letters. Loop has 32 letters. [2022-02-21 04:27:16,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 80 letters. Loop has 32 letters. [2022-02-21 04:27:16,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 82 letters. Loop has 32 letters. [2022-02-21 04:27:16,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 82 letters. Loop has 32 letters. [2022-02-21 04:27:16,524 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,524 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 82 letters. Loop has 32 letters. [2022-02-21 04:27:16,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 83 letters. Loop has 32 letters. [2022-02-21 04:27:16,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 83 letters. Loop has 32 letters. [2022-02-21 04:27:16,525 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,525 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 83 letters. Loop has 32 letters. [2022-02-21 04:27:16,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 55 letters. Loop has 32 letters. [2022-02-21 04:27:16,526 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,526 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 32 letters. [2022-02-21 04:27:16,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,541 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 55 letters. Loop has 32 letters. [2022-02-21 04:27:16,541 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:27:16,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:27:16,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,542 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:27:16,542 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 73 letters. Loop has 32 letters. [2022-02-21 04:27:16,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 32 letters. [2022-02-21 04:27:16,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 73 letters. Loop has 32 letters. [2022-02-21 04:27:16,543 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,543 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 81 letters. Loop has 32 letters. [2022-02-21 04:27:16,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 81 letters. Loop has 32 letters. [2022-02-21 04:27:16,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 81 letters. Loop has 32 letters. [2022-02-21 04:27:16,544 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,544 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 82 letters. Loop has 32 letters. [2022-02-21 04:27:16,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 82 letters. Loop has 32 letters. [2022-02-21 04:27:16,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 82 letters. Loop has 32 letters. [2022-02-21 04:27:16,545 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,545 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 37 letters. [2022-02-21 04:27:16,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 37 letters. [2022-02-21 04:27:16,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 37 letters. [2022-02-21 04:27:16,546 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,546 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 37 letters. [2022-02-21 04:27:16,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 37 letters. [2022-02-21 04:27:16,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 37 letters. [2022-02-21 04:27:16,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,547 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 32 letters. [2022-02-21 04:27:16,547 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 32 letters. [2022-02-21 04:27:16,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 32 letters. [2022-02-21 04:27:16,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 84 letters. Loop has 32 letters. [2022-02-21 04:27:16,548 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,548 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 84 letters. Loop has 32 letters. [2022-02-21 04:27:16,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 84 letters. Loop has 32 letters. [2022-02-21 04:27:16,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 66 letters. Loop has 32 letters. [2022-02-21 04:27:16,549 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,549 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 32 letters. [2022-02-21 04:27:16,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 66 letters. Loop has 32 letters. [2022-02-21 04:27:16,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 65 letters. Loop has 32 letters. [2022-02-21 04:27:16,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,550 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 32 letters. [2022-02-21 04:27:16,550 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 65 letters. Loop has 32 letters. [2022-02-21 04:27:16,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 37 letters. [2022-02-21 04:27:16,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 37 letters. [2022-02-21 04:27:16,551 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,551 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 37 letters. [2022-02-21 04:27:16,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:27:16,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:27:16,552 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,552 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:27:16,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 76 letters. Loop has 32 letters. [2022-02-21 04:27:16,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 76 letters. Loop has 32 letters. [2022-02-21 04:27:16,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 76 letters. Loop has 32 letters. [2022-02-21 04:27:16,553 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,553 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 73 letters. Loop has 35 letters. [2022-02-21 04:27:16,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 35 letters. [2022-02-21 04:27:16,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 73 letters. Loop has 35 letters. [2022-02-21 04:27:16,554 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,554 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 37 letters. [2022-02-21 04:27:16,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 37 letters. [2022-02-21 04:27:16,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 37 letters. [2022-02-21 04:27:16,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,555 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 74 letters. Loop has 35 letters. [2022-02-21 04:27:16,555 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 35 letters. [2022-02-21 04:27:16,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 74 letters. Loop has 35 letters. [2022-02-21 04:27:16,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 74 letters. Loop has 36 letters. [2022-02-21 04:27:16,556 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 36 letters. [2022-02-21 04:27:16,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 74 letters. Loop has 36 letters. [2022-02-21 04:27:16,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 73 letters. Loop has 37 letters. [2022-02-21 04:27:16,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,557 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 37 letters. [2022-02-21 04:27:16,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 73 letters. Loop has 37 letters. [2022-02-21 04:27:16,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 81 letters. Loop has 32 letters. [2022-02-21 04:27:16,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 81 letters. Loop has 32 letters. [2022-02-21 04:27:16,558 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,558 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 81 letters. Loop has 32 letters. [2022-02-21 04:27:16,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 60 letters. Loop has 36 letters. [2022-02-21 04:27:16,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 36 letters. [2022-02-21 04:27:16,559 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,559 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 60 letters. Loop has 36 letters. [2022-02-21 04:27:16,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 78 letters. Loop has 32 letters. [2022-02-21 04:27:16,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 78 letters. Loop has 32 letters. [2022-02-21 04:27:16,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 78 letters. Loop has 32 letters. [2022-02-21 04:27:16,560 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,560 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 60 letters. Loop has 35 letters. [2022-02-21 04:27:16,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 35 letters. [2022-02-21 04:27:16,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 60 letters. Loop has 35 letters. [2022-02-21 04:27:16,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,561 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 60 letters. Loop has 37 letters. [2022-02-21 04:27:16,561 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 37 letters. [2022-02-21 04:27:16,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 60 letters. Loop has 37 letters. [2022-02-21 04:27:16,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 59 letters. Loop has 35 letters. [2022-02-21 04:27:16,562 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,562 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 35 letters. [2022-02-21 04:27:16,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 59 letters. Loop has 35 letters. [2022-02-21 04:27:16,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 77 letters. Loop has 37 letters. [2022-02-21 04:27:16,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,563 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 77 letters. Loop has 37 letters. [2022-02-21 04:27:16,563 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 77 letters. Loop has 37 letters. [2022-02-21 04:27:16,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 81 letters. Loop has 32 letters. [2022-02-21 04:27:16,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 81 letters. Loop has 32 letters. [2022-02-21 04:27:16,564 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,564 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 81 letters. Loop has 32 letters. [2022-02-21 04:27:16,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 75 letters. Loop has 35 letters. [2022-02-21 04:27:16,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 75 letters. Loop has 35 letters. [2022-02-21 04:27:16,565 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,565 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 75 letters. Loop has 35 letters. [2022-02-21 04:27:16,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 75 letters. Loop has 36 letters. [2022-02-21 04:27:16,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 75 letters. Loop has 36 letters. [2022-02-21 04:27:16,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 75 letters. Loop has 36 letters. [2022-02-21 04:27:16,566 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,566 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 61 letters. Loop has 35 letters. [2022-02-21 04:27:16,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 35 letters. [2022-02-21 04:27:16,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 61 letters. Loop has 35 letters. [2022-02-21 04:27:16,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,567 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 61 letters. Loop has 36 letters. [2022-02-21 04:27:16,567 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 36 letters. [2022-02-21 04:27:16,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 61 letters. Loop has 36 letters. [2022-02-21 04:27:16,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 73 letters. Loop has 37 letters. [2022-02-21 04:27:16,568 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,568 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 37 letters. [2022-02-21 04:27:16,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 73 letters. Loop has 37 letters. [2022-02-21 04:27:16,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 62 letters. Loop has 36 letters. [2022-02-21 04:27:16,569 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,569 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 36 letters. [2022-02-21 04:27:16,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 62 letters. Loop has 36 letters. [2022-02-21 04:27:16,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 74 letters. Loop has 37 letters. [2022-02-21 04:27:16,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 37 letters. [2022-02-21 04:27:16,570 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,570 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 74 letters. Loop has 37 letters. [2022-02-21 04:27:16,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 77 letters. Loop has 32 letters. [2022-02-21 04:27:16,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 77 letters. Loop has 32 letters. [2022-02-21 04:27:16,571 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,571 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 77 letters. Loop has 32 letters. [2022-02-21 04:27:16,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 35 letters. [2022-02-21 04:27:16,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,572 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 35 letters. [2022-02-21 04:27:16,572 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 35 letters. [2022-02-21 04:27:16,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 76 letters. Loop has 32 letters. [2022-02-21 04:27:16,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 76 letters. Loop has 32 letters. [2022-02-21 04:27:16,573 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,573 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 76 letters. Loop has 32 letters. [2022-02-21 04:27:16,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 70 letters. Loop has 36 letters. [2022-02-21 04:27:16,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 36 letters. [2022-02-21 04:27:16,574 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,574 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 70 letters. Loop has 36 letters. [2022-02-21 04:27:16,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 75 letters. Loop has 32 letters. [2022-02-21 04:27:16,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 75 letters. Loop has 32 letters. [2022-02-21 04:27:16,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,575 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 75 letters. Loop has 32 letters. [2022-02-21 04:27:16,575 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:27:16,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:27:16,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:27:16,576 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,576 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 74 letters. Loop has 32 letters. [2022-02-21 04:27:16,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 32 letters. [2022-02-21 04:27:16,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 74 letters. Loop has 32 letters. [2022-02-21 04:27:16,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,577 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 73 letters. Loop has 32 letters. [2022-02-21 04:27:16,577 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 32 letters. [2022-02-21 04:27:16,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 73 letters. Loop has 32 letters. [2022-02-21 04:27:16,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:27:16,578 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,578 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:27:16,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 32 letters. [2022-02-21 04:27:16,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:27:16,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,579 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:27:16,579 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:27:16,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 32 letters. [2022-02-21 04:27:16,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 32 letters. [2022-02-21 04:27:16,580 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,580 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 32 letters. [2022-02-21 04:27:16,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 75 letters. Loop has 35 letters. [2022-02-21 04:27:16,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 75 letters. Loop has 35 letters. [2022-02-21 04:27:16,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,581 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 75 letters. Loop has 35 letters. [2022-02-21 04:27:16,581 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:27:16,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:27:16,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:27:16,582 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,582 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 73 letters. Loop has 35 letters. [2022-02-21 04:27:16,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 35 letters. [2022-02-21 04:27:16,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 73 letters. Loop has 35 letters. [2022-02-21 04:27:16,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 76 letters. Loop has 35 letters. [2022-02-21 04:27:16,583 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,583 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 76 letters. Loop has 35 letters. [2022-02-21 04:27:16,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 76 letters. Loop has 35 letters. [2022-02-21 04:27:16,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 73 letters. Loop has 36 letters. [2022-02-21 04:27:16,584 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,584 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 36 letters. [2022-02-21 04:27:16,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 73 letters. Loop has 36 letters. [2022-02-21 04:27:16,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 76 letters. Loop has 37 letters. [2022-02-21 04:27:16,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,585 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 76 letters. Loop has 37 letters. [2022-02-21 04:27:16,585 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 76 letters. Loop has 37 letters. [2022-02-21 04:27:16,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:27:16,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:27:16,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:27:16,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 59 letters. Loop has 36 letters. [2022-02-21 04:27:16,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 36 letters. [2022-02-21 04:27:16,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 59 letters. Loop has 36 letters. [2022-02-21 04:27:16,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 59 letters. Loop has 35 letters. [2022-02-21 04:27:16,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 35 letters. [2022-02-21 04:27:16,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 59 letters. Loop has 35 letters. [2022-02-21 04:27:16,588 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,588 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 74 letters. Loop has 37 letters. [2022-02-21 04:27:16,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 37 letters. [2022-02-21 04:27:16,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 74 letters. Loop has 37 letters. [2022-02-21 04:27:16,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,589 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:27:16,589 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:27:16,590 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,590 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:27:16,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:27:16,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:27:16,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:27:16,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 36 letters. [2022-02-21 04:27:16,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 36 letters. [2022-02-21 04:27:16,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 36 letters. [2022-02-21 04:27:16,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 73 letters. Loop has 37 letters. [2022-02-21 04:27:16,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 37 letters. [2022-02-21 04:27:16,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 73 letters. Loop has 37 letters. [2022-02-21 04:27:16,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 35 letters. [2022-02-21 04:27:16,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 35 letters. [2022-02-21 04:27:16,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 35 letters. [2022-02-21 04:27:16,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 32 letters. [2022-02-21 04:27:16,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 32 letters. [2022-02-21 04:27:16,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 32 letters. [2022-02-21 04:27:16,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:27:16,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:27:16,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 35 letters. [2022-02-21 04:27:16,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:27:16,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:27:16,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:27:16,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 36 letters. [2022-02-21 04:27:16,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 36 letters. [2022-02-21 04:27:16,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 36 letters. [2022-02-21 04:27:16,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:27:16,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:27:16,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 70 letters. Loop has 32 letters. [2022-02-21 04:27:16,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:27:16,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:27:16,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:27:16,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 32 letters. [2022-02-21 04:27:16,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 32 letters. [2022-02-21 04:27:16,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 32 letters. [2022-02-21 04:27:16,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 35 letters. [2022-02-21 04:27:16,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 35 letters. [2022-02-21 04:27:16,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 35 letters. [2022-02-21 04:27:16,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:27:16,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:27:16,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 70 letters. Loop has 35 letters. [2022-02-21 04:27:16,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 36 letters. [2022-02-21 04:27:16,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 36 letters. [2022-02-21 04:27:16,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 36 letters. [2022-02-21 04:27:16,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:27:16,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,603 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:27:16,603 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 32 letters. [2022-02-21 04:27:16,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 66 letters. Loop has 32 letters. [2022-02-21 04:27:16,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 32 letters. [2022-02-21 04:27:16,604 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,604 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 66 letters. Loop has 32 letters. [2022-02-21 04:27:16,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 35 letters. [2022-02-21 04:27:16,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 35 letters. [2022-02-21 04:27:16,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,605 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 35 letters. [2022-02-21 04:27:16,605 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 70 letters. Loop has 36 letters. [2022-02-21 04:27:16,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 36 letters. [2022-02-21 04:27:16,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 70 letters. Loop has 36 letters. [2022-02-21 04:27:16,606 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,606 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:27:16,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:27:16,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:27:16,607 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,607 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 36 letters. [2022-02-21 04:27:16,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 36 letters. [2022-02-21 04:27:16,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 36 letters. [2022-02-21 04:27:16,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,608 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 36 letters. [2022-02-21 04:27:16,608 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 36 letters. [2022-02-21 04:27:16,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 36 letters. [2022-02-21 04:27:16,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,609 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:27:16,609 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:27:16,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:27:16,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,610 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 36 letters. [2022-02-21 04:27:16,610 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 36 letters. [2022-02-21 04:27:16,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 36 letters. [2022-02-21 04:27:16,611 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,611 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 86 letters. Loop has 32 letters. [2022-02-21 04:27:16,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 86 letters. Loop has 32 letters. [2022-02-21 04:27:16,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 86 letters. Loop has 32 letters. [2022-02-21 04:27:16,612 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:27:16,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:27:16,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:27:16,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 87 letters. Loop has 32 letters. [2022-02-21 04:27:16,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 87 letters. Loop has 32 letters. [2022-02-21 04:27:16,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 87 letters. Loop has 32 letters. [2022-02-21 04:27:16,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 66 letters. Loop has 36 letters. [2022-02-21 04:27:16,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 36 letters. [2022-02-21 04:27:16,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 66 letters. Loop has 36 letters. [2022-02-21 04:27:16,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 65 letters. Loop has 35 letters. [2022-02-21 04:27:16,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 35 letters. [2022-02-21 04:27:16,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 65 letters. Loop has 35 letters. [2022-02-21 04:27:16,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 64 letters. Loop has 32 letters. [2022-02-21 04:27:16,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 32 letters. [2022-02-21 04:27:16,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 64 letters. Loop has 32 letters. [2022-02-21 04:27:16,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 65 letters. Loop has 32 letters. [2022-02-21 04:27:16,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 32 letters. [2022-02-21 04:27:16,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 65 letters. Loop has 32 letters. [2022-02-21 04:27:16,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:27:16,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:27:16,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,618 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:27:16,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:27:16,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:27:16,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 66 letters. Loop has 35 letters. [2022-02-21 04:27:16,619 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,619 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 70 letters. Loop has 37 letters. [2022-02-21 04:27:16,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 37 letters. [2022-02-21 04:27:16,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 70 letters. Loop has 37 letters. [2022-02-21 04:27:16,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,620 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:27:16,620 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:27:16,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 35 letters. [2022-02-21 04:27:16,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 37 letters. [2022-02-21 04:27:16,621 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,621 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 37 letters. [2022-02-21 04:27:16,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 37 letters. [2022-02-21 04:27:16,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:27:16,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:27:16,622 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,622 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:27:16,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 65 letters. Loop has 35 letters. [2022-02-21 04:27:16,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 35 letters. [2022-02-21 04:27:16,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 65 letters. Loop has 35 letters. [2022-02-21 04:27:16,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 85 letters. Loop has 32 letters. [2022-02-21 04:27:16,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 85 letters. Loop has 32 letters. [2022-02-21 04:27:16,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 85 letters. Loop has 32 letters. [2022-02-21 04:27:16,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:27:16,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:27:16,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 35 letters. [2022-02-21 04:27:16,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 37 letters. [2022-02-21 04:27:16,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 37 letters. [2022-02-21 04:27:16,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 37 letters. [2022-02-21 04:27:16,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 69 letters. Loop has 37 letters. [2022-02-21 04:27:16,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 37 letters. [2022-02-21 04:27:16,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 69 letters. Loop has 37 letters. [2022-02-21 04:27:16,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 65 letters. Loop has 36 letters. [2022-02-21 04:27:16,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 36 letters. [2022-02-21 04:27:16,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 65 letters. Loop has 36 letters. [2022-02-21 04:27:16,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 64 letters. Loop has 35 letters. [2022-02-21 04:27:16,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 35 letters. [2022-02-21 04:27:16,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 64 letters. Loop has 35 letters. [2022-02-21 04:27:16,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 89 letters. Loop has 32 letters. [2022-02-21 04:27:16,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 89 letters. Loop has 32 letters. [2022-02-21 04:27:16,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 89 letters. Loop has 32 letters. [2022-02-21 04:27:16,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 64 letters. Loop has 36 letters. [2022-02-21 04:27:16,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 36 letters. [2022-02-21 04:27:16,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 64 letters. Loop has 36 letters. [2022-02-21 04:27:16,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 90 letters. Loop has 32 letters. [2022-02-21 04:27:16,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 90 letters. Loop has 32 letters. [2022-02-21 04:27:16,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 90 letters. Loop has 32 letters. [2022-02-21 04:27:16,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 63 letters. Loop has 35 letters. [2022-02-21 04:27:16,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 35 letters. [2022-02-21 04:27:16,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 63 letters. Loop has 35 letters. [2022-02-21 04:27:16,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:27:16,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:27:16,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:27:16,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 74 letters. Loop has 32 letters. [2022-02-21 04:27:16,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 32 letters. [2022-02-21 04:27:16,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 74 letters. Loop has 32 letters. [2022-02-21 04:27:16,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 63 letters. Loop has 36 letters. [2022-02-21 04:27:16,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 36 letters. [2022-02-21 04:27:16,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 63 letters. Loop has 36 letters. [2022-02-21 04:27:16,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 75 letters. Loop has 32 letters. [2022-02-21 04:27:16,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 75 letters. Loop has 32 letters. [2022-02-21 04:27:16,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 75 letters. Loop has 32 letters. [2022-02-21 04:27:16,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 62 letters. Loop has 36 letters. [2022-02-21 04:27:16,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 36 letters. [2022-02-21 04:27:16,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 62 letters. Loop has 36 letters. [2022-02-21 04:27:16,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 61 letters. Loop has 35 letters. [2022-02-21 04:27:16,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 35 letters. [2022-02-21 04:27:16,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 61 letters. Loop has 35 letters. [2022-02-21 04:27:16,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:27:16,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:27:16,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:27:16,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 61 letters. Loop has 32 letters. [2022-02-21 04:27:16,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 32 letters. [2022-02-21 04:27:16,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 61 letters. Loop has 32 letters. [2022-02-21 04:27:16,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:27:16,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:27:16,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:27:16,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 37 letters. [2022-02-21 04:27:16,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 37 letters. [2022-02-21 04:27:16,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 37 letters. [2022-02-21 04:27:16,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 80 letters. Loop has 32 letters. [2022-02-21 04:27:16,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 80 letters. Loop has 32 letters. [2022-02-21 04:27:16,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 80 letters. Loop has 32 letters. [2022-02-21 04:27:16,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 37 letters. [2022-02-21 04:27:16,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 37 letters. [2022-02-21 04:27:16,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 37 letters. [2022-02-21 04:27:16,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 57 letters. Loop has 32 letters. [2022-02-21 04:27:16,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 32 letters. [2022-02-21 04:27:16,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 57 letters. Loop has 32 letters. [2022-02-21 04:27:16,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 56 letters. Loop has 32 letters. [2022-02-21 04:27:16,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 32 letters. [2022-02-21 04:27:16,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 56 letters. Loop has 32 letters. [2022-02-21 04:27:16,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 66 letters. Loop has 37 letters. [2022-02-21 04:27:16,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 37 letters. [2022-02-21 04:27:16,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 66 letters. Loop has 37 letters. [2022-02-21 04:27:16,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 64 letters. Loop has 35 letters. [2022-02-21 04:27:16,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 35 letters. [2022-02-21 04:27:16,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 64 letters. Loop has 35 letters. [2022-02-21 04:27:16,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 65 letters. Loop has 37 letters. [2022-02-21 04:27:16,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 37 letters. [2022-02-21 04:27:16,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 65 letters. Loop has 37 letters. [2022-02-21 04:27:16,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:27:16,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:27:16,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 62 letters. Loop has 35 letters. [2022-02-21 04:27:16,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 86 letters. Loop has 32 letters. [2022-02-21 04:27:16,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 86 letters. Loop has 32 letters. [2022-02-21 04:27:16,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 86 letters. Loop has 32 letters. [2022-02-21 04:27:16,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 58 letters. Loop has 36 letters. [2022-02-21 04:27:16,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 36 letters. [2022-02-21 04:27:16,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 58 letters. Loop has 36 letters. [2022-02-21 04:27:16,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 85 letters. Loop has 32 letters. [2022-02-21 04:27:16,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 85 letters. Loop has 32 letters. [2022-02-21 04:27:16,651 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,651 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 85 letters. Loop has 32 letters. [2022-02-21 04:27:16,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 58 letters. Loop has 35 letters. [2022-02-21 04:27:16,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 35 letters. [2022-02-21 04:27:16,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 58 letters. Loop has 35 letters. [2022-02-21 04:27:16,652 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,652 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 65 letters. Loop has 37 letters. [2022-02-21 04:27:16,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 37 letters. [2022-02-21 04:27:16,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 65 letters. Loop has 37 letters. [2022-02-21 04:27:16,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,653 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 63 letters. Loop has 35 letters. [2022-02-21 04:27:16,653 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 35 letters. [2022-02-21 04:27:16,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 63 letters. Loop has 35 letters. [2022-02-21 04:27:16,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 32 letters. [2022-02-21 04:27:16,654 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,654 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 32 letters. [2022-02-21 04:27:16,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 32 letters. [2022-02-21 04:27:16,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 64 letters. Loop has 37 letters. [2022-02-21 04:27:16,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,655 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 37 letters. [2022-02-21 04:27:16,655 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 64 letters. Loop has 37 letters. [2022-02-21 04:27:16,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 84 letters. Loop has 32 letters. [2022-02-21 04:27:16,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 84 letters. Loop has 32 letters. [2022-02-21 04:27:16,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,656 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 84 letters. Loop has 32 letters. [2022-02-21 04:27:16,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 64 letters. Loop has 37 letters. [2022-02-21 04:27:16,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 37 letters. [2022-02-21 04:27:16,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 64 letters. Loop has 37 letters. [2022-02-21 04:27:16,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 63 letters. Loop has 37 letters. [2022-02-21 04:27:16,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 37 letters. [2022-02-21 04:27:16,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 63 letters. Loop has 37 letters. [2022-02-21 04:27:16,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 83 letters. Loop has 32 letters. [2022-02-21 04:27:16,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 83 letters. Loop has 32 letters. [2022-02-21 04:27:16,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 83 letters. Loop has 32 letters. [2022-02-21 04:27:16,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 76 letters. Loop has 35 letters. [2022-02-21 04:27:16,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 76 letters. Loop has 35 letters. [2022-02-21 04:27:16,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 76 letters. Loop has 35 letters. [2022-02-21 04:27:16,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 77 letters. Loop has 36 letters. [2022-02-21 04:27:16,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 77 letters. Loop has 36 letters. [2022-02-21 04:27:16,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 77 letters. Loop has 36 letters. [2022-02-21 04:27:16,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 73 letters. Loop has 37 letters. [2022-02-21 04:27:16,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 37 letters. [2022-02-21 04:27:16,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 73 letters. Loop has 37 letters. [2022-02-21 04:27:16,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 77 letters. Loop has 35 letters. [2022-02-21 04:27:16,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 77 letters. Loop has 35 letters. [2022-02-21 04:27:16,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 77 letters. Loop has 35 letters. [2022-02-21 04:27:16,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:27:16,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:27:16,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 35 letters. [2022-02-21 04:27:16,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 78 letters. Loop has 37 letters. [2022-02-21 04:27:16,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 78 letters. Loop has 37 letters. [2022-02-21 04:27:16,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 78 letters. Loop has 37 letters. [2022-02-21 04:27:16,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 37 letters. [2022-02-21 04:27:16,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 37 letters. [2022-02-21 04:27:16,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 37 letters. [2022-02-21 04:27:16,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 72 letters. Loop has 37 letters. [2022-02-21 04:27:16,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 37 letters. [2022-02-21 04:27:16,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 72 letters. Loop has 37 letters. [2022-02-21 04:27:16,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 67 letters. Loop has 37 letters. [2022-02-21 04:27:16,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 37 letters. [2022-02-21 04:27:16,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 67 letters. Loop has 37 letters. [2022-02-21 04:27:16,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 71 letters. Loop has 37 letters. [2022-02-21 04:27:16,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 37 letters. [2022-02-21 04:27:16,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 71 letters. Loop has 37 letters. [2022-02-21 04:27:16,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 68 letters. Loop has 37 letters. [2022-02-21 04:27:16,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 37 letters. [2022-02-21 04:27:16,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 68 letters. Loop has 37 letters. [2022-02-21 04:27:16,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 80 letters. Loop has 32 letters. [2022-02-21 04:27:16,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 80 letters. Loop has 32 letters. [2022-02-21 04:27:16,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 80 letters. Loop has 32 letters. [2022-02-21 04:27:16,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 60 letters. Loop has 35 letters. [2022-02-21 04:27:16,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 35 letters. [2022-02-21 04:27:16,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 60 letters. Loop has 35 letters. [2022-02-21 04:27:16,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:27:16,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:27:16,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:27:16,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 61 letters. Loop has 37 letters. [2022-02-21 04:27:16,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 37 letters. [2022-02-21 04:27:16,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 61 letters. Loop has 37 letters. [2022-02-21 04:27:16,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 383 states and 662 transitions. cyclomatic complexity: 280 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:27:16,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:27:16,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 573 states and 970 transitions. cyclomatic complexity: 398 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:27:16,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,673 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:27:16,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 29.0) internal successors, (87), 3 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:27:16,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 528 transitions. [2022-02-21 04:27:16,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 528 transitions. Stem has 55 letters. Loop has 32 letters. [2022-02-21 04:27:16,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 528 transitions. Stem has 87 letters. Loop has 32 letters. [2022-02-21 04:27:16,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 528 transitions. Stem has 55 letters. Loop has 64 letters. [2022-02-21 04:27:16,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:27:16,677 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 573 states and 970 transitions. cyclomatic complexity: 398 [2022-02-21 04:27:16,688 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:27:16,688 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 573 states to 0 states and 0 transitions. [2022-02-21 04:27:16,689 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:27:16,689 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:27:16,689 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:27:16,689 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:27:16,689 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:27:16,689 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:27:16,689 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:27:16,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:27:16,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:27:16,690 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:27:16,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:27:16,690 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 04:27:16,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 04:27:16,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 11.0) internal successors, (55), 5 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:27:16,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 55 edges. 55 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:27:16,729 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-02-21 04:27:16,729 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:27:16,729 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 04:27:16,729 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:27:16,729 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:27:16,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:27:16,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:27:16,729 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:27:16,729 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:27:16,729 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:27:16,729 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:27:16,730 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:27:16,730 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:27:16,730 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:27:16,734 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:27:16 BoogieIcfgContainer [2022-02-21 04:27:16,734 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:27:16,735 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:27:16,735 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:27:16,735 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:27:16,735 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:27:09" (3/4) ... [2022-02-21 04:27:16,737 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:27:16,737 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:27:16,738 INFO L158 Benchmark]: Toolchain (without parser) took 8694.98ms. Allocated memory was 98.6MB in the beginning and 262.1MB in the end (delta: 163.6MB). Free memory was 69.5MB in the beginning and 139.0MB in the end (delta: -69.5MB). Peak memory consumption was 95.4MB. Max. memory is 16.1GB. [2022-02-21 04:27:16,738 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 98.6MB. Free memory is still 57.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:27:16,738 INFO L158 Benchmark]: CACSL2BoogieTranslator took 467.91ms. Allocated memory is still 98.6MB. Free memory was 69.2MB in the beginning and 58.0MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-21 04:27:16,739 INFO L158 Benchmark]: Boogie Procedure Inliner took 59.15ms. Allocated memory is still 98.6MB. Free memory was 58.0MB in the beginning and 51.8MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-21 04:27:16,739 INFO L158 Benchmark]: Boogie Preprocessor took 42.76ms. Allocated memory is still 98.6MB. Free memory was 51.7MB in the beginning and 47.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 04:27:16,739 INFO L158 Benchmark]: RCFGBuilder took 894.44ms. Allocated memory is still 146.8MB. Free memory was 121.7MB in the beginning and 109.1MB in the end (delta: 12.6MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. [2022-02-21 04:27:16,739 INFO L158 Benchmark]: BuchiAutomizer took 7202.54ms. Allocated memory was 146.8MB in the beginning and 262.1MB in the end (delta: 115.3MB). Free memory was 109.1MB in the beginning and 139.0MB in the end (delta: -29.9MB). Peak memory consumption was 85.4MB. Max. memory is 16.1GB. [2022-02-21 04:27:16,740 INFO L158 Benchmark]: Witness Printer took 2.33ms. Allocated memory is still 262.1MB. Free memory is still 139.0MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:27:16,741 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 98.6MB. Free memory is still 57.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 467.91ms. Allocated memory is still 98.6MB. Free memory was 69.2MB in the beginning and 58.0MB in the end (delta: 11.2MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 59.15ms. Allocated memory is still 98.6MB. Free memory was 58.0MB in the beginning and 51.8MB in the end (delta: 6.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Preprocessor took 42.76ms. Allocated memory is still 98.6MB. Free memory was 51.7MB in the beginning and 47.5MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 894.44ms. Allocated memory is still 146.8MB. Free memory was 121.7MB in the beginning and 109.1MB in the end (delta: 12.6MB). Peak memory consumption was 47.4MB. Max. memory is 16.1GB. * BuchiAutomizer took 7202.54ms. Allocated memory was 146.8MB in the beginning and 262.1MB in the end (delta: 115.3MB). Free memory was 109.1MB in the beginning and 139.0MB in the end (delta: -29.9MB). Peak memory consumption was 85.4MB. Max. memory is 16.1GB. * Witness Printer took 2.33ms. Allocated memory is still 262.1MB. Free memory is still 139.0MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 4 terminating modules (3 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 15 + -2 * i2 and consists of 3 locations. 3 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.1s and 4 iterations. TraceHistogramMax:1. Analysis of lassos took 3.7s. Construction of modules took 0.0s. Büchi inclusion checks took 2.9s. Highest rank in rank-based complementation 3. Minimization of det autom 4. Minimization of nondet autom 0. Automata minimization 0.2s AutomataMinimizationTime, 2 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 383 states and ocurred in iteration 2. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 667 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 667 mSDsluCounter, 4000 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 2285 mSDsCounter, 19 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 19 mSolverCounterUnsat, 1715 mSDtfsCounter, 36 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT0 conc0 concLT0 SILN0 SILU0 SILI2 SILT1 lasso0 LassoPreprocessingBenchmarks: Lassos: inital182 mio100 ax100 hnf100 lsp40 ukn100 mio100 lsp100 div100 bol100 ite100 ukn100 eq229 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 27ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.1s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 04:27:16,779 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