./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for termination Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerTermination.xml -i ../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(F end) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 368647bf8c8fe53592ceb4314bbebffd0b8c087a8115d4714b27d4e56ab0a9cf --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:31:29,807 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:31:29,808 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:31:29,832 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:31:29,832 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:31:29,833 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:31:29,834 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:31:29,836 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:31:29,837 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:31:29,838 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:31:29,839 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:31:29,840 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:31:29,840 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:31:29,841 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:31:29,842 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:31:29,842 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:31:29,843 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:31:29,844 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:31:29,845 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:31:29,847 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:31:29,848 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:31:29,849 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:31:29,850 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:31:29,851 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:31:29,854 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:31:29,854 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:31:29,854 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:31:29,855 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:31:29,856 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:31:29,856 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:31:29,857 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:31:29,857 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:31:29,858 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:31:29,859 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:31:29,860 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:31:29,860 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:31:29,861 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:31:29,861 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:31:29,862 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:31:29,863 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:31:29,866 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:31:29,867 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 04:31:29,893 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:31:29,893 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:31:29,894 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:31:29,894 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:31:29,895 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:31:29,895 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:31:29,895 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:31:29,896 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:31:29,896 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:31:29,896 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:31:29,897 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:31:29,897 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:31:29,897 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:31:29,897 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:31:29,898 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:31:29,898 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:31:29,898 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:31:29,898 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:31:29,898 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:31:29,898 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:31:29,899 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:31:29,899 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:31:29,899 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:31:29,899 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:31:29,899 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:31:29,900 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:31:29,900 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:31:29,900 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:31:29,900 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:31:29,900 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:31:29,901 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:31:29,902 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:31:29,902 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 -> 368647bf8c8fe53592ceb4314bbebffd0b8c087a8115d4714b27d4e56ab0a9cf [2022-02-21 04:31:30,106 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:31:30,127 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:31:30,130 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:31:30,131 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:31:30,132 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:31:30,133 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c [2022-02-21 04:31:30,209 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faf83fecd/74f5ac1ffdb34d7fbd78ca2b8a14b8ed/FLAGe78c0df5d [2022-02-21 04:31:30,608 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:31:30,609 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c [2022-02-21 04:31:30,617 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faf83fecd/74f5ac1ffdb34d7fbd78ca2b8a14b8ed/FLAGe78c0df5d [2022-02-21 04:31:30,641 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/faf83fecd/74f5ac1ffdb34d7fbd78ca2b8a14b8ed [2022-02-21 04:31:30,644 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:31:30,645 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:31:30,646 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:31:30,646 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:31:30,649 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:31:30,650 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:31:30" (1/1) ... [2022-02-21 04:31:30,651 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@699e51e1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:30, skipping insertion in model container [2022-02-21 04:31:30,651 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:31:30" (1/1) ... [2022-02-21 04:31:30,657 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:31:30,688 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:31:30,967 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c[14371,14384] [2022-02-21 04:31:30,970 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:31:30,978 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:31:31,043 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c[14371,14384] [2022-02-21 04:31:31,044 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:31:31,057 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:31:31,058 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:31 WrapperNode [2022-02-21 04:31:31,058 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:31:31,060 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:31:31,060 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:31:31,060 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:31:31,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:31" (1/1) ... [2022-02-21 04:31:31,087 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:31" (1/1) ... [2022-02-21 04:31:31,131 INFO L137 Inliner]: procedures = 22, calls = 14, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 459 [2022-02-21 04:31:31,132 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:31:31,133 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:31:31,133 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:31:31,133 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:31:31,140 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:31" (1/1) ... [2022-02-21 04:31:31,141 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:31" (1/1) ... [2022-02-21 04:31:31,143 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:31" (1/1) ... [2022-02-21 04:31:31,144 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:31" (1/1) ... [2022-02-21 04:31:31,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:31" (1/1) ... [2022-02-21 04:31:31,158 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:31" (1/1) ... [2022-02-21 04:31:31,161 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:31" (1/1) ... [2022-02-21 04:31:31,164 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:31:31,165 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:31:31,165 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:31:31,165 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:31:31,166 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:31" (1/1) ... [2022-02-21 04:31:31,181 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:31,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:31,216 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:31,221 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (1)] Waiting until timeout for monitored process [2022-02-21 04:31:31,247 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:31:31,247 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:31:31,248 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:31:31,248 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:31:31,341 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:31:31,343 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:31:31,902 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:31:31,911 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:31:31,911 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 04:31:31,914 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:31:31 BoogieIcfgContainer [2022-02-21 04:31:31,915 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:31:31,916 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:31:31,917 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:31:31,920 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:31:31,921 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:31:31,921 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:31:30" (1/3) ... [2022-02-21 04:31:31,922 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@36edb547 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:31:31, skipping insertion in model container [2022-02-21 04:31:31,922 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:31:31,922 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:31:31" (2/3) ... [2022-02-21 04:31:31,922 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@36edb547 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:31:31, skipping insertion in model container [2022-02-21 04:31:31,922 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:31:31,922 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:31:31" (3/3) ... [2022-02-21 04:31:31,923 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c [2022-02-21 04:31:31,965 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:31:31,966 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:31:31,966 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:31:31,966 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:31:31,967 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:31:31,967 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:31:31,967 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:31:31,967 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:31:31,992 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 142 states, 141 states have (on average 1.75177304964539) internal successors, (247), 141 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:32,063 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2022-02-21 04:31:32,064 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:31:32,064 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:31:32,071 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:31:32,071 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:31:32,071 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:31:32,076 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 142 states, 141 states have (on average 1.75177304964539) internal successors, (247), 141 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:32,103 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 78 [2022-02-21 04:31:32,103 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:31:32,103 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:31:32,105 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:31:32,106 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:31:32,112 INFO L791 eck$LassoCheckResult]: Stem: 121#ULTIMATE.startENTRYtrue assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; 39#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 31#L258true assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 75#L261-1true init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 33#L271true assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 77#L274-1true init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 58#L284true assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 134#L287-1true init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 34#L297true assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 42#L300-1true init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 68#L310true assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 124#L313-1true init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 4#L323true assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 21#L326-1true init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 76#L336true assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 6#L336-1true init_#res#1 := init_~tmp___5~0#1; 15#L457true main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 96#L21true assume !(0 == assume_abort_if_not_~cond#1); 14#L20true assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 32#L568-2true [2022-02-21 04:31:32,118 INFO L793 eck$LassoCheckResult]: Loop: 32#L568-2true assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 90#L82true assume !(0 != ~mode1~0 % 256); 65#L110true assume !(~r1~0 < 2); 17#L110-1true ~mode1~0 := 1; 133#L82-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 110#L133true assume !(0 != ~mode2~0 % 256); 9#L161true assume !(~r2~0 < 2); 67#L161-1true ~mode2~0 := 1; 23#L133-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 80#L184true assume !(0 != ~mode3~0 % 256); 69#L212true assume !(~r3~0 < 2); 99#L212-1true ~mode3~0 := 1; 79#L184-2true assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 137#L465true assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; 132#L465-1true check_#res#1 := check_~tmp~1#1; 97#L513true main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 118#L598true assume !(0 == assert_~arg#1 % 256); 74#L593true assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; 32#L568-2true [2022-02-21 04:31:32,126 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:32,127 INFO L85 PathProgramCache]: Analyzing trace with hash 1744745224, now seen corresponding path program 1 times [2022-02-21 04:31:32,139 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:32,139 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2090075938] [2022-02-21 04:31:32,139 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:32,140 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:32,310 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:32,431 INFO L290 TraceCheckUtils]: 0: Hoare triple {146#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {146#true} is VALID [2022-02-21 04:31:32,431 INFO L290 TraceCheckUtils]: 1: Hoare triple {146#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {146#true} is VALID [2022-02-21 04:31:32,431 INFO L290 TraceCheckUtils]: 2: Hoare triple {146#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {146#true} is VALID [2022-02-21 04:31:32,432 INFO L290 TraceCheckUtils]: 3: Hoare triple {146#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {146#true} is VALID [2022-02-21 04:31:32,432 INFO L290 TraceCheckUtils]: 4: Hoare triple {146#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {146#true} is VALID [2022-02-21 04:31:32,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {146#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {146#true} is VALID [2022-02-21 04:31:32,433 INFO L290 TraceCheckUtils]: 6: Hoare triple {146#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {146#true} is VALID [2022-02-21 04:31:32,433 INFO L290 TraceCheckUtils]: 7: Hoare triple {146#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {146#true} is VALID [2022-02-21 04:31:32,434 INFO L290 TraceCheckUtils]: 8: Hoare triple {146#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {146#true} is VALID [2022-02-21 04:31:32,434 INFO L290 TraceCheckUtils]: 9: Hoare triple {146#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {146#true} is VALID [2022-02-21 04:31:32,434 INFO L290 TraceCheckUtils]: 10: Hoare triple {146#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {146#true} is VALID [2022-02-21 04:31:32,434 INFO L290 TraceCheckUtils]: 11: Hoare triple {146#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {146#true} is VALID [2022-02-21 04:31:32,435 INFO L290 TraceCheckUtils]: 12: Hoare triple {146#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {146#true} is VALID [2022-02-21 04:31:32,435 INFO L290 TraceCheckUtils]: 13: Hoare triple {146#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {146#true} is VALID [2022-02-21 04:31:32,436 INFO L290 TraceCheckUtils]: 14: Hoare triple {146#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; {148#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} is VALID [2022-02-21 04:31:32,436 INFO L290 TraceCheckUtils]: 15: Hoare triple {148#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} init_#res#1 := init_~tmp___5~0#1; {149#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:31:32,437 INFO L290 TraceCheckUtils]: 16: Hoare triple {149#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {150#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:31:32,437 INFO L290 TraceCheckUtils]: 17: Hoare triple {150#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {147#false} is VALID [2022-02-21 04:31:32,437 INFO L290 TraceCheckUtils]: 18: Hoare triple {147#false} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {147#false} is VALID [2022-02-21 04:31:32,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:31:32,439 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:31:32,439 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2090075938] [2022-02-21 04:31:32,440 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2090075938] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:31:32,440 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:31:32,440 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:31:32,441 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704241617] [2022-02-21 04:31:32,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:31:32,446 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:31:32,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:32,448 INFO L85 PathProgramCache]: Analyzing trace with hash 339208114, now seen corresponding path program 1 times [2022-02-21 04:31:32,449 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:32,449 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [785748619] [2022-02-21 04:31:32,449 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:32,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:32,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:32,574 INFO L290 TraceCheckUtils]: 0: Hoare triple {151#true} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {151#true} is VALID [2022-02-21 04:31:32,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {151#true} assume !(0 != ~mode1~0 % 256); {151#true} is VALID [2022-02-21 04:31:32,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {151#true} assume !(~r1~0 < 2); {151#true} is VALID [2022-02-21 04:31:32,576 INFO L290 TraceCheckUtils]: 3: Hoare triple {151#true} ~mode1~0 := 1; {151#true} is VALID [2022-02-21 04:31:32,576 INFO L290 TraceCheckUtils]: 4: Hoare triple {151#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {151#true} is VALID [2022-02-21 04:31:32,576 INFO L290 TraceCheckUtils]: 5: Hoare triple {151#true} assume !(0 != ~mode2~0 % 256); {151#true} is VALID [2022-02-21 04:31:32,577 INFO L290 TraceCheckUtils]: 6: Hoare triple {151#true} assume !(~r2~0 < 2); {151#true} is VALID [2022-02-21 04:31:32,577 INFO L290 TraceCheckUtils]: 7: Hoare triple {151#true} ~mode2~0 := 1; {151#true} is VALID [2022-02-21 04:31:32,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {151#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {151#true} is VALID [2022-02-21 04:31:32,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {151#true} assume !(0 != ~mode3~0 % 256); {151#true} is VALID [2022-02-21 04:31:32,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {151#true} assume !(~r3~0 < 2); {151#true} is VALID [2022-02-21 04:31:32,578 INFO L290 TraceCheckUtils]: 11: Hoare triple {151#true} ~mode3~0 := 1; {151#true} is VALID [2022-02-21 04:31:32,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {151#true} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {151#true} is VALID [2022-02-21 04:31:32,579 INFO L290 TraceCheckUtils]: 13: Hoare triple {151#true} assume !(~st1~0 + ~st2~0 + ~st3~0 <= 1);check_~tmp~1#1 := 0; {153#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:31:32,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {153#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {154#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:31:32,581 INFO L290 TraceCheckUtils]: 15: Hoare triple {154#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {155#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} is VALID [2022-02-21 04:31:32,582 INFO L290 TraceCheckUtils]: 16: Hoare triple {155#(and (not (<= (+ (div |ULTIMATE.start_assert_~arg#1| 256) 1) 0)) (<= |ULTIMATE.start_assert_~arg#1| (* 256 (div |ULTIMATE.start_assert_~arg#1| 256))))} assume !(0 == assert_~arg#1 % 256); {152#false} is VALID [2022-02-21 04:31:32,582 INFO L290 TraceCheckUtils]: 17: Hoare triple {152#false} assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; {152#false} is VALID [2022-02-21 04:31:32,582 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:31:32,583 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:31:32,583 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [785748619] [2022-02-21 04:31:32,583 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [785748619] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:31:32,584 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:31:32,584 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:31:32,584 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1303575817] [2022-02-21 04:31:32,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:31:32,585 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:31:32,586 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:31:32,607 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:31:32,607 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:31:32,609 INFO L87 Difference]: Start difference. First operand has 142 states, 141 states have (on average 1.75177304964539) internal successors, (247), 141 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:33,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:33,267 INFO L93 Difference]: Finished difference Result 146 states and 247 transitions. [2022-02-21 04:31:33,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:31:33,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:33,286 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:31:33,291 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 146 states and 247 transitions. [2022-02-21 04:31:33,297 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2022-02-21 04:31:33,304 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 146 states to 137 states and 231 transitions. [2022-02-21 04:31:33,306 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2022-02-21 04:31:33,306 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2022-02-21 04:31:33,307 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 231 transitions. [2022-02-21 04:31:33,307 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:31:33,308 INFO L681 BuchiCegarLoop]: Abstraction has 137 states and 231 transitions. [2022-02-21 04:31:33,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 231 transitions. [2022-02-21 04:31:33,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2022-02-21 04:31:33,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:31:33,337 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states and 231 transitions. Second operand has 137 states, 137 states have (on average 1.686131386861314) internal successors, (231), 136 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:33,338 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states and 231 transitions. Second operand has 137 states, 137 states have (on average 1.686131386861314) internal successors, (231), 136 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:33,339 INFO L87 Difference]: Start difference. First operand 137 states and 231 transitions. Second operand has 137 states, 137 states have (on average 1.686131386861314) internal successors, (231), 136 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:33,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:33,349 INFO L93 Difference]: Finished difference Result 137 states and 231 transitions. [2022-02-21 04:31:33,349 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 231 transitions. [2022-02-21 04:31:33,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:33,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:33,352 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 137 states have (on average 1.686131386861314) internal successors, (231), 136 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 137 states and 231 transitions. [2022-02-21 04:31:33,352 INFO L87 Difference]: Start difference. First operand has 137 states, 137 states have (on average 1.686131386861314) internal successors, (231), 136 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 137 states and 231 transitions. [2022-02-21 04:31:33,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:33,358 INFO L93 Difference]: Finished difference Result 137 states and 231 transitions. [2022-02-21 04:31:33,358 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 231 transitions. [2022-02-21 04:31:33,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:33,363 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:33,363 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:31:33,363 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:31:33,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 137 states have (on average 1.686131386861314) internal successors, (231), 136 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:33,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 231 transitions. [2022-02-21 04:31:33,369 INFO L704 BuchiCegarLoop]: Abstraction has 137 states and 231 transitions. [2022-02-21 04:31:33,369 INFO L587 BuchiCegarLoop]: Abstraction has 137 states and 231 transitions. [2022-02-21 04:31:33,369 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:31:33,369 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 231 transitions. [2022-02-21 04:31:33,371 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2022-02-21 04:31:33,372 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:31:33,372 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:31:33,374 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:31:33,374 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:31:33,374 INFO L791 eck$LassoCheckResult]: Stem: 434#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; 377#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 361#L258 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 362#L261-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 365#L271 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 366#L274-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 400#L284 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 355#L287-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 368#L297 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 369#L300-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 381#L310 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 345#L313-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 306#L323 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 308#L326-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 342#L336 assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; 312#L336-1 init_#res#1 := init_~tmp___5~0#1; 313#L457 main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 335#L21 assume !(0 == assume_abort_if_not_~cond#1); 331#L20 assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 332#L568-2 [2022-02-21 04:31:33,375 INFO L793 eck$LassoCheckResult]: Loop: 332#L568-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 364#L82 assume !(0 != ~mode1~0 % 256); 407#L110 assume !(~r1~0 < 2); 315#L110-1 ~mode1~0 := 1; 336#L82-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 429#L133 assume !(0 != ~mode2~0 % 256); 319#L161 assume !(~r2~0 < 2); 310#L161-1 ~mode2~0 := 1; 346#L133-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 347#L184 assume !(0 != ~mode3~0 % 256); 410#L212 assume !(~r3~0 < 2); 384#L212-1 ~mode3~0 := 1; 415#L184-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 416#L465 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 441#L466 assume ~st1~0 + ~nl1~0 <= 1; 442#L467 assume ~st2~0 + ~nl2~0 <= 1; 435#L468 assume ~st3~0 + ~nl3~0 <= 1; 321#L469 assume ~r1~0 >= 2; 322#L473 assume ~r1~0 < 2; 357#L478 assume ~r1~0 >= 2; 399#L483 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 330#L465-1 check_#res#1 := check_~tmp~1#1; 425#L513 main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 426#L598 assume !(0 == assert_~arg#1 % 256); 414#L593 assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; 332#L568-2 [2022-02-21 04:31:33,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:33,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1744745224, now seen corresponding path program 2 times [2022-02-21 04:31:33,376 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:33,376 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697175331] [2022-02-21 04:31:33,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:33,377 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:33,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:33,429 INFO L290 TraceCheckUtils]: 0: Hoare triple {720#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {720#true} is VALID [2022-02-21 04:31:33,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {720#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {720#true} is VALID [2022-02-21 04:31:33,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {720#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {720#true} is VALID [2022-02-21 04:31:33,430 INFO L290 TraceCheckUtils]: 3: Hoare triple {720#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {720#true} is VALID [2022-02-21 04:31:33,430 INFO L290 TraceCheckUtils]: 4: Hoare triple {720#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {720#true} is VALID [2022-02-21 04:31:33,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {720#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {720#true} is VALID [2022-02-21 04:31:33,430 INFO L290 TraceCheckUtils]: 6: Hoare triple {720#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {720#true} is VALID [2022-02-21 04:31:33,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {720#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {720#true} is VALID [2022-02-21 04:31:33,431 INFO L290 TraceCheckUtils]: 8: Hoare triple {720#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {720#true} is VALID [2022-02-21 04:31:33,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {720#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {720#true} is VALID [2022-02-21 04:31:33,431 INFO L290 TraceCheckUtils]: 10: Hoare triple {720#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {720#true} is VALID [2022-02-21 04:31:33,432 INFO L290 TraceCheckUtils]: 11: Hoare triple {720#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {720#true} is VALID [2022-02-21 04:31:33,432 INFO L290 TraceCheckUtils]: 12: Hoare triple {720#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {720#true} is VALID [2022-02-21 04:31:33,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {720#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {720#true} is VALID [2022-02-21 04:31:33,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {720#true} assume !(~id1~0 != ~id2~0);init_~tmp___5~0#1 := 0; {722#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} is VALID [2022-02-21 04:31:33,433 INFO L290 TraceCheckUtils]: 15: Hoare triple {722#(= |ULTIMATE.start_init_~tmp___5~0#1| 0)} init_#res#1 := init_~tmp___5~0#1; {723#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:31:33,434 INFO L290 TraceCheckUtils]: 16: Hoare triple {723#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {724#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:31:33,434 INFO L290 TraceCheckUtils]: 17: Hoare triple {724#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {721#false} is VALID [2022-02-21 04:31:33,434 INFO L290 TraceCheckUtils]: 18: Hoare triple {721#false} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {721#false} is VALID [2022-02-21 04:31:33,438 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:31:33,439 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:31:33,439 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697175331] [2022-02-21 04:31:33,439 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697175331] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:31:33,439 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:31:33,439 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:31:33,440 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974809649] [2022-02-21 04:31:33,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:31:33,440 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:31:33,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:33,441 INFO L85 PathProgramCache]: Analyzing trace with hash -191058054, now seen corresponding path program 1 times [2022-02-21 04:31:33,441 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:33,441 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1904203338] [2022-02-21 04:31:33,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:33,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:33,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:33,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {725#true} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {725#true} is VALID [2022-02-21 04:31:33,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {725#true} assume !(0 != ~mode1~0 % 256); {725#true} is VALID [2022-02-21 04:31:33,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {725#true} assume !(~r1~0 < 2); {727#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:33,496 INFO L290 TraceCheckUtils]: 3: Hoare triple {727#(not (<= ~r1~0 1))} ~mode1~0 := 1; {727#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:33,497 INFO L290 TraceCheckUtils]: 4: Hoare triple {727#(not (<= ~r1~0 1))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {727#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:33,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {727#(not (<= ~r1~0 1))} assume !(0 != ~mode2~0 % 256); {727#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:33,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {727#(not (<= ~r1~0 1))} assume !(~r2~0 < 2); {727#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:33,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {727#(not (<= ~r1~0 1))} ~mode2~0 := 1; {727#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:33,499 INFO L290 TraceCheckUtils]: 8: Hoare triple {727#(not (<= ~r1~0 1))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {727#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:33,499 INFO L290 TraceCheckUtils]: 9: Hoare triple {727#(not (<= ~r1~0 1))} assume !(0 != ~mode3~0 % 256); {727#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:33,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {727#(not (<= ~r1~0 1))} assume !(~r3~0 < 2); {727#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:33,500 INFO L290 TraceCheckUtils]: 11: Hoare triple {727#(not (<= ~r1~0 1))} ~mode3~0 := 1; {727#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:33,500 INFO L290 TraceCheckUtils]: 12: Hoare triple {727#(not (<= ~r1~0 1))} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {727#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:33,501 INFO L290 TraceCheckUtils]: 13: Hoare triple {727#(not (<= ~r1~0 1))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {727#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:33,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {727#(not (<= ~r1~0 1))} assume ~st1~0 + ~nl1~0 <= 1; {727#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:33,502 INFO L290 TraceCheckUtils]: 15: Hoare triple {727#(not (<= ~r1~0 1))} assume ~st2~0 + ~nl2~0 <= 1; {727#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:33,502 INFO L290 TraceCheckUtils]: 16: Hoare triple {727#(not (<= ~r1~0 1))} assume ~st3~0 + ~nl3~0 <= 1; {727#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:33,503 INFO L290 TraceCheckUtils]: 17: Hoare triple {727#(not (<= ~r1~0 1))} assume ~r1~0 >= 2; {727#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:33,506 INFO L290 TraceCheckUtils]: 18: Hoare triple {727#(not (<= ~r1~0 1))} assume ~r1~0 < 2; {726#false} is VALID [2022-02-21 04:31:33,506 INFO L290 TraceCheckUtils]: 19: Hoare triple {726#false} assume ~r1~0 >= 2; {726#false} is VALID [2022-02-21 04:31:33,507 INFO L290 TraceCheckUtils]: 20: Hoare triple {726#false} assume ~r1~0 < 2;check_~tmp~1#1 := 1; {726#false} is VALID [2022-02-21 04:31:33,507 INFO L290 TraceCheckUtils]: 21: Hoare triple {726#false} check_#res#1 := check_~tmp~1#1; {726#false} is VALID [2022-02-21 04:31:33,507 INFO L290 TraceCheckUtils]: 22: Hoare triple {726#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {726#false} is VALID [2022-02-21 04:31:33,507 INFO L290 TraceCheckUtils]: 23: Hoare triple {726#false} assume !(0 == assert_~arg#1 % 256); {726#false} is VALID [2022-02-21 04:31:33,508 INFO L290 TraceCheckUtils]: 24: Hoare triple {726#false} assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; {726#false} is VALID [2022-02-21 04:31:33,508 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:31:33,508 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:31:33,508 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1904203338] [2022-02-21 04:31:33,509 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1904203338] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:31:33,509 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:31:33,509 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:31:33,509 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [469280173] [2022-02-21 04:31:33,509 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:31:33,510 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:31:33,510 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:31:33,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:31:33,511 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:31:33,511 INFO L87 Difference]: Start difference. First operand 137 states and 231 transitions. cyclomatic complexity: 95 Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:33,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:33,948 INFO L93 Difference]: Finished difference Result 140 states and 233 transitions. [2022-02-21 04:31:33,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:31:33,949 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:33,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:31:33,970 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 140 states and 233 transitions. [2022-02-21 04:31:33,974 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2022-02-21 04:31:33,978 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 140 states to 137 states and 201 transitions. [2022-02-21 04:31:33,978 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 137 [2022-02-21 04:31:33,978 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 137 [2022-02-21 04:31:33,979 INFO L73 IsDeterministic]: Start isDeterministic. Operand 137 states and 201 transitions. [2022-02-21 04:31:33,979 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:31:33,979 INFO L681 BuchiCegarLoop]: Abstraction has 137 states and 201 transitions. [2022-02-21 04:31:33,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states and 201 transitions. [2022-02-21 04:31:33,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2022-02-21 04:31:33,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:31:33,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states and 201 transitions. Second operand has 137 states, 137 states have (on average 1.467153284671533) internal successors, (201), 136 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:33,985 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states and 201 transitions. Second operand has 137 states, 137 states have (on average 1.467153284671533) internal successors, (201), 136 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:33,985 INFO L87 Difference]: Start difference. First operand 137 states and 201 transitions. Second operand has 137 states, 137 states have (on average 1.467153284671533) internal successors, (201), 136 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:33,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:33,989 INFO L93 Difference]: Finished difference Result 137 states and 201 transitions. [2022-02-21 04:31:33,989 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 201 transitions. [2022-02-21 04:31:33,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:33,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:33,990 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 137 states have (on average 1.467153284671533) internal successors, (201), 136 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 137 states and 201 transitions. [2022-02-21 04:31:33,991 INFO L87 Difference]: Start difference. First operand has 137 states, 137 states have (on average 1.467153284671533) internal successors, (201), 136 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 137 states and 201 transitions. [2022-02-21 04:31:33,994 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:33,995 INFO L93 Difference]: Finished difference Result 137 states and 201 transitions. [2022-02-21 04:31:33,995 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 201 transitions. [2022-02-21 04:31:33,995 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:33,995 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:33,995 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:31:33,995 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:31:33,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 137 states have (on average 1.467153284671533) internal successors, (201), 136 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:33,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 201 transitions. [2022-02-21 04:31:33,999 INFO L704 BuchiCegarLoop]: Abstraction has 137 states and 201 transitions. [2022-02-21 04:31:33,999 INFO L587 BuchiCegarLoop]: Abstraction has 137 states and 201 transitions. [2022-02-21 04:31:33,999 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:31:34,000 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 137 states and 201 transitions. [2022-02-21 04:31:34,000 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 77 [2022-02-21 04:31:34,001 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:31:34,001 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:31:34,002 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:31:34,002 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:31:34,002 INFO L791 eck$LassoCheckResult]: Stem: 1000#ULTIMATE.startENTRY assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; 943#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 927#L258 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 928#L261-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 931#L271 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 932#L274-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 966#L284 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 921#L287-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 934#L297 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 935#L300-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 947#L310 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 911#L313-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 872#L323 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 874#L326-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 908#L336 assume ~id1~0 != ~id2~0; 979#L337 assume ~id1~0 != ~id3~0; 951#L338 assume ~id2~0 != ~id3~0; 952#L339 assume ~id1~0 >= 0; 993#L340 assume ~id2~0 >= 0; 988#L341 assume ~id3~0 >= 0; 939#L342 assume 0 == ~r1~0; 940#L343 assume 0 == ~r2~0; 924#L344 assume 0 == ~r3~0; 925#L345 assume 0 != init_~r122~0#1 % 256; 944#L346 assume 0 != init_~r132~0#1 % 256; 945#L347 assume 0 != init_~r212~0#1 % 256; 997#L348 assume 0 != init_~r232~0#1 % 256; 983#L349 assume 0 != init_~r312~0#1 % 256; 984#L350 assume 0 != init_~r322~0#1 % 256; 973#L351 assume ~max1~0 == ~id1~0; 974#L352 assume ~max2~0 == ~id2~0; 990#L353 assume ~max3~0 == ~id3~0; 960#L354 assume 0 == ~st1~0; 941#L355 assume 0 == ~st2~0; 942#L356 assume 0 == ~st3~0; 958#L357 assume 0 == ~nl1~0; 890#L358 assume 0 == ~nl2~0; 891#L359 assume 0 == ~nl3~0; 899#L360 assume 0 == ~mode1~0 % 256; 900#L361 assume 0 == ~mode2~0 % 256; 978#L362 assume 0 == ~mode3~0 % 256; 1005#L363 assume 0 != ~newmax1~0 % 256; 1006#L364 assume 0 != ~newmax2~0 % 256; 955#L365 assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; 878#L336-1 init_#res#1 := init_~tmp___5~0#1; 879#L457 main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 901#L21 assume !(0 == assume_abort_if_not_~cond#1); 897#L20 assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 898#L568-2 [2022-02-21 04:31:34,002 INFO L793 eck$LassoCheckResult]: Loop: 898#L568-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 930#L82 assume !(0 != ~mode1~0 % 256); 975#L110 assume !(~r1~0 < 2); 881#L110-1 ~mode1~0 := 1; 902#L82-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 995#L133 assume !(0 != ~mode2~0 % 256); 885#L161 assume !(~r2~0 < 2); 876#L161-1 ~mode2~0 := 1; 912#L133-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 913#L184 assume !(0 != ~mode3~0 % 256); 976#L212 assume !(~r3~0 < 2); 950#L212-1 ~mode3~0 := 1; 981#L184-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 982#L465 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 1007#L466 assume ~st1~0 + ~nl1~0 <= 1; 1008#L467 assume ~st2~0 + ~nl2~0 <= 1; 1001#L468 assume ~st3~0 + ~nl3~0 <= 1; 887#L469 assume ~r1~0 >= 2; 888#L473 assume ~r1~0 < 2; 923#L478 assume ~r1~0 >= 2; 965#L483 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 896#L465-1 check_#res#1 := check_~tmp~1#1; 991#L513 main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 992#L598 assume !(0 == assert_~arg#1 % 256); 980#L593 assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; 898#L568-2 [2022-02-21 04:31:34,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:34,003 INFO L85 PathProgramCache]: Analyzing trace with hash 431062094, now seen corresponding path program 1 times [2022-02-21 04:31:34,003 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:34,003 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [581535821] [2022-02-21 04:31:34,003 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:34,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:34,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:31:34,044 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:31:34,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:31:34,111 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:31:34,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:34,111 INFO L85 PathProgramCache]: Analyzing trace with hash -191058054, now seen corresponding path program 2 times [2022-02-21 04:31:34,111 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:34,112 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595124958] [2022-02-21 04:31:34,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:34,112 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:34,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:34,138 INFO L290 TraceCheckUtils]: 0: Hoare triple {1288#true} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {1288#true} is VALID [2022-02-21 04:31:34,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {1288#true} assume !(0 != ~mode1~0 % 256); {1288#true} is VALID [2022-02-21 04:31:34,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {1288#true} assume !(~r1~0 < 2); {1290#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:34,139 INFO L290 TraceCheckUtils]: 3: Hoare triple {1290#(not (<= ~r1~0 1))} ~mode1~0 := 1; {1290#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:34,139 INFO L290 TraceCheckUtils]: 4: Hoare triple {1290#(not (<= ~r1~0 1))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {1290#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:34,140 INFO L290 TraceCheckUtils]: 5: Hoare triple {1290#(not (<= ~r1~0 1))} assume !(0 != ~mode2~0 % 256); {1290#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:34,140 INFO L290 TraceCheckUtils]: 6: Hoare triple {1290#(not (<= ~r1~0 1))} assume !(~r2~0 < 2); {1290#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:34,141 INFO L290 TraceCheckUtils]: 7: Hoare triple {1290#(not (<= ~r1~0 1))} ~mode2~0 := 1; {1290#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:34,141 INFO L290 TraceCheckUtils]: 8: Hoare triple {1290#(not (<= ~r1~0 1))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {1290#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:34,141 INFO L290 TraceCheckUtils]: 9: Hoare triple {1290#(not (<= ~r1~0 1))} assume !(0 != ~mode3~0 % 256); {1290#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:34,142 INFO L290 TraceCheckUtils]: 10: Hoare triple {1290#(not (<= ~r1~0 1))} assume !(~r3~0 < 2); {1290#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:34,142 INFO L290 TraceCheckUtils]: 11: Hoare triple {1290#(not (<= ~r1~0 1))} ~mode3~0 := 1; {1290#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:34,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {1290#(not (<= ~r1~0 1))} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1290#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:34,143 INFO L290 TraceCheckUtils]: 13: Hoare triple {1290#(not (<= ~r1~0 1))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {1290#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:34,143 INFO L290 TraceCheckUtils]: 14: Hoare triple {1290#(not (<= ~r1~0 1))} assume ~st1~0 + ~nl1~0 <= 1; {1290#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:34,143 INFO L290 TraceCheckUtils]: 15: Hoare triple {1290#(not (<= ~r1~0 1))} assume ~st2~0 + ~nl2~0 <= 1; {1290#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:34,144 INFO L290 TraceCheckUtils]: 16: Hoare triple {1290#(not (<= ~r1~0 1))} assume ~st3~0 + ~nl3~0 <= 1; {1290#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:34,144 INFO L290 TraceCheckUtils]: 17: Hoare triple {1290#(not (<= ~r1~0 1))} assume ~r1~0 >= 2; {1290#(not (<= ~r1~0 1))} is VALID [2022-02-21 04:31:34,145 INFO L290 TraceCheckUtils]: 18: Hoare triple {1290#(not (<= ~r1~0 1))} assume ~r1~0 < 2; {1289#false} is VALID [2022-02-21 04:31:34,145 INFO L290 TraceCheckUtils]: 19: Hoare triple {1289#false} assume ~r1~0 >= 2; {1289#false} is VALID [2022-02-21 04:31:34,145 INFO L290 TraceCheckUtils]: 20: Hoare triple {1289#false} assume ~r1~0 < 2;check_~tmp~1#1 := 1; {1289#false} is VALID [2022-02-21 04:31:34,145 INFO L290 TraceCheckUtils]: 21: Hoare triple {1289#false} check_#res#1 := check_~tmp~1#1; {1289#false} is VALID [2022-02-21 04:31:34,145 INFO L290 TraceCheckUtils]: 22: Hoare triple {1289#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {1289#false} is VALID [2022-02-21 04:31:34,145 INFO L290 TraceCheckUtils]: 23: Hoare triple {1289#false} assume !(0 == assert_~arg#1 % 256); {1289#false} is VALID [2022-02-21 04:31:34,146 INFO L290 TraceCheckUtils]: 24: Hoare triple {1289#false} assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; {1289#false} is VALID [2022-02-21 04:31:34,146 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:31:34,146 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:31:34,146 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595124958] [2022-02-21 04:31:34,146 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [595124958] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:31:34,147 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:31:34,147 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:31:34,147 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56185290] [2022-02-21 04:31:34,147 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:31:34,147 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:31:34,147 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:31:34,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:31:34,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:31:34,148 INFO L87 Difference]: Start difference. First operand 137 states and 201 transitions. cyclomatic complexity: 65 Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:34,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:34,371 INFO L93 Difference]: Finished difference Result 195 states and 288 transitions. [2022-02-21 04:31:34,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:31:34,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:34,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:31:34,393 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 195 states and 288 transitions. [2022-02-21 04:31:34,399 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 135 [2022-02-21 04:31:34,406 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 195 states to 195 states and 288 transitions. [2022-02-21 04:31:34,406 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 195 [2022-02-21 04:31:34,406 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 195 [2022-02-21 04:31:34,407 INFO L73 IsDeterministic]: Start isDeterministic. Operand 195 states and 288 transitions. [2022-02-21 04:31:34,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:31:34,410 INFO L681 BuchiCegarLoop]: Abstraction has 195 states and 288 transitions. [2022-02-21 04:31:34,410 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states and 288 transitions. [2022-02-21 04:31:34,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 195. [2022-02-21 04:31:34,428 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:31:34,429 INFO L82 GeneralOperation]: Start isEquivalent. First operand 195 states and 288 transitions. Second operand has 195 states, 195 states have (on average 1.476923076923077) internal successors, (288), 194 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:34,430 INFO L74 IsIncluded]: Start isIncluded. First operand 195 states and 288 transitions. Second operand has 195 states, 195 states have (on average 1.476923076923077) internal successors, (288), 194 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:34,430 INFO L87 Difference]: Start difference. First operand 195 states and 288 transitions. Second operand has 195 states, 195 states have (on average 1.476923076923077) internal successors, (288), 194 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:34,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:34,435 INFO L93 Difference]: Finished difference Result 195 states and 288 transitions. [2022-02-21 04:31:34,435 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 288 transitions. [2022-02-21 04:31:34,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:34,436 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:34,436 INFO L74 IsIncluded]: Start isIncluded. First operand has 195 states, 195 states have (on average 1.476923076923077) internal successors, (288), 194 states have internal predecessors, (288), 0 states have call successors, (0), 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 195 states and 288 transitions. [2022-02-21 04:31:34,437 INFO L87 Difference]: Start difference. First operand has 195 states, 195 states have (on average 1.476923076923077) internal successors, (288), 194 states have internal predecessors, (288), 0 states have call successors, (0), 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 195 states and 288 transitions. [2022-02-21 04:31:34,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:34,442 INFO L93 Difference]: Finished difference Result 195 states and 288 transitions. [2022-02-21 04:31:34,443 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 288 transitions. [2022-02-21 04:31:34,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:31:34,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:31:34,444 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:31:34,444 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:31:34,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 195 states have (on average 1.476923076923077) internal successors, (288), 194 states have internal predecessors, (288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:34,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 288 transitions. [2022-02-21 04:31:34,450 INFO L704 BuchiCegarLoop]: Abstraction has 195 states and 288 transitions. [2022-02-21 04:31:34,450 INFO L587 BuchiCegarLoop]: Abstraction has 195 states and 288 transitions. [2022-02-21 04:31:34,450 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:31:34,451 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 195 states and 288 transitions. [2022-02-21 04:31:34,452 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 135 [2022-02-21 04:31:34,452 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:31:34,452 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:31:34,453 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:31:34,453 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:31:34,454 INFO L791 eck$LassoCheckResult]: Stem: 1618#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; 1560#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; 1541#L258 assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; 1542#L261-1 init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); 1546#L271 assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; 1547#L274-1 init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); 1583#L284 assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; 1532#L287-1 init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); 1549#L297 assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; 1550#L300-1 init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); 1564#L310 assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; 1525#L313-1 init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); 1486#L323 assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; 1488#L326-1 init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); 1522#L336 assume ~id1~0 != ~id2~0; 1596#L337 assume ~id1~0 != ~id3~0; 1568#L338 assume ~id2~0 != ~id3~0; 1569#L339 assume ~id1~0 >= 0; 1611#L340 assume ~id2~0 >= 0; 1605#L341 assume ~id3~0 >= 0; 1554#L342 assume 0 == ~r1~0; 1555#L343 assume 0 == ~r2~0; 1538#L344 assume 0 == ~r3~0; 1539#L345 assume 0 != init_~r122~0#1 % 256; 1561#L346 assume 0 != init_~r132~0#1 % 256; 1562#L347 assume 0 != init_~r212~0#1 % 256; 1615#L348 assume 0 != init_~r232~0#1 % 256; 1600#L349 assume 0 != init_~r312~0#1 % 256; 1601#L350 assume 0 != init_~r322~0#1 % 256; 1590#L351 assume ~max1~0 == ~id1~0; 1591#L352 assume ~max2~0 == ~id2~0; 1607#L353 assume ~max3~0 == ~id3~0; 1577#L354 assume 0 == ~st1~0; 1558#L355 assume 0 == ~st2~0; 1559#L356 assume 0 == ~st3~0; 1575#L357 assume 0 == ~nl1~0; 1503#L358 assume 0 == ~nl2~0; 1504#L359 assume 0 == ~nl3~0; 1512#L360 assume 0 == ~mode1~0 % 256; 1513#L361 assume 0 == ~mode2~0 % 256; 1595#L362 assume 0 == ~mode3~0 % 256; 1624#L363 assume 0 != ~newmax1~0 % 256; 1625#L364 assume 0 != ~newmax2~0 % 256; 1572#L365 assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; 1492#L336-1 init_#res#1 := init_~tmp___5~0#1; 1493#L457 main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; 1514#L21 assume !(0 == assume_abort_if_not_~cond#1); 1510#L20 assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 1511#L568-2 [2022-02-21 04:31:34,454 INFO L793 eck$LassoCheckResult]: Loop: 1511#L568-2 assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; 1629#L82 assume !(0 != ~mode1~0 % 256); 1628#L110 assume ~r1~0 < 2; 1518#L111 assume !(0 != ~ep12~0 % 256); 1519#L111-1 assume !(0 != ~ep13~0 % 256); 1495#L110-1 ~mode1~0 := 1; 1671#L82-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; 1669#L133 assume !(0 != ~mode2~0 % 256); 1670#L161 assume !(~r2~0 < 2); 1659#L161-1 ~mode2~0 := 1; 1656#L133-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; 1653#L184 assume !(0 != ~mode3~0 % 256); 1644#L212 assume !(~r3~0 < 2); 1640#L212-1 ~mode3~0 := 1; 1639#L184-2 assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 1637#L465 assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; 1635#L466 assume ~st1~0 + ~nl1~0 <= 1; 1633#L467 assume ~st2~0 + ~nl2~0 <= 1; 1631#L468 assume ~st3~0 + ~nl3~0 <= 1; 1630#L469 assume !(~r1~0 >= 2); 1556#L472 assume 0 == ~st1~0 + ~st2~0 + ~st3~0; 1557#L473 assume ~r1~0 < 2; 1680#L478 assume !(~r1~0 >= 2); 1581#L482 assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; 1582#L483 assume ~r1~0 < 2;check_~tmp~1#1 := 1; 1638#L465-1 check_#res#1 := check_~tmp~1#1; 1636#L513 main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; 1634#L598 assume !(0 == assert_~arg#1 % 256); 1632#L593 assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; 1511#L568-2 [2022-02-21 04:31:34,455 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:34,455 INFO L85 PathProgramCache]: Analyzing trace with hash 431062094, now seen corresponding path program 2 times [2022-02-21 04:31:34,455 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:34,455 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079007239] [2022-02-21 04:31:34,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:34,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:34,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:31:34,482 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:31:34,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:31:34,518 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:31:34,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:34,519 INFO L85 PathProgramCache]: Analyzing trace with hash 1983288549, now seen corresponding path program 1 times [2022-02-21 04:31:34,519 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:34,519 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314879961] [2022-02-21 04:31:34,519 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:34,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:34,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:31:34,531 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:31:34,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:31:34,541 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:31:34,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:34,542 INFO L85 PathProgramCache]: Analyzing trace with hash 2100705208, now seen corresponding path program 1 times [2022-02-21 04:31:34,542 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:31:34,542 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [17646967] [2022-02-21 04:31:34,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:31:34,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:31:34,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:34,601 INFO L290 TraceCheckUtils]: 0: Hoare triple {2078#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {2078#true} is VALID [2022-02-21 04:31:34,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {2078#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {2078#true} is VALID [2022-02-21 04:31:34,602 INFO L290 TraceCheckUtils]: 2: Hoare triple {2078#true} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {2078#true} is VALID [2022-02-21 04:31:34,602 INFO L290 TraceCheckUtils]: 3: Hoare triple {2078#true} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {2078#true} is VALID [2022-02-21 04:31:34,602 INFO L290 TraceCheckUtils]: 4: Hoare triple {2078#true} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {2078#true} is VALID [2022-02-21 04:31:34,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {2078#true} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {2078#true} is VALID [2022-02-21 04:31:34,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {2078#true} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {2078#true} is VALID [2022-02-21 04:31:34,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {2078#true} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {2078#true} is VALID [2022-02-21 04:31:34,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {2078#true} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {2078#true} is VALID [2022-02-21 04:31:34,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {2078#true} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {2078#true} is VALID [2022-02-21 04:31:34,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {2078#true} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {2078#true} is VALID [2022-02-21 04:31:34,603 INFO L290 TraceCheckUtils]: 11: Hoare triple {2078#true} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {2078#true} is VALID [2022-02-21 04:31:34,603 INFO L290 TraceCheckUtils]: 12: Hoare triple {2078#true} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {2078#true} is VALID [2022-02-21 04:31:34,604 INFO L290 TraceCheckUtils]: 13: Hoare triple {2078#true} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {2078#true} is VALID [2022-02-21 04:31:34,604 INFO L290 TraceCheckUtils]: 14: Hoare triple {2078#true} assume ~id1~0 != ~id2~0; {2078#true} is VALID [2022-02-21 04:31:34,604 INFO L290 TraceCheckUtils]: 15: Hoare triple {2078#true} assume ~id1~0 != ~id3~0; {2078#true} is VALID [2022-02-21 04:31:34,604 INFO L290 TraceCheckUtils]: 16: Hoare triple {2078#true} assume ~id2~0 != ~id3~0; {2078#true} is VALID [2022-02-21 04:31:34,604 INFO L290 TraceCheckUtils]: 17: Hoare triple {2078#true} assume ~id1~0 >= 0; {2078#true} is VALID [2022-02-21 04:31:34,605 INFO L290 TraceCheckUtils]: 18: Hoare triple {2078#true} assume ~id2~0 >= 0; {2078#true} is VALID [2022-02-21 04:31:34,605 INFO L290 TraceCheckUtils]: 19: Hoare triple {2078#true} assume ~id3~0 >= 0; {2078#true} is VALID [2022-02-21 04:31:34,605 INFO L290 TraceCheckUtils]: 20: Hoare triple {2078#true} assume 0 == ~r1~0; {2078#true} is VALID [2022-02-21 04:31:34,606 INFO L290 TraceCheckUtils]: 21: Hoare triple {2078#true} assume 0 == ~r2~0; {2080#(= ~r2~0 0)} is VALID [2022-02-21 04:31:34,606 INFO L290 TraceCheckUtils]: 22: Hoare triple {2080#(= ~r2~0 0)} assume 0 == ~r3~0; {2080#(= ~r2~0 0)} is VALID [2022-02-21 04:31:34,606 INFO L290 TraceCheckUtils]: 23: Hoare triple {2080#(= ~r2~0 0)} assume 0 != init_~r122~0#1 % 256; {2080#(= ~r2~0 0)} is VALID [2022-02-21 04:31:34,607 INFO L290 TraceCheckUtils]: 24: Hoare triple {2080#(= ~r2~0 0)} assume 0 != init_~r132~0#1 % 256; {2080#(= ~r2~0 0)} is VALID [2022-02-21 04:31:34,607 INFO L290 TraceCheckUtils]: 25: Hoare triple {2080#(= ~r2~0 0)} assume 0 != init_~r212~0#1 % 256; {2080#(= ~r2~0 0)} is VALID [2022-02-21 04:31:34,607 INFO L290 TraceCheckUtils]: 26: Hoare triple {2080#(= ~r2~0 0)} assume 0 != init_~r232~0#1 % 256; {2080#(= ~r2~0 0)} is VALID [2022-02-21 04:31:34,608 INFO L290 TraceCheckUtils]: 27: Hoare triple {2080#(= ~r2~0 0)} assume 0 != init_~r312~0#1 % 256; {2080#(= ~r2~0 0)} is VALID [2022-02-21 04:31:34,608 INFO L290 TraceCheckUtils]: 28: Hoare triple {2080#(= ~r2~0 0)} assume 0 != init_~r322~0#1 % 256; {2080#(= ~r2~0 0)} is VALID [2022-02-21 04:31:34,609 INFO L290 TraceCheckUtils]: 29: Hoare triple {2080#(= ~r2~0 0)} assume ~max1~0 == ~id1~0; {2080#(= ~r2~0 0)} is VALID [2022-02-21 04:31:34,609 INFO L290 TraceCheckUtils]: 30: Hoare triple {2080#(= ~r2~0 0)} assume ~max2~0 == ~id2~0; {2080#(= ~r2~0 0)} is VALID [2022-02-21 04:31:34,609 INFO L290 TraceCheckUtils]: 31: Hoare triple {2080#(= ~r2~0 0)} assume ~max3~0 == ~id3~0; {2080#(= ~r2~0 0)} is VALID [2022-02-21 04:31:34,610 INFO L290 TraceCheckUtils]: 32: Hoare triple {2080#(= ~r2~0 0)} assume 0 == ~st1~0; {2080#(= ~r2~0 0)} is VALID [2022-02-21 04:31:34,610 INFO L290 TraceCheckUtils]: 33: Hoare triple {2080#(= ~r2~0 0)} assume 0 == ~st2~0; {2080#(= ~r2~0 0)} is VALID [2022-02-21 04:31:34,611 INFO L290 TraceCheckUtils]: 34: Hoare triple {2080#(= ~r2~0 0)} assume 0 == ~st3~0; {2080#(= ~r2~0 0)} is VALID [2022-02-21 04:31:34,611 INFO L290 TraceCheckUtils]: 35: Hoare triple {2080#(= ~r2~0 0)} assume 0 == ~nl1~0; {2080#(= ~r2~0 0)} is VALID [2022-02-21 04:31:34,611 INFO L290 TraceCheckUtils]: 36: Hoare triple {2080#(= ~r2~0 0)} assume 0 == ~nl2~0; {2080#(= ~r2~0 0)} is VALID [2022-02-21 04:31:34,612 INFO L290 TraceCheckUtils]: 37: Hoare triple {2080#(= ~r2~0 0)} assume 0 == ~nl3~0; {2080#(= ~r2~0 0)} is VALID [2022-02-21 04:31:34,612 INFO L290 TraceCheckUtils]: 38: Hoare triple {2080#(= ~r2~0 0)} assume 0 == ~mode1~0 % 256; {2080#(= ~r2~0 0)} is VALID [2022-02-21 04:31:34,612 INFO L290 TraceCheckUtils]: 39: Hoare triple {2080#(= ~r2~0 0)} assume 0 == ~mode2~0 % 256; {2080#(= ~r2~0 0)} is VALID [2022-02-21 04:31:34,613 INFO L290 TraceCheckUtils]: 40: Hoare triple {2080#(= ~r2~0 0)} assume 0 == ~mode3~0 % 256; {2080#(= ~r2~0 0)} is VALID [2022-02-21 04:31:34,613 INFO L290 TraceCheckUtils]: 41: Hoare triple {2080#(= ~r2~0 0)} assume 0 != ~newmax1~0 % 256; {2080#(= ~r2~0 0)} is VALID [2022-02-21 04:31:34,614 INFO L290 TraceCheckUtils]: 42: Hoare triple {2080#(= ~r2~0 0)} assume 0 != ~newmax2~0 % 256; {2080#(= ~r2~0 0)} is VALID [2022-02-21 04:31:34,614 INFO L290 TraceCheckUtils]: 43: Hoare triple {2080#(= ~r2~0 0)} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {2080#(= ~r2~0 0)} is VALID [2022-02-21 04:31:34,614 INFO L290 TraceCheckUtils]: 44: Hoare triple {2080#(= ~r2~0 0)} init_#res#1 := init_~tmp___5~0#1; {2080#(= ~r2~0 0)} is VALID [2022-02-21 04:31:34,615 INFO L290 TraceCheckUtils]: 45: Hoare triple {2080#(= ~r2~0 0)} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2080#(= ~r2~0 0)} is VALID [2022-02-21 04:31:34,615 INFO L290 TraceCheckUtils]: 46: Hoare triple {2080#(= ~r2~0 0)} assume !(0 == assume_abort_if_not_~cond#1); {2080#(= ~r2~0 0)} is VALID [2022-02-21 04:31:34,616 INFO L290 TraceCheckUtils]: 47: Hoare triple {2080#(= ~r2~0 0)} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {2080#(= ~r2~0 0)} is VALID [2022-02-21 04:31:34,616 INFO L290 TraceCheckUtils]: 48: Hoare triple {2080#(= ~r2~0 0)} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {2080#(= ~r2~0 0)} is VALID [2022-02-21 04:31:34,616 INFO L290 TraceCheckUtils]: 49: Hoare triple {2080#(= ~r2~0 0)} assume !(0 != ~mode1~0 % 256); {2080#(= ~r2~0 0)} is VALID [2022-02-21 04:31:34,617 INFO L290 TraceCheckUtils]: 50: Hoare triple {2080#(= ~r2~0 0)} assume ~r1~0 < 2; {2080#(= ~r2~0 0)} is VALID [2022-02-21 04:31:34,617 INFO L290 TraceCheckUtils]: 51: Hoare triple {2080#(= ~r2~0 0)} assume !(0 != ~ep12~0 % 256); {2080#(= ~r2~0 0)} is VALID [2022-02-21 04:31:34,617 INFO L290 TraceCheckUtils]: 52: Hoare triple {2080#(= ~r2~0 0)} assume !(0 != ~ep13~0 % 256); {2080#(= ~r2~0 0)} is VALID [2022-02-21 04:31:34,618 INFO L290 TraceCheckUtils]: 53: Hoare triple {2080#(= ~r2~0 0)} ~mode1~0 := 1; {2080#(= ~r2~0 0)} is VALID [2022-02-21 04:31:34,618 INFO L290 TraceCheckUtils]: 54: Hoare triple {2080#(= ~r2~0 0)} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {2080#(= ~r2~0 0)} is VALID [2022-02-21 04:31:34,619 INFO L290 TraceCheckUtils]: 55: Hoare triple {2080#(= ~r2~0 0)} assume !(0 != ~mode2~0 % 256); {2080#(= ~r2~0 0)} is VALID [2022-02-21 04:31:34,619 INFO L290 TraceCheckUtils]: 56: Hoare triple {2080#(= ~r2~0 0)} assume !(~r2~0 < 2); {2079#false} is VALID [2022-02-21 04:31:34,619 INFO L290 TraceCheckUtils]: 57: Hoare triple {2079#false} ~mode2~0 := 1; {2079#false} is VALID [2022-02-21 04:31:34,619 INFO L290 TraceCheckUtils]: 58: Hoare triple {2079#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {2079#false} is VALID [2022-02-21 04:31:34,620 INFO L290 TraceCheckUtils]: 59: Hoare triple {2079#false} assume !(0 != ~mode3~0 % 256); {2079#false} is VALID [2022-02-21 04:31:34,620 INFO L290 TraceCheckUtils]: 60: Hoare triple {2079#false} assume !(~r3~0 < 2); {2079#false} is VALID [2022-02-21 04:31:34,620 INFO L290 TraceCheckUtils]: 61: Hoare triple {2079#false} ~mode3~0 := 1; {2079#false} is VALID [2022-02-21 04:31:34,620 INFO L290 TraceCheckUtils]: 62: Hoare triple {2079#false} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {2079#false} is VALID [2022-02-21 04:31:34,620 INFO L290 TraceCheckUtils]: 63: Hoare triple {2079#false} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {2079#false} is VALID [2022-02-21 04:31:34,621 INFO L290 TraceCheckUtils]: 64: Hoare triple {2079#false} assume ~st1~0 + ~nl1~0 <= 1; {2079#false} is VALID [2022-02-21 04:31:34,621 INFO L290 TraceCheckUtils]: 65: Hoare triple {2079#false} assume ~st2~0 + ~nl2~0 <= 1; {2079#false} is VALID [2022-02-21 04:31:34,621 INFO L290 TraceCheckUtils]: 66: Hoare triple {2079#false} assume ~st3~0 + ~nl3~0 <= 1; {2079#false} is VALID [2022-02-21 04:31:34,621 INFO L290 TraceCheckUtils]: 67: Hoare triple {2079#false} assume !(~r1~0 >= 2); {2079#false} is VALID [2022-02-21 04:31:34,621 INFO L290 TraceCheckUtils]: 68: Hoare triple {2079#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {2079#false} is VALID [2022-02-21 04:31:34,622 INFO L290 TraceCheckUtils]: 69: Hoare triple {2079#false} assume ~r1~0 < 2; {2079#false} is VALID [2022-02-21 04:31:34,622 INFO L290 TraceCheckUtils]: 70: Hoare triple {2079#false} assume !(~r1~0 >= 2); {2079#false} is VALID [2022-02-21 04:31:34,622 INFO L290 TraceCheckUtils]: 71: Hoare triple {2079#false} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {2079#false} is VALID [2022-02-21 04:31:34,622 INFO L290 TraceCheckUtils]: 72: Hoare triple {2079#false} assume ~r1~0 < 2;check_~tmp~1#1 := 1; {2079#false} is VALID [2022-02-21 04:31:34,622 INFO L290 TraceCheckUtils]: 73: Hoare triple {2079#false} check_#res#1 := check_~tmp~1#1; {2079#false} is VALID [2022-02-21 04:31:34,622 INFO L290 TraceCheckUtils]: 74: Hoare triple {2079#false} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {2079#false} is VALID [2022-02-21 04:31:34,623 INFO L290 TraceCheckUtils]: 75: Hoare triple {2079#false} assume !(0 == assert_~arg#1 % 256); {2079#false} is VALID [2022-02-21 04:31:34,623 INFO L290 TraceCheckUtils]: 76: Hoare triple {2079#false} assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; {2079#false} is VALID [2022-02-21 04:31:34,623 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:31:34,624 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:31:34,624 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [17646967] [2022-02-21 04:31:34,624 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [17646967] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:31:34,624 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:31:34,624 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:31:34,624 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592607172] [2022-02-21 04:31:34,625 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:31:35,314 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:31:35,315 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:31:35,315 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:31:35,315 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:31:35,315 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:31:35,315 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:35,315 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:31:35,315 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:31:35,315 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2022-02-21 04:31:35,315 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:31:35,316 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:31:35,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:35,337 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:35,339 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:35,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:35,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:35,357 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:35,359 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:35,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:35,365 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:35,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:35,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:35,373 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:35,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:35,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:35,383 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:35,385 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:35,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:35,392 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:35,411 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:35,414 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:35,423 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:35,426 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:35,430 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:35,432 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:35,984 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:31:35,985 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:31:35,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:35,987 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:35,989 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:35,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 04:31:35,993 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:31:35,994 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:31:36,011 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:31:36,012 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {~ep12~0=0} Honda state: {~ep12~0=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:31:36,034 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:31:36,036 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:36,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:36,037 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:36,038 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Waiting until timeout for monitored process [2022-02-21 04:31:36,039 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:31:36,039 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:31:36,047 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 04:31:36,047 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_node2_~newmax~1#1=0} Honda state: {ULTIMATE.start_node2_~newmax~1#1=0} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 04:31:36,063 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:36,063 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:36,064 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:36,065 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:36,066 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Waiting until timeout for monitored process [2022-02-21 04:31:36,071 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:31:36,071 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:31:36,118 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Ended with exit code 0 [2022-02-21 04:31:36,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:36,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:36,147 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:36,167 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:31:36,167 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:31:36,174 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Waiting until timeout for monitored process [2022-02-21 04:31:36,308 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:31:36,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (5)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:36,315 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:31:36,315 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:31:36,315 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:31:36,315 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:31:36,315 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:31:36,315 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:36,315 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:31:36,315 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:31:36,315 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_opt-floodmax.3.ufo.BOUNDED-6.pals.c_Iteration4_Loop [2022-02-21 04:31:36,316 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:31:36,316 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:31:36,318 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:36,324 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:36,327 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:36,331 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:36,333 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:36,342 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:36,345 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:36,348 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:36,350 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:36,353 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:36,358 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:36,361 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:36,363 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:36,367 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:36,369 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:36,372 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:36,376 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:36,379 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:36,384 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:36,387 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:36,391 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:36,393 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:36,395 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:36,418 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:31:36,948 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:31:36,951 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:31:36,952 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:36,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:36,953 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:36,955 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Waiting until timeout for monitored process [2022-02-21 04:31:36,956 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:36,964 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:36,964 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:36,965 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:36,965 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:36,965 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:36,967 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:36,967 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:36,988 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:37,016 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (6)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:37,017 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:37,017 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:37,018 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:37,030 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:37,038 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:37,039 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:37,039 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:37,039 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:37,039 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:37,039 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Waiting until timeout for monitored process [2022-02-21 04:31:37,040 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:37,040 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:37,055 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:37,081 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (7)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:37,081 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:37,081 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:37,083 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:37,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Waiting until timeout for monitored process [2022-02-21 04:31:37,086 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:37,094 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:37,094 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:37,094 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:37,094 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:37,094 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:37,096 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:37,096 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:37,111 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:37,137 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:37,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:37,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:37,139 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:37,144 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:37,152 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:37,152 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:37,152 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:37,152 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:37,152 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:37,153 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:37,153 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:37,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Waiting until timeout for monitored process [2022-02-21 04:31:37,167 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:37,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (9)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:37,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:37,194 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:37,195 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:37,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 04:31:37,198 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:37,205 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:37,206 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:37,206 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:37,206 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:37,206 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:37,207 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:37,207 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:37,221 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:37,247 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:37,248 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:37,248 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:37,249 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:37,261 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:37,261 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 04:31:37,268 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:37,268 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:37,268 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:37,268 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:37,268 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:37,269 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:37,269 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:37,291 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:37,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:37,315 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:37,316 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:37,317 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:37,323 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 04:31:37,324 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:37,331 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:37,331 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:37,331 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:37,331 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:37,331 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:37,333 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:37,333 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:37,343 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:37,358 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Ended with exit code 0 [2022-02-21 04:31:37,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:37,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:37,360 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:37,373 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:37,373 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 04:31:37,379 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:37,379 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:37,379 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:37,380 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:37,380 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:37,380 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:37,380 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:37,381 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:37,398 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:37,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:37,399 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:37,400 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:37,400 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 04:31:37,402 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:37,408 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:37,408 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:37,408 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:37,408 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:37,408 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:37,409 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:37,409 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:37,410 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:37,425 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:37,426 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:37,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:37,427 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:37,429 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 04:31:37,431 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:37,436 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:37,437 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:37,437 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:37,437 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:37,437 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:37,438 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:37,438 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:37,439 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:37,455 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:37,456 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:37,456 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:37,457 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:37,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 04:31:37,460 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:37,465 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:37,466 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:37,466 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:37,466 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:37,466 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:37,466 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:37,466 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:37,471 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:37,486 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:37,487 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:37,487 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:37,488 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:37,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 04:31:37,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:31:37,498 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:37,498 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:37,498 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:37,498 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:37,498 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:37,499 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:37,499 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:37,501 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:37,516 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:31:37,517 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:37,517 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:37,518 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:37,522 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 04:31:37,524 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:37,530 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:37,531 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:37,531 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:37,531 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:37,531 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:37,532 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:37,532 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:37,534 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:37,549 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:31:37,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:37,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:37,550 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:37,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 04:31:37,553 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:37,559 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:37,559 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:37,559 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:37,559 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:37,559 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:37,559 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:37,559 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:37,560 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:37,579 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:37,579 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:37,579 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:37,580 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:37,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Waiting until timeout for monitored process [2022-02-21 04:31:37,583 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:37,589 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:37,589 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:37,589 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:37,589 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:37,589 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:37,590 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:37,590 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:37,615 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:31:37,640 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (20)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:37,640 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:37,641 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:37,642 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:37,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 04:31:37,645 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 04:31:37,652 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:31:37,652 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:31:37,652 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:31:37,652 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:31:37,652 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:31:37,653 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:31:37,653 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:31:37,661 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:31:37,664 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:31:37,664 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:31:37,665 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:31:37,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:31:37,671 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 04:31:37,675 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:31:37,675 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:31:37,675 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:31:37,675 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 04:31:37,675 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 11 Supporting invariants [] [2022-02-21 04:31:37,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:37,723 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:31:37,729 INFO L390 LassoCheck]: Loop: "assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0;" "assume !(0 != ~mode1~0 % 256);" "assume ~r1~0 < 2;" "assume !(0 != ~ep12~0 % 256);" "assume !(0 != ~ep13~0 % 256);" "~mode1~0 := 1;" "assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0;" "assume !(0 != ~mode2~0 % 256);" "assume !(~r2~0 < 2);" "~mode2~0 := 1;" "assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0;" "assume !(0 != ~mode3~0 % 256);" "assume !(~r3~0 < 2);" "~mode3~0 := 1;" "assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1;" "assume ~st1~0 + ~st2~0 + ~st3~0 <= 1;" "assume ~st1~0 + ~nl1~0 <= 1;" "assume ~st2~0 + ~nl2~0 <= 1;" "assume ~st3~0 + ~nl3~0 <= 1;" "assume !(~r1~0 >= 2);" "assume 0 == ~st1~0 + ~st2~0 + ~st3~0;" "assume ~r1~0 < 2;" "assume !(~r1~0 >= 2);" "assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0;" "assume ~r1~0 < 2;check_~tmp~1#1 := 1;" "check_#res#1 := check_~tmp~1#1;" "main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1;" "assume !(0 == assert_~arg#1 % 256);" "assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1;" [2022-02-21 04:31:37,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:37,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:31:37,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:37,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 249 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:31:37,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:37,865 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:31:37,973 INFO L290 TraceCheckUtils]: 0: Hoare triple {2081#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(41, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~p12~0 := 0;~p12_old~0 := 0;~p12_new~0 := 0;~ep12~0 := 0;~p13~0 := 0;~p13_old~0 := 0;~p13_new~0 := 0;~ep13~0 := 0;~p21~0 := 0;~p21_old~0 := 0;~p21_new~0 := 0;~ep21~0 := 0;~p23~0 := 0;~p23_old~0 := 0;~p23_new~0 := 0;~ep23~0 := 0;~p31~0 := 0;~p31_old~0 := 0;~p31_new~0 := 0;~ep31~0 := 0;~p32~0 := 0;~p32_old~0 := 0;~p32_new~0 := 0;~ep32~0 := 0;~id1~0 := 0;~r1~0 := 0;~st1~0 := 0;~nl1~0 := 0;~m1~0 := 0;~max1~0 := 0;~mode1~0 := 0;~newmax1~0 := 0;~id2~0 := 0;~r2~0 := 0;~st2~0 := 0;~nl2~0 := 0;~m2~0 := 0;~max2~0 := 0;~mode2~0 := 0;~newmax2~0 := 0;~id3~0 := 0;~r3~0 := 0;~st3~0 := 0;~nl3~0 := 0;~m3~0 := 0;~max3~0 := 0;~mode3~0 := 0;~newmax3~0 := 0; {2081#unseeded} is VALID [2022-02-21 04:31:37,974 INFO L290 TraceCheckUtils]: 1: Hoare triple {2081#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~nondet22#1, main_#t~nondet23#1, main_#t~nondet24#1, main_#t~nondet25#1, main_#t~nondet26#1, main_#t~nondet27#1, main_#t~nondet28#1, main_#t~nondet29#1, main_#t~nondet30#1, main_#t~nondet31#1, main_#t~nondet32#1, main_#t~nondet33#1, main_#t~nondet34#1, main_#t~nondet35#1, main_#t~nondet36#1, main_#t~nondet37#1, main_#t~nondet38#1, main_#t~nondet39#1, main_#t~ret40#1, main_#t~ret41#1, main_#t~post42#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~ep12~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~ep13~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~ep21~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~ep23~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~ep31~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~ep32~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~id1~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~r1~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~st1~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~nl1~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~m1~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~max1~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~mode1~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~newmax1~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~id2~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~r2~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~st2~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~nl2~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~m2~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~max2~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;~mode2~0 := main_#t~nondet30#1;havoc main_#t~nondet30#1;~newmax2~0 := main_#t~nondet31#1;havoc main_#t~nondet31#1;~id3~0 := main_#t~nondet32#1;havoc main_#t~nondet32#1;~r3~0 := main_#t~nondet33#1;havoc main_#t~nondet33#1;~st3~0 := main_#t~nondet34#1;havoc main_#t~nondet34#1;~nl3~0 := main_#t~nondet35#1;havoc main_#t~nondet35#1;~m3~0 := main_#t~nondet36#1;havoc main_#t~nondet36#1;~max3~0 := main_#t~nondet37#1;havoc main_#t~nondet37#1;~mode3~0 := main_#t~nondet38#1;havoc main_#t~nondet38#1;~newmax3~0 := main_#t~nondet39#1;havoc main_#t~nondet39#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~r121~0#1, init_~r131~0#1, init_~r211~0#1, init_~r231~0#1, init_~r311~0#1, init_~r321~0#1, init_~r122~0#1, init_~tmp~0#1, init_~r132~0#1, init_~tmp___0~0#1, init_~r212~0#1, init_~tmp___1~0#1, init_~r232~0#1, init_~tmp___2~0#1, init_~r312~0#1, init_~tmp___3~0#1, init_~r322~0#1, init_~tmp___4~0#1, init_~tmp___5~0#1;havoc init_~r121~0#1;havoc init_~r131~0#1;havoc init_~r211~0#1;havoc init_~r231~0#1;havoc init_~r311~0#1;havoc init_~r321~0#1;havoc init_~r122~0#1;havoc init_~tmp~0#1;havoc init_~r132~0#1;havoc init_~tmp___0~0#1;havoc init_~r212~0#1;havoc init_~tmp___1~0#1;havoc init_~r232~0#1;havoc init_~tmp___2~0#1;havoc init_~r312~0#1;havoc init_~tmp___3~0#1;havoc init_~r322~0#1;havoc init_~tmp___4~0#1;havoc init_~tmp___5~0#1;init_~r121~0#1 := ~ep12~0;init_~r131~0#1 := ~ep13~0;init_~r211~0#1 := ~ep21~0;init_~r231~0#1 := ~ep23~0;init_~r311~0#1 := ~ep31~0;init_~r321~0#1 := ~ep32~0; {2081#unseeded} is VALID [2022-02-21 04:31:37,975 INFO L290 TraceCheckUtils]: 2: Hoare triple {2081#unseeded} assume 0 != init_~r121~0#1 % 256;init_~tmp~0#1 := 1; {2081#unseeded} is VALID [2022-02-21 04:31:37,975 INFO L290 TraceCheckUtils]: 3: Hoare triple {2081#unseeded} init_~r122~0#1 := (if 0 == init_~tmp~0#1 then 0 else 1); {2081#unseeded} is VALID [2022-02-21 04:31:37,975 INFO L290 TraceCheckUtils]: 4: Hoare triple {2081#unseeded} assume 0 != init_~r131~0#1 % 256;init_~tmp___0~0#1 := 1; {2081#unseeded} is VALID [2022-02-21 04:31:37,976 INFO L290 TraceCheckUtils]: 5: Hoare triple {2081#unseeded} init_~r132~0#1 := (if 0 == init_~tmp___0~0#1 then 0 else 1); {2081#unseeded} is VALID [2022-02-21 04:31:37,977 INFO L290 TraceCheckUtils]: 6: Hoare triple {2081#unseeded} assume 0 != init_~r211~0#1 % 256;init_~tmp___1~0#1 := 1; {2081#unseeded} is VALID [2022-02-21 04:31:37,977 INFO L290 TraceCheckUtils]: 7: Hoare triple {2081#unseeded} init_~r212~0#1 := (if 0 == init_~tmp___1~0#1 then 0 else 1); {2081#unseeded} is VALID [2022-02-21 04:31:37,978 INFO L290 TraceCheckUtils]: 8: Hoare triple {2081#unseeded} assume 0 != init_~r231~0#1 % 256;init_~tmp___2~0#1 := 1; {2081#unseeded} is VALID [2022-02-21 04:31:37,978 INFO L290 TraceCheckUtils]: 9: Hoare triple {2081#unseeded} init_~r232~0#1 := (if 0 == init_~tmp___2~0#1 then 0 else 1); {2081#unseeded} is VALID [2022-02-21 04:31:37,979 INFO L290 TraceCheckUtils]: 10: Hoare triple {2081#unseeded} assume 0 != init_~r311~0#1 % 256;init_~tmp___3~0#1 := 1; {2081#unseeded} is VALID [2022-02-21 04:31:37,979 INFO L290 TraceCheckUtils]: 11: Hoare triple {2081#unseeded} init_~r312~0#1 := (if 0 == init_~tmp___3~0#1 then 0 else 1); {2081#unseeded} is VALID [2022-02-21 04:31:37,979 INFO L290 TraceCheckUtils]: 12: Hoare triple {2081#unseeded} assume 0 != init_~r321~0#1 % 256;init_~tmp___4~0#1 := 1; {2081#unseeded} is VALID [2022-02-21 04:31:37,980 INFO L290 TraceCheckUtils]: 13: Hoare triple {2081#unseeded} init_~r322~0#1 := (if 0 == init_~tmp___4~0#1 then 0 else 1); {2081#unseeded} is VALID [2022-02-21 04:31:37,980 INFO L290 TraceCheckUtils]: 14: Hoare triple {2081#unseeded} assume ~id1~0 != ~id2~0; {2081#unseeded} is VALID [2022-02-21 04:31:37,981 INFO L290 TraceCheckUtils]: 15: Hoare triple {2081#unseeded} assume ~id1~0 != ~id3~0; {2081#unseeded} is VALID [2022-02-21 04:31:37,981 INFO L290 TraceCheckUtils]: 16: Hoare triple {2081#unseeded} assume ~id2~0 != ~id3~0; {2081#unseeded} is VALID [2022-02-21 04:31:37,981 INFO L290 TraceCheckUtils]: 17: Hoare triple {2081#unseeded} assume ~id1~0 >= 0; {2081#unseeded} is VALID [2022-02-21 04:31:37,982 INFO L290 TraceCheckUtils]: 18: Hoare triple {2081#unseeded} assume ~id2~0 >= 0; {2081#unseeded} is VALID [2022-02-21 04:31:37,982 INFO L290 TraceCheckUtils]: 19: Hoare triple {2081#unseeded} assume ~id3~0 >= 0; {2081#unseeded} is VALID [2022-02-21 04:31:37,985 INFO L290 TraceCheckUtils]: 20: Hoare triple {2081#unseeded} assume 0 == ~r1~0; {2081#unseeded} is VALID [2022-02-21 04:31:37,986 INFO L290 TraceCheckUtils]: 21: Hoare triple {2081#unseeded} assume 0 == ~r2~0; {2081#unseeded} is VALID [2022-02-21 04:31:37,987 INFO L290 TraceCheckUtils]: 22: Hoare triple {2081#unseeded} assume 0 == ~r3~0; {2081#unseeded} is VALID [2022-02-21 04:31:37,988 INFO L290 TraceCheckUtils]: 23: Hoare triple {2081#unseeded} assume 0 != init_~r122~0#1 % 256; {2081#unseeded} is VALID [2022-02-21 04:31:37,988 INFO L290 TraceCheckUtils]: 24: Hoare triple {2081#unseeded} assume 0 != init_~r132~0#1 % 256; {2081#unseeded} is VALID [2022-02-21 04:31:37,989 INFO L290 TraceCheckUtils]: 25: Hoare triple {2081#unseeded} assume 0 != init_~r212~0#1 % 256; {2081#unseeded} is VALID [2022-02-21 04:31:37,989 INFO L290 TraceCheckUtils]: 26: Hoare triple {2081#unseeded} assume 0 != init_~r232~0#1 % 256; {2081#unseeded} is VALID [2022-02-21 04:31:37,990 INFO L290 TraceCheckUtils]: 27: Hoare triple {2081#unseeded} assume 0 != init_~r312~0#1 % 256; {2081#unseeded} is VALID [2022-02-21 04:31:37,990 INFO L290 TraceCheckUtils]: 28: Hoare triple {2081#unseeded} assume 0 != init_~r322~0#1 % 256; {2081#unseeded} is VALID [2022-02-21 04:31:37,990 INFO L290 TraceCheckUtils]: 29: Hoare triple {2081#unseeded} assume ~max1~0 == ~id1~0; {2081#unseeded} is VALID [2022-02-21 04:31:37,991 INFO L290 TraceCheckUtils]: 30: Hoare triple {2081#unseeded} assume ~max2~0 == ~id2~0; {2081#unseeded} is VALID [2022-02-21 04:31:37,991 INFO L290 TraceCheckUtils]: 31: Hoare triple {2081#unseeded} assume ~max3~0 == ~id3~0; {2081#unseeded} is VALID [2022-02-21 04:31:37,991 INFO L290 TraceCheckUtils]: 32: Hoare triple {2081#unseeded} assume 0 == ~st1~0; {2081#unseeded} is VALID [2022-02-21 04:31:37,992 INFO L290 TraceCheckUtils]: 33: Hoare triple {2081#unseeded} assume 0 == ~st2~0; {2081#unseeded} is VALID [2022-02-21 04:31:37,992 INFO L290 TraceCheckUtils]: 34: Hoare triple {2081#unseeded} assume 0 == ~st3~0; {2081#unseeded} is VALID [2022-02-21 04:31:37,992 INFO L290 TraceCheckUtils]: 35: Hoare triple {2081#unseeded} assume 0 == ~nl1~0; {2081#unseeded} is VALID [2022-02-21 04:31:37,993 INFO L290 TraceCheckUtils]: 36: Hoare triple {2081#unseeded} assume 0 == ~nl2~0; {2081#unseeded} is VALID [2022-02-21 04:31:37,993 INFO L290 TraceCheckUtils]: 37: Hoare triple {2081#unseeded} assume 0 == ~nl3~0; {2081#unseeded} is VALID [2022-02-21 04:31:37,993 INFO L290 TraceCheckUtils]: 38: Hoare triple {2081#unseeded} assume 0 == ~mode1~0 % 256; {2081#unseeded} is VALID [2022-02-21 04:31:37,994 INFO L290 TraceCheckUtils]: 39: Hoare triple {2081#unseeded} assume 0 == ~mode2~0 % 256; {2081#unseeded} is VALID [2022-02-21 04:31:37,994 INFO L290 TraceCheckUtils]: 40: Hoare triple {2081#unseeded} assume 0 == ~mode3~0 % 256; {2081#unseeded} is VALID [2022-02-21 04:31:37,995 INFO L290 TraceCheckUtils]: 41: Hoare triple {2081#unseeded} assume 0 != ~newmax1~0 % 256; {2081#unseeded} is VALID [2022-02-21 04:31:37,995 INFO L290 TraceCheckUtils]: 42: Hoare triple {2081#unseeded} assume 0 != ~newmax2~0 % 256; {2081#unseeded} is VALID [2022-02-21 04:31:37,995 INFO L290 TraceCheckUtils]: 43: Hoare triple {2081#unseeded} assume 0 != ~newmax3~0 % 256;init_~tmp___5~0#1 := 1; {2081#unseeded} is VALID [2022-02-21 04:31:37,996 INFO L290 TraceCheckUtils]: 44: Hoare triple {2081#unseeded} init_#res#1 := init_~tmp___5~0#1; {2081#unseeded} is VALID [2022-02-21 04:31:37,996 INFO L290 TraceCheckUtils]: 45: Hoare triple {2081#unseeded} main_#t~ret40#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret40#1;havoc main_#t~ret40#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := main_~i2~0#1;havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2081#unseeded} is VALID [2022-02-21 04:31:37,996 INFO L290 TraceCheckUtils]: 46: Hoare triple {2081#unseeded} assume !(0 == assume_abort_if_not_~cond#1); {2081#unseeded} is VALID [2022-02-21 04:31:37,997 INFO L290 TraceCheckUtils]: 47: Hoare triple {2081#unseeded} assume { :end_inline_assume_abort_if_not } true;~p12_old~0 := ~nomsg~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~nomsg~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~nomsg~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~nomsg~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~nomsg~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~nomsg~0;~p32_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {2081#unseeded} is VALID [2022-02-21 04:31:38,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:38,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:31:38,042 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:31:38,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:31:38,335 INFO L290 TraceCheckUtils]: 0: Hoare triple {2084#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11))} assume !!(main_~i2~0#1 < 6);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_#t~ite5#1, node1_~newmax~0#1;havoc node1_~newmax~0#1;node1_~newmax~0#1 := 0; {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:38,336 INFO L290 TraceCheckUtils]: 1: Hoare triple {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(0 != ~mode1~0 % 256); {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:38,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume ~r1~0 < 2; {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:38,337 INFO L290 TraceCheckUtils]: 3: Hoare triple {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(0 != ~ep12~0 % 256); {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:38,337 INFO L290 TraceCheckUtils]: 4: Hoare triple {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(0 != ~ep13~0 % 256); {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:38,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} ~mode1~0 := 1; {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:38,338 INFO L290 TraceCheckUtils]: 6: Hoare triple {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite6#1, node2_#t~ite7#1, node2_~newmax~1#1;havoc node2_~newmax~1#1;node2_~newmax~1#1 := 0; {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:38,339 INFO L290 TraceCheckUtils]: 7: Hoare triple {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(0 != ~mode2~0 % 256); {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:38,344 INFO L290 TraceCheckUtils]: 8: Hoare triple {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(~r2~0 < 2); {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:38,345 INFO L290 TraceCheckUtils]: 9: Hoare triple {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} ~mode2~0 := 1; {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:38,346 INFO L290 TraceCheckUtils]: 10: Hoare triple {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite8#1, node3_#t~ite9#1, node3_~newmax~2#1;havoc node3_~newmax~2#1;node3_~newmax~2#1 := 0; {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:38,347 INFO L290 TraceCheckUtils]: 11: Hoare triple {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(0 != ~mode3~0 % 256); {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:38,349 INFO L290 TraceCheckUtils]: 12: Hoare triple {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(~r3~0 < 2); {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:38,350 INFO L290 TraceCheckUtils]: 13: Hoare triple {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} ~mode3~0 := 1; {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:38,350 INFO L290 TraceCheckUtils]: 14: Hoare triple {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume { :end_inline_node3 } true;~p12_old~0 := ~p12_new~0;~p12_new~0 := ~nomsg~0;~p13_old~0 := ~p13_new~0;~p13_new~0 := ~nomsg~0;~p21_old~0 := ~p21_new~0;~p21_new~0 := ~nomsg~0;~p23_old~0 := ~p23_new~0;~p23_new~0 := ~nomsg~0;~p31_old~0 := ~p31_new~0;~p31_new~0 := ~nomsg~0;~p32_old~0 := ~p32_new~0;~p32_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:38,351 INFO L290 TraceCheckUtils]: 15: Hoare triple {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume ~st1~0 + ~st2~0 + ~st3~0 <= 1; {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:38,351 INFO L290 TraceCheckUtils]: 16: Hoare triple {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume ~st1~0 + ~nl1~0 <= 1; {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:38,352 INFO L290 TraceCheckUtils]: 17: Hoare triple {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume ~st2~0 + ~nl2~0 <= 1; {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:38,352 INFO L290 TraceCheckUtils]: 18: Hoare triple {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume ~st3~0 + ~nl3~0 <= 1; {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:38,353 INFO L290 TraceCheckUtils]: 19: Hoare triple {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(~r1~0 >= 2); {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:38,353 INFO L290 TraceCheckUtils]: 20: Hoare triple {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0; {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:38,354 INFO L290 TraceCheckUtils]: 21: Hoare triple {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume ~r1~0 < 2; {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:38,354 INFO L290 TraceCheckUtils]: 22: Hoare triple {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(~r1~0 >= 2); {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:38,355 INFO L290 TraceCheckUtils]: 23: Hoare triple {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume 0 == ~nl1~0 + ~nl2~0 + ~nl3~0; {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:38,355 INFO L290 TraceCheckUtils]: 24: Hoare triple {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume ~r1~0 < 2;check_~tmp~1#1 := 1; {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:38,356 INFO L290 TraceCheckUtils]: 25: Hoare triple {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} check_#res#1 := check_~tmp~1#1; {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:38,356 INFO L290 TraceCheckUtils]: 26: Hoare triple {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} main_#t~ret41#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret41#1;havoc main_#t~ret41#1;assume { :begin_inline_assert } true;assert_#in~arg#1 := (if 0 == main_~c1~0#1 then 0 else 1);havoc assert_~arg#1;assert_~arg#1 := assert_#in~arg#1; {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:38,357 INFO L290 TraceCheckUtils]: 27: Hoare triple {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume !(0 == assert_~arg#1 % 256); {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} is VALID [2022-02-21 04:31:38,358 INFO L290 TraceCheckUtils]: 28: Hoare triple {2240#(and (>= oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11)) (< |ULTIMATE.start_main_~i2~0#1| 6))} assume { :end_inline_assert } true;main_#t~post42#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post42#1;havoc main_#t~post42#1; {2094#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_main_~i2~0#1|) 11))))} is VALID [2022-02-21 04:31:38,358 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 04:31:38,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:38,383 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:31:38,385 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 29 letters. [2022-02-21 04:31:38,386 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,389 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 2 loop predicates [2022-02-21 04:31:38,389 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 195 states and 288 transitions. cyclomatic complexity: 94 Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:38,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 04:31:38,733 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 195 states and 288 transitions. cyclomatic complexity: 94. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 329 states and 498 transitions. Complement of second has 4 states. [2022-02-21 04:31:38,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 3 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 04:31:38,733 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:31:38,733 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 195 states and 288 transitions. cyclomatic complexity: 94 [2022-02-21 04:31:38,733 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:31:38,733 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:31:38,734 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:38,739 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:31:38,740 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:31:38,740 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:31:38,740 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 329 states and 498 transitions. [2022-02-21 04:31:38,742 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:31:38,742 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:31:38,745 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 195 states and 288 transitions. cyclomatic complexity: 94 [2022-02-21 04:31:38,817 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 135 examples of accepted words. [2022-02-21 04:31:38,817 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:38,820 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:31:38,820 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:31:38,820 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 329 states and 498 transitions. cyclomatic complexity: 170 [2022-02-21 04:31:38,820 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 329 states and 498 transitions. cyclomatic complexity: 170 [2022-02-21 04:31:38,821 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:31:38,821 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:31:38,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 48 letters. Loop has 29 letters. [2022-02-21 04:31:38,821 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,821 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 29 letters. [2022-02-21 04:31:38,822 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,822 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 48 letters. Loop has 29 letters. [2022-02-21 04:31:38,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:31:38,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:31:38,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,824 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:31:38,824 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 329 letters. Loop has 329 letters. [2022-02-21 04:31:38,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 329 letters. Loop has 329 letters. [2022-02-21 04:31:38,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 329 letters. Loop has 329 letters. [2022-02-21 04:31:38,825 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,825 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 195 letters. Loop has 195 letters. [2022-02-21 04:31:38,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 195 letters. Loop has 195 letters. [2022-02-21 04:31:38,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 195 letters. Loop has 195 letters. [2022-02-21 04:31:38,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:31:38,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:31:38,826 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,826 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:31:38,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 67 letters. Loop has 27 letters. [2022-02-21 04:31:38,827 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,827 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 27 letters. [2022-02-21 04:31:38,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,828 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 67 letters. Loop has 27 letters. [2022-02-21 04:31:38,828 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 68 letters. Loop has 27 letters. [2022-02-21 04:31:38,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 27 letters. [2022-02-21 04:31:38,829 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,829 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 68 letters. Loop has 27 letters. [2022-02-21 04:31:38,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 30 letters. [2022-02-21 04:31:38,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 30 letters. [2022-02-21 04:31:38,830 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,830 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 57 letters. Loop has 30 letters. [2022-02-21 04:31:38,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 75 letters. Loop has 27 letters. [2022-02-21 04:31:38,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,831 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 75 letters. Loop has 27 letters. [2022-02-21 04:31:38,831 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 75 letters. Loop has 27 letters. [2022-02-21 04:31:38,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 76 letters. Loop has 27 letters. [2022-02-21 04:31:38,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 76 letters. Loop has 27 letters. [2022-02-21 04:31:38,832 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,832 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 76 letters. Loop has 27 letters. [2022-02-21 04:31:38,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 29 letters. [2022-02-21 04:31:38,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 29 letters. [2022-02-21 04:31:38,833 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,833 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 56 letters. Loop has 29 letters. [2022-02-21 04:31:38,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 30 letters. [2022-02-21 04:31:38,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 30 letters. [2022-02-21 04:31:38,834 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,834 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 56 letters. Loop has 30 letters. [2022-02-21 04:31:38,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 68 letters. Loop has 29 letters. [2022-02-21 04:31:38,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 68 letters. Loop has 29 letters. [2022-02-21 04:31:38,835 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,835 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 68 letters. Loop has 29 letters. [2022-02-21 04:31:38,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 69 letters. Loop has 29 letters. [2022-02-21 04:31:38,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 29 letters. [2022-02-21 04:31:38,836 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,836 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 69 letters. Loop has 29 letters. [2022-02-21 04:31:38,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 31 letters. [2022-02-21 04:31:38,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,837 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 31 letters. [2022-02-21 04:31:38,837 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 54 letters. Loop has 31 letters. [2022-02-21 04:31:38,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:31:38,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,838 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:31:38,838 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:31:38,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:31:38,839 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,839 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:31:38,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:31:38,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 27 letters. [2022-02-21 04:31:38,840 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,840 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 27 letters. [2022-02-21 04:31:38,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 59 letters. Loop has 27 letters. [2022-02-21 04:31:38,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 32 letters. [2022-02-21 04:31:38,841 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,841 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 32 letters. [2022-02-21 04:31:38,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 53 letters. Loop has 32 letters. [2022-02-21 04:31:38,842 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,842 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 32 letters. [2022-02-21 04:31:38,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 32 letters. [2022-02-21 04:31:38,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 57 letters. Loop has 32 letters. [2022-02-21 04:31:38,843 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,843 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 51 letters. Loop has 31 letters. [2022-02-21 04:31:38,844 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,844 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 31 letters. [2022-02-21 04:31:38,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 51 letters. Loop has 31 letters. [2022-02-21 04:31:38,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 51 letters. Loop has 30 letters. [2022-02-21 04:31:38,845 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,845 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 30 letters. [2022-02-21 04:31:38,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 51 letters. Loop has 30 letters. [2022-02-21 04:31:38,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 32 letters. [2022-02-21 04:31:38,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,846 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 32 letters. [2022-02-21 04:31:38,846 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 55 letters. Loop has 32 letters. [2022-02-21 04:31:38,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:31:38,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,847 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:31:38,847 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:31:38,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:31:38,848 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,848 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:31:38,849 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,849 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:31:38,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 71 letters. Loop has 29 letters. [2022-02-21 04:31:38,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 29 letters. [2022-02-21 04:31:38,850 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,850 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 71 letters. Loop has 29 letters. [2022-02-21 04:31:38,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 72 letters. Loop has 29 letters. [2022-02-21 04:31:38,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 29 letters. [2022-02-21 04:31:38,851 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,851 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 72 letters. Loop has 29 letters. [2022-02-21 04:31:38,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,852 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 31 letters. [2022-02-21 04:31:38,852 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 31 letters. [2022-02-21 04:31:38,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 55 letters. Loop has 31 letters. [2022-02-21 04:31:38,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 30 letters. [2022-02-21 04:31:38,853 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,853 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 30 letters. [2022-02-21 04:31:38,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 30 letters. [2022-02-21 04:31:38,854 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,854 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 31 letters. [2022-02-21 04:31:38,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,855 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 31 letters. [2022-02-21 04:31:38,855 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 59 letters. Loop has 31 letters. [2022-02-21 04:31:38,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,856 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:31:38,856 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,857 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:31:38,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:31:38,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,858 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 77 letters. Loop has 27 letters. [2022-02-21 04:31:38,858 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 77 letters. Loop has 27 letters. [2022-02-21 04:31:38,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 77 letters. Loop has 27 letters. [2022-02-21 04:31:38,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,859 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 27 letters. [2022-02-21 04:31:38,859 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 27 letters. [2022-02-21 04:31:38,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 27 letters. [2022-02-21 04:31:38,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,860 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 29 letters. [2022-02-21 04:31:38,860 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 29 letters. [2022-02-21 04:31:38,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 59 letters. Loop has 29 letters. [2022-02-21 04:31:38,861 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,861 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 74 letters. Loop has 27 letters. [2022-02-21 04:31:38,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 27 letters. [2022-02-21 04:31:38,862 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,862 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 74 letters. Loop has 27 letters. [2022-02-21 04:31:38,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 27 letters. [2022-02-21 04:31:38,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 27 letters. [2022-02-21 04:31:38,863 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,863 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 27 letters. [2022-02-21 04:31:38,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 27 letters. [2022-02-21 04:31:38,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 27 letters. [2022-02-21 04:31:38,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,864 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 61 letters. Loop has 27 letters. [2022-02-21 04:31:38,864 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,865 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 52 letters. Loop has 31 letters. [2022-02-21 04:31:38,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 31 letters. [2022-02-21 04:31:38,870 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,870 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 52 letters. Loop has 31 letters. [2022-02-21 04:31:38,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 52 letters. Loop has 30 letters. [2022-02-21 04:31:38,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 30 letters. [2022-02-21 04:31:38,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 52 letters. Loop has 30 letters. [2022-02-21 04:31:38,871 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 50 letters. Loop has 30 letters. [2022-02-21 04:31:38,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 30 letters. [2022-02-21 04:31:38,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 50 letters. Loop has 30 letters. [2022-02-21 04:31:38,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 72 letters. Loop has 27 letters. [2022-02-21 04:31:38,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 72 letters. Loop has 27 letters. [2022-02-21 04:31:38,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 72 letters. Loop has 27 letters. [2022-02-21 04:31:38,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 73 letters. Loop has 27 letters. [2022-02-21 04:31:38,874 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 27 letters. [2022-02-21 04:31:38,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 73 letters. Loop has 27 letters. [2022-02-21 04:31:38,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 69 letters. Loop has 27 letters. [2022-02-21 04:31:38,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 69 letters. Loop has 27 letters. [2022-02-21 04:31:38,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 69 letters. Loop has 27 letters. [2022-02-21 04:31:38,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 30 letters. [2022-02-21 04:31:38,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 30 letters. [2022-02-21 04:31:38,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 54 letters. Loop has 30 letters. [2022-02-21 04:31:38,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 27 letters. [2022-02-21 04:31:38,877 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 27 letters. [2022-02-21 04:31:38,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 53 letters. Loop has 27 letters. [2022-02-21 04:31:38,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 30 letters. [2022-02-21 04:31:38,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 30 letters. [2022-02-21 04:31:38,878 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,878 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 53 letters. Loop has 30 letters. [2022-02-21 04:31:38,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 29 letters. [2022-02-21 04:31:38,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 29 letters. [2022-02-21 04:31:38,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 29 letters. [2022-02-21 04:31:38,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 30 letters. [2022-02-21 04:31:38,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 30 letters. [2022-02-21 04:31:38,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 61 letters. Loop has 30 letters. [2022-02-21 04:31:38,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 30 letters. [2022-02-21 04:31:38,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 30 letters. [2022-02-21 04:31:38,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 54 letters. Loop has 30 letters. [2022-02-21 04:31:38,881 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,881 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 64 letters. Loop has 27 letters. [2022-02-21 04:31:38,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 27 letters. [2022-02-21 04:31:38,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 64 letters. Loop has 27 letters. [2022-02-21 04:31:38,882 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,882 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:31:38,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:31:38,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:31:38,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 30 letters. [2022-02-21 04:31:38,883 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 30 letters. [2022-02-21 04:31:38,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 30 letters. [2022-02-21 04:31:38,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 32 letters. [2022-02-21 04:31:38,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 32 letters. [2022-02-21 04:31:38,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 61 letters. Loop has 32 letters. [2022-02-21 04:31:38,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 27 letters. [2022-02-21 04:31:38,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 27 letters. [2022-02-21 04:31:38,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 62 letters. Loop has 27 letters. [2022-02-21 04:31:38,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 63 letters. Loop has 27 letters. [2022-02-21 04:31:38,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 27 letters. [2022-02-21 04:31:38,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 63 letters. Loop has 27 letters. [2022-02-21 04:31:38,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 50 letters. Loop has 29 letters. [2022-02-21 04:31:38,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 50 letters. Loop has 29 letters. [2022-02-21 04:31:38,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 50 letters. Loop has 29 letters. [2022-02-21 04:31:38,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 49 letters. Loop has 29 letters. [2022-02-21 04:31:38,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 49 letters. Loop has 29 letters. [2022-02-21 04:31:38,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 49 letters. Loop has 29 letters. [2022-02-21 04:31:38,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 67 letters. Loop has 29 letters. [2022-02-21 04:31:38,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 67 letters. Loop has 29 letters. [2022-02-21 04:31:38,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 67 letters. Loop has 29 letters. [2022-02-21 04:31:38,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 66 letters. Loop has 29 letters. [2022-02-21 04:31:38,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 29 letters. [2022-02-21 04:31:38,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 66 letters. Loop has 29 letters. [2022-02-21 04:31:38,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 76 letters. Loop has 29 letters. [2022-02-21 04:31:38,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 76 letters. Loop has 29 letters. [2022-02-21 04:31:38,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 76 letters. Loop has 29 letters. [2022-02-21 04:31:38,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 65 letters. Loop has 29 letters. [2022-02-21 04:31:38,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 29 letters. [2022-02-21 04:31:38,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 65 letters. Loop has 29 letters. [2022-02-21 04:31:38,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 75 letters. Loop has 29 letters. [2022-02-21 04:31:38,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 75 letters. Loop has 29 letters. [2022-02-21 04:31:38,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 75 letters. Loop has 29 letters. [2022-02-21 04:31:38,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 64 letters. Loop has 29 letters. [2022-02-21 04:31:38,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 29 letters. [2022-02-21 04:31:38,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 64 letters. Loop has 29 letters. [2022-02-21 04:31:38,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 74 letters. Loop has 29 letters. [2022-02-21 04:31:38,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 74 letters. Loop has 29 letters. [2022-02-21 04:31:38,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 74 letters. Loop has 29 letters. [2022-02-21 04:31:38,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 63 letters. Loop has 29 letters. [2022-02-21 04:31:38,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 29 letters. [2022-02-21 04:31:38,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 63 letters. Loop has 29 letters. [2022-02-21 04:31:38,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 73 letters. Loop has 29 letters. [2022-02-21 04:31:38,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 73 letters. Loop has 29 letters. [2022-02-21 04:31:38,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 73 letters. Loop has 29 letters. [2022-02-21 04:31:38,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 29 letters. [2022-02-21 04:31:38,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 29 letters. [2022-02-21 04:31:38,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 62 letters. Loop has 29 letters. [2022-02-21 04:31:38,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 29 letters. [2022-02-21 04:31:38,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 29 letters. [2022-02-21 04:31:38,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 61 letters. Loop has 29 letters. [2022-02-21 04:31:38,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 64 letters. Loop has 32 letters. [2022-02-21 04:31:38,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 32 letters. [2022-02-21 04:31:38,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 64 letters. Loop has 32 letters. [2022-02-21 04:31:38,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:31:38,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:31:38,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:31:38,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 64 letters. Loop has 33 letters. [2022-02-21 04:31:38,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 33 letters. [2022-02-21 04:31:38,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 64 letters. Loop has 33 letters. [2022-02-21 04:31:38,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 29 letters. [2022-02-21 04:31:38,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 29 letters. [2022-02-21 04:31:38,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 29 letters. [2022-02-21 04:31:38,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 31 letters. [2022-02-21 04:31:38,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 31 letters. [2022-02-21 04:31:38,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 61 letters. Loop has 31 letters. [2022-02-21 04:31:38,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 65 letters. Loop has 34 letters. [2022-02-21 04:31:38,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 34 letters. [2022-02-21 04:31:38,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 65 letters. Loop has 34 letters. [2022-02-21 04:31:38,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:31:38,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:31:38,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 63 letters. Loop has 32 letters. [2022-02-21 04:31:38,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 64 letters. Loop has 34 letters. [2022-02-21 04:31:38,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 34 letters. [2022-02-21 04:31:38,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 64 letters. Loop has 34 letters. [2022-02-21 04:31:38,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 31 letters. [2022-02-21 04:31:38,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 31 letters. [2022-02-21 04:31:38,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 62 letters. Loop has 31 letters. [2022-02-21 04:31:38,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 64 letters. Loop has 34 letters. [2022-02-21 04:31:38,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 64 letters. Loop has 34 letters. [2022-02-21 04:31:38,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 64 letters. Loop has 34 letters. [2022-02-21 04:31:38,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:31:38,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:31:38,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:31:38,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,916 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 63 letters. Loop has 34 letters. [2022-02-21 04:31:38,916 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 63 letters. Loop has 34 letters. [2022-02-21 04:31:38,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 63 letters. Loop has 34 letters. [2022-02-21 04:31:38,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,917 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 29 letters. [2022-02-21 04:31:38,917 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,918 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 29 letters. [2022-02-21 04:31:38,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 59 letters. Loop has 29 letters. [2022-02-21 04:31:38,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:31:38,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:31:38,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:31:38,920 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,920 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:31:38,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:31:38,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 62 letters. Loop has 32 letters. [2022-02-21 04:31:38,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 29 letters. [2022-02-21 04:31:38,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 29 letters. [2022-02-21 04:31:38,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 29 letters. [2022-02-21 04:31:38,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 33 letters. [2022-02-21 04:31:38,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 33 letters. [2022-02-21 04:31:38,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 62 letters. Loop has 33 letters. [2022-02-21 04:31:38,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 32 letters. [2022-02-21 04:31:38,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 32 letters. [2022-02-21 04:31:38,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 61 letters. Loop has 32 letters. [2022-02-21 04:31:38,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,925 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 29 letters. [2022-02-21 04:31:38,925 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 29 letters. [2022-02-21 04:31:38,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 57 letters. Loop has 29 letters. [2022-02-21 04:31:38,926 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,926 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:31:38,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:31:38,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,927 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 32 letters. [2022-02-21 04:31:38,927 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 33 letters. [2022-02-21 04:31:38,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 33 letters. [2022-02-21 04:31:38,928 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,928 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 61 letters. Loop has 33 letters. [2022-02-21 04:31:38,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 33 letters. [2022-02-21 04:31:38,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 33 letters. [2022-02-21 04:31:38,929 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,929 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 33 letters. [2022-02-21 04:31:38,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:31:38,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:31:38,930 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,930 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:31:38,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:31:38,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,931 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:31:38,931 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:31:38,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 33 letters. [2022-02-21 04:31:38,932 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,932 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 33 letters. [2022-02-21 04:31:38,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 33 letters. [2022-02-21 04:31:38,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 32 letters. [2022-02-21 04:31:38,933 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,933 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 32 letters. [2022-02-21 04:31:38,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 57 letters. Loop has 32 letters. [2022-02-21 04:31:38,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,934 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 33 letters. [2022-02-21 04:31:38,934 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 33 letters. [2022-02-21 04:31:38,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 57 letters. Loop has 33 letters. [2022-02-21 04:31:38,935 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,935 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 32 letters. [2022-02-21 04:31:38,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 32 letters. [2022-02-21 04:31:38,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,936 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 56 letters. Loop has 32 letters. [2022-02-21 04:31:38,936 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 29 letters. [2022-02-21 04:31:38,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 29 letters. [2022-02-21 04:31:38,937 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,937 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 55 letters. Loop has 29 letters. [2022-02-21 04:31:38,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 29 letters. [2022-02-21 04:31:38,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 29 letters. [2022-02-21 04:31:38,938 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,938 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 56 letters. Loop has 29 letters. [2022-02-21 04:31:38,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 29 letters. [2022-02-21 04:31:38,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 29 letters. [2022-02-21 04:31:38,939 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,939 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 54 letters. Loop has 29 letters. [2022-02-21 04:31:38,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:31:38,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,940 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:31:38,940 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 59 letters. Loop has 32 letters. [2022-02-21 04:31:38,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 34 letters. [2022-02-21 04:31:38,941 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,941 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 34 letters. [2022-02-21 04:31:38,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 34 letters. [2022-02-21 04:31:38,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 31 letters. [2022-02-21 04:31:38,942 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,942 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 31 letters. [2022-02-21 04:31:38,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 31 letters. [2022-02-21 04:31:38,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 31 letters. [2022-02-21 04:31:38,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 31 letters. [2022-02-21 04:31:38,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 57 letters. Loop has 31 letters. [2022-02-21 04:31:38,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,944 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 34 letters. [2022-02-21 04:31:38,944 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 34 letters. [2022-02-21 04:31:38,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 61 letters. Loop has 34 letters. [2022-02-21 04:31:38,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,945 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:31:38,945 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:31:38,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:31:38,946 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,946 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 34 letters. [2022-02-21 04:31:38,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 34 letters. [2022-02-21 04:31:38,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 34 letters. [2022-02-21 04:31:38,947 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,947 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 34 letters. [2022-02-21 04:31:38,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 34 letters. [2022-02-21 04:31:38,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,948 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 59 letters. Loop has 34 letters. [2022-02-21 04:31:38,948 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 70 letters. Loop has 29 letters. [2022-02-21 04:31:38,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 29 letters. [2022-02-21 04:31:38,949 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,949 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 70 letters. Loop has 29 letters. [2022-02-21 04:31:38,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 30 letters. [2022-02-21 04:31:38,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 30 letters. [2022-02-21 04:31:38,950 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,950 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 57 letters. Loop has 30 letters. [2022-02-21 04:31:38,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 27 letters. [2022-02-21 04:31:38,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 27 letters. [2022-02-21 04:31:38,951 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,951 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 55 letters. Loop has 27 letters. [2022-02-21 04:31:38,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:31:38,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,952 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:31:38,952 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 32 letters. [2022-02-21 04:31:38,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 30 letters. [2022-02-21 04:31:38,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,953 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 30 letters. [2022-02-21 04:31:38,953 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 53 letters. Loop has 30 letters. [2022-02-21 04:31:38,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 53 letters. Loop has 29 letters. [2022-02-21 04:31:38,954 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,954 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 29 letters. [2022-02-21 04:31:38,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 53 letters. Loop has 29 letters. [2022-02-21 04:31:38,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:31:38,955 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,955 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:31:38,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 54 letters. Loop has 32 letters. [2022-02-21 04:31:38,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 31 letters. [2022-02-21 04:31:38,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 31 letters. [2022-02-21 04:31:38,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 31 letters. [2022-02-21 04:31:38,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 58 letters. Loop has 30 letters. [2022-02-21 04:31:38,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 58 letters. Loop has 30 letters. [2022-02-21 04:31:38,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 58 letters. Loop has 30 letters. [2022-02-21 04:31:38,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 54 letters. Loop has 27 letters. [2022-02-21 04:31:38,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 54 letters. Loop has 27 letters. [2022-02-21 04:31:38,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 54 letters. Loop has 27 letters. [2022-02-21 04:31:38,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 29 letters. [2022-02-21 04:31:38,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 29 letters. [2022-02-21 04:31:38,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 55 letters. Loop has 29 letters. [2022-02-21 04:31:38,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 65 letters. Loop has 27 letters. [2022-02-21 04:31:38,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 65 letters. Loop has 27 letters. [2022-02-21 04:31:38,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 65 letters. Loop has 27 letters. [2022-02-21 04:31:38,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 66 letters. Loop has 27 letters. [2022-02-21 04:31:38,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 66 letters. Loop has 27 letters. [2022-02-21 04:31:38,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 66 letters. Loop has 27 letters. [2022-02-21 04:31:38,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 30 letters. [2022-02-21 04:31:38,963 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,963 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 30 letters. [2022-02-21 04:31:38,971 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,971 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 55 letters. Loop has 30 letters. [2022-02-21 04:31:38,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 31 letters. [2022-02-21 04:31:38,972 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,972 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 31 letters. [2022-02-21 04:31:38,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 56 letters. Loop has 31 letters. [2022-02-21 04:31:38,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 30 letters. [2022-02-21 04:31:38,973 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,973 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 30 letters. [2022-02-21 04:31:38,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 56 letters. Loop has 30 letters. [2022-02-21 04:31:38,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,974 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 70 letters. Loop has 27 letters. [2022-02-21 04:31:38,974 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 70 letters. Loop has 27 letters. [2022-02-21 04:31:38,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 70 letters. Loop has 27 letters. [2022-02-21 04:31:38,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,975 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 71 letters. Loop has 27 letters. [2022-02-21 04:31:38,975 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 71 letters. Loop has 27 letters. [2022-02-21 04:31:38,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 71 letters. Loop has 27 letters. [2022-02-21 04:31:38,976 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,976 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 48 letters. Loop has 29 letters. [2022-02-21 04:31:38,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 29 letters. [2022-02-21 04:31:38,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 48 letters. Loop has 29 letters. [2022-02-21 04:31:38,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 51 letters. Loop has 27 letters. [2022-02-21 04:31:38,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 27 letters. [2022-02-21 04:31:38,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 51 letters. Loop has 27 letters. [2022-02-21 04:31:38,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 52 letters. Loop has 27 letters. [2022-02-21 04:31:38,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 27 letters. [2022-02-21 04:31:38,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,979 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 52 letters. Loop has 27 letters. [2022-02-21 04:31:38,979 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 51 letters. Loop has 29 letters. [2022-02-21 04:31:38,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 51 letters. Loop has 29 letters. [2022-02-21 04:31:38,980 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,980 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 51 letters. Loop has 29 letters. [2022-02-21 04:31:38,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 52 letters. Loop has 29 letters. [2022-02-21 04:31:38,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 29 letters. [2022-02-21 04:31:38,981 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,981 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 52 letters. Loop has 29 letters. [2022-02-21 04:31:38,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 52 letters. Loop has 30 letters. [2022-02-21 04:31:38,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 52 letters. Loop has 30 letters. [2022-02-21 04:31:38,982 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,982 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 52 letters. Loop has 30 letters. [2022-02-21 04:31:38,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 55 letters. Loop has 31 letters. [2022-02-21 04:31:38,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 55 letters. Loop has 31 letters. [2022-02-21 04:31:38,983 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,983 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 55 letters. Loop has 31 letters. [2022-02-21 04:31:38,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 56 letters. Loop has 27 letters. [2022-02-21 04:31:38,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,984 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 27 letters. [2022-02-21 04:31:38,984 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 56 letters. Loop has 27 letters. [2022-02-21 04:31:38,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 57 letters. Loop has 27 letters. [2022-02-21 04:31:38,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,985 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 57 letters. Loop has 27 letters. [2022-02-21 04:31:38,985 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 57 letters. Loop has 27 letters. [2022-02-21 04:31:38,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 59 letters. Loop has 30 letters. [2022-02-21 04:31:38,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 59 letters. Loop has 30 letters. [2022-02-21 04:31:38,986 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 59 letters. Loop has 30 letters. [2022-02-21 04:31:38,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 30 letters. [2022-02-21 04:31:38,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 30 letters. [2022-02-21 04:31:38,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 30 letters. [2022-02-21 04:31:38,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 60 letters. Loop has 31 letters. [2022-02-21 04:31:38,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 60 letters. Loop has 31 letters. [2022-02-21 04:31:38,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 60 letters. Loop has 31 letters. [2022-02-21 04:31:38,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 61 letters. Loop has 30 letters. [2022-02-21 04:31:38,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 61 letters. Loop has 30 letters. [2022-02-21 04:31:38,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 61 letters. Loop has 30 letters. [2022-02-21 04:31:38,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,990 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 30 letters. [2022-02-21 04:31:38,990 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 30 letters. [2022-02-21 04:31:38,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 62 letters. Loop has 30 letters. [2022-02-21 04:31:38,991 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,991 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 62 letters. Loop has 31 letters. [2022-02-21 04:31:38,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 62 letters. Loop has 31 letters. [2022-02-21 04:31:38,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 62 letters. Loop has 31 letters. [2022-02-21 04:31:38,992 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,992 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 195 states and 288 transitions. cyclomatic complexity: 94 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:31:38,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:31:38,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,993 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 329 states and 498 transitions. cyclomatic complexity: 170 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:31:38,993 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,993 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:31:38,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:38,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2022-02-21 04:31:38,996 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 201 transitions. Stem has 48 letters. Loop has 29 letters. [2022-02-21 04:31:38,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 201 transitions. Stem has 77 letters. Loop has 29 letters. [2022-02-21 04:31:38,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,997 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 201 transitions. Stem has 48 letters. Loop has 58 letters. [2022-02-21 04:31:38,997 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:31:38,997 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 329 states and 498 transitions. cyclomatic complexity: 170 [2022-02-21 04:31:39,007 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:31:39,008 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 329 states to 0 states and 0 transitions. [2022-02-21 04:31:39,008 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:31:39,008 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:31:39,008 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:31:39,008 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:31:39,008 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:31:39,008 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:31:39,009 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:31:39,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:31:39,009 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:31:39,009 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:39,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:31:39,010 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 04:31:39,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 04:31:39,010 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 04:31:39,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:31:39,076 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-02-21 04:31:39,076 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:31:39,077 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 04:31:39,077 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:31:39,077 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:31:39,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:31:39,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:31:39,077 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:31:39,077 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:31:39,077 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:31:39,077 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:31:39,077 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:31:39,078 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:31:39,078 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:31:39,083 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:31:39 BoogieIcfgContainer [2022-02-21 04:31:39,083 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:31:39,084 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:31:39,084 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:31:39,084 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:31:39,084 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:31:31" (3/4) ... [2022-02-21 04:31:39,086 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:31:39,087 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:31:39,088 INFO L158 Benchmark]: Toolchain (without parser) took 8442.06ms. Allocated memory was 83.9MB in the beginning and 172.0MB in the end (delta: 88.1MB). Free memory was 50.6MB in the beginning and 122.1MB in the end (delta: -71.5MB). Peak memory consumption was 16.3MB. Max. memory is 16.1GB. [2022-02-21 04:31:39,088 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 83.9MB. Free memory was 53.5MB in the beginning and 53.4MB in the end (delta: 23.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:31:39,088 INFO L158 Benchmark]: CACSL2BoogieTranslator took 412.19ms. Allocated memory was 83.9MB in the beginning and 109.1MB in the end (delta: 25.2MB). Free memory was 50.4MB in the beginning and 76.8MB in the end (delta: -26.4MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. [2022-02-21 04:31:39,089 INFO L158 Benchmark]: Boogie Procedure Inliner took 72.50ms. Allocated memory is still 109.1MB. Free memory was 76.8MB in the beginning and 73.0MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 04:31:39,089 INFO L158 Benchmark]: Boogie Preprocessor took 31.31ms. Allocated memory is still 109.1MB. Free memory was 73.0MB in the beginning and 70.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 04:31:39,089 INFO L158 Benchmark]: RCFGBuilder took 750.38ms. Allocated memory is still 109.1MB. Free memory was 70.5MB in the beginning and 65.8MB in the end (delta: 4.8MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. [2022-02-21 04:31:39,089 INFO L158 Benchmark]: BuchiAutomizer took 7167.53ms. Allocated memory was 109.1MB in the beginning and 172.0MB in the end (delta: 62.9MB). Free memory was 65.8MB in the beginning and 123.1MB in the end (delta: -57.3MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. [2022-02-21 04:31:39,090 INFO L158 Benchmark]: Witness Printer took 2.86ms. Allocated memory is still 172.0MB. Free memory was 123.1MB in the beginning and 122.1MB in the end (delta: 968.3kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:31:39,091 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.19ms. Allocated memory is still 83.9MB. Free memory was 53.5MB in the beginning and 53.4MB in the end (delta: 23.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 412.19ms. Allocated memory was 83.9MB in the beginning and 109.1MB in the end (delta: 25.2MB). Free memory was 50.4MB in the beginning and 76.8MB in the end (delta: -26.4MB). Peak memory consumption was 10.2MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 72.50ms. Allocated memory is still 109.1MB. Free memory was 76.8MB in the beginning and 73.0MB in the end (delta: 3.8MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 31.31ms. Allocated memory is still 109.1MB. Free memory was 73.0MB in the beginning and 70.5MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 750.38ms. Allocated memory is still 109.1MB. Free memory was 70.5MB in the beginning and 65.8MB in the end (delta: 4.8MB). Peak memory consumption was 15.9MB. Max. memory is 16.1GB. * BuchiAutomizer took 7167.53ms. Allocated memory was 109.1MB in the beginning and 172.0MB in the end (delta: 62.9MB). Free memory was 65.8MB in the beginning and 123.1MB in the end (delta: -57.3MB). Peak memory consumption was 5.0MB. Max. memory is 16.1GB. * Witness Printer took 2.86ms. Allocated memory is still 172.0MB. Free memory was 123.1MB in the beginning and 122.1MB in the end (delta: 968.3kB). There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * i2 + 11 and consists of 3 locations. 4 modules have a trivial ranking function, the largest among these consists of 5 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 7.1s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 4.0s. Construction of modules took 0.0s. Büchi inclusion checks took 2.6s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 195 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 376 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 376 mSDsluCounter, 2538 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1669 mSDsCounter, 48 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 45 IncrementalHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 48 mSolverCounterUnsat, 869 mSDtfsCounter, 45 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI1 SFLT0 conc0 concLT1 SILN0 SILU0 SILI2 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital142 mio100 ax100 hnf100 lsp26 ukn100 mio100 lsp100 div123 bol100 ite100 ukn100 eq182 hnf86 smp100 dnf100 smp100 tf102 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 35ms VariablesStem: 0 VariablesLoop: 3 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 2 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 04:31:39,123 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