./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/seq-mthreaded/pals_lcr.5.1.ufo.BOUNDED-10.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_lcr.5.1.ufo.BOUNDED-10.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 2c3b1a53bc376cbb6283db57f6430d0a17b3acc99aa70ab198c7c36e6e59ecc9 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 04:29:46,574 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 04:29:46,576 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 04:29:46,605 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 04:29:46,606 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 04:29:46,609 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 04:29:46,611 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 04:29:46,615 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 04:29:46,616 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 04:29:46,616 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 04:29:46,617 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 04:29:46,618 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 04:29:46,618 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 04:29:46,619 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 04:29:46,619 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 04:29:46,620 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 04:29:46,621 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 04:29:46,636 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 04:29:46,637 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 04:29:46,641 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 04:29:46,646 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 04:29:46,647 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 04:29:46,648 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 04:29:46,650 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 04:29:46,651 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 04:29:46,652 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 04:29:46,652 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 04:29:46,653 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 04:29:46,654 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 04:29:46,654 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 04:29:46,655 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 04:29:46,655 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 04:29:46,656 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 04:29:46,657 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 04:29:46,658 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 04:29:46,658 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 04:29:46,659 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 04:29:46,659 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 04:29:46,659 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 04:29:46,660 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 04:29:46,660 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 04:29:46,661 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:29:46,684 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 04:29:46,684 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 04:29:46,685 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 04:29:46,685 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 04:29:46,686 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 04:29:46,686 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 04:29:46,686 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 04:29:46,686 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 04:29:46,687 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 04:29:46,687 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 04:29:46,687 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 04:29:46,688 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 04:29:46,688 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 04:29:46,688 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 04:29:46,688 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 04:29:46,688 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 04:29:46,688 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 04:29:46,688 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 04:29:46,689 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 04:29:46,689 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 04:29:46,689 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 04:29:46,689 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 04:29:46,689 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 04:29:46,689 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 04:29:46,689 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 04:29:46,689 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 04:29:46,690 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 04:29:46,690 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 04:29:46,690 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 04:29:46,690 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 04:29:46,690 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 04:29:46,691 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 04:29:46,691 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 -> 2c3b1a53bc376cbb6283db57f6430d0a17b3acc99aa70ab198c7c36e6e59ecc9 [2022-02-21 04:29:46,889 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 04:29:46,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 04:29:46,912 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 04:29:46,913 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 04:29:46,914 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 04:29:46,914 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/seq-mthreaded/pals_lcr.5.1.ufo.BOUNDED-10.pals.c [2022-02-21 04:29:46,966 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc2a28354/c2e76c37787841fd85abb03ad8b72ced/FLAG9df3b6f20 [2022-02-21 04:29:47,356 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 04:29:47,357 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/seq-mthreaded/pals_lcr.5.1.ufo.BOUNDED-10.pals.c [2022-02-21 04:29:47,365 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc2a28354/c2e76c37787841fd85abb03ad8b72ced/FLAG9df3b6f20 [2022-02-21 04:29:47,377 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fc2a28354/c2e76c37787841fd85abb03ad8b72ced [2022-02-21 04:29:47,379 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 04:29:47,382 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 04:29:47,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 04:29:47,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 04:29:47,386 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 04:29:47,389 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:29:47" (1/1) ... [2022-02-21 04:29:47,390 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@57eb51e2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:47, skipping insertion in model container [2022-02-21 04:29:47,391 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 04:29:47" (1/1) ... [2022-02-21 04:29:47,396 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 04:29:47,430 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 04:29:47,595 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_lcr.5.1.ufo.BOUNDED-10.pals.c[11270,11283] [2022-02-21 04:29:47,595 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:29:47,601 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 04:29:47,644 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_lcr.5.1.ufo.BOUNDED-10.pals.c[11270,11283] [2022-02-21 04:29:47,651 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 04:29:47,661 INFO L208 MainTranslator]: Completed translation [2022-02-21 04:29:47,663 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:47 WrapperNode [2022-02-21 04:29:47,663 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 04:29:47,664 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 04:29:47,664 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 04:29:47,664 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 04:29:47,668 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:29:47" (1/1) ... [2022-02-21 04:29:47,690 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:29:47" (1/1) ... [2022-02-21 04:29:47,725 INFO L137 Inliner]: procedures = 24, calls = 16, calls flagged for inlining = 11, calls inlined = 11, statements flattened = 316 [2022-02-21 04:29:47,725 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 04:29:47,726 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 04:29:47,726 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 04:29:47,726 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 04:29:47,731 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:47" (1/1) ... [2022-02-21 04:29:47,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:47" (1/1) ... [2022-02-21 04:29:47,733 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:47" (1/1) ... [2022-02-21 04:29:47,733 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:47" (1/1) ... [2022-02-21 04:29:47,739 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:47" (1/1) ... [2022-02-21 04:29:47,744 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:47" (1/1) ... [2022-02-21 04:29:47,745 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:47" (1/1) ... [2022-02-21 04:29:47,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 04:29:47,748 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 04:29:47,748 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 04:29:47,748 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 04:29:47,749 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:47" (1/1) ... [2022-02-21 04:29:47,753 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:47,762 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:29:47,782 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:29:47,793 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:29:47,813 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 04:29:47,813 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 04:29:47,814 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 04:29:47,814 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 04:29:47,890 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 04:29:47,892 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 04:29:48,285 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 04:29:48,291 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 04:29:48,291 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 04:29:48,293 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:29:48 BoogieIcfgContainer [2022-02-21 04:29:48,294 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 04:29:48,295 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 04:29:48,295 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 04:29:48,298 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 04:29:48,298 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:29:48,299 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 04:29:47" (1/3) ... [2022-02-21 04:29:48,300 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b0b04cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:29:48, skipping insertion in model container [2022-02-21 04:29:48,300 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:29:48,300 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 04:29:47" (2/3) ... [2022-02-21 04:29:48,300 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@1b0b04cf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 04:29:48, skipping insertion in model container [2022-02-21 04:29:48,300 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 04:29:48,300 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:29:48" (3/3) ... [2022-02-21 04:29:48,301 INFO L388 chiAutomizerObserver]: Analyzing ICFG pals_lcr.5.1.ufo.BOUNDED-10.pals.c [2022-02-21 04:29:48,331 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 04:29:48,331 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 04:29:48,331 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 04:29:48,331 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 04:29:48,331 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 04:29:48,331 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 04:29:48,331 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 04:29:48,331 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 04:29:48,343 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 92 states, 91 states have (on average 1.7142857142857142) internal successors, (156), 91 states have internal predecessors, (156), 0 states have call successors, (0), 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:29:48,370 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2022-02-21 04:29:48,370 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:29:48,370 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:29:48,374 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:29:48,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, 1] [2022-02-21 04:29:48,375 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 04:29:48,384 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 92 states, 91 states have (on average 1.7142857142857142) internal successors, (156), 91 states have internal predecessors, (156), 0 states have call successors, (0), 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:29:48,393 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 51 [2022-02-21 04:29:48,396 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:29:48,397 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:29:48,398 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 04:29:48,398 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] [2022-02-21 04:29:48,404 INFO L791 eck$LassoCheckResult]: Stem: 68#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(35, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0; 53#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, 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~ret30#1, main_#t~ret31#1, main_#t~post32#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 7#L198true assume !(0 == ~r1~0);init_~tmp~0#1 := 0; 32#L198-1true init_#res#1 := init_~tmp~0#1; 5#L323true main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#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; 58#L22true assume !(0 == assume_abort_if_not_~cond#1); 40#L21true assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 18#L395-2true [2022-02-21 04:29:48,409 INFO L793 eck$LassoCheckResult]: Loop: 18#L395-2true assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 9#L71true assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 85#L75true assume !(node1_~m1~0#1 != ~nomsg~0); 38#L75-1true ~mode1~0 := 0; 82#L71-2true assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 56#L99true assume !(0 != ~mode2~0 % 256); 69#L112true assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; 79#L112-2true ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; 61#L99-2true assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 20#L124true assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 74#L127true assume !(node3_~m3~0#1 != ~nomsg~0); 27#L127-1true ~mode3~0 := 0; 87#L124-2true assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 33#L149true assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 42#L152true assume !(node4_~m4~0#1 != ~nomsg~0); 14#L152-1true ~mode4~0 := 0; 67#L149-2true assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 84#L174true assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 72#L177true assume !(node5_~m5~0#1 != ~nomsg~0); 81#L177-1true ~mode5~0 := 0; 60#L174-2true assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 15#L331true assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; 37#L331-1true check_#res#1 := check_~tmp~1#1; 4#L351true main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#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; 51#L425true assume !(0 == assert_~arg#1 % 256); 48#L420true assume { :end_inline_assert } true;main_#t~post32#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post32#1;havoc main_#t~post32#1; 18#L395-2true [2022-02-21 04:29:48,416 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:29:48,417 INFO L85 PathProgramCache]: Analyzing trace with hash 1978587388, now seen corresponding path program 1 times [2022-02-21 04:29:48,423 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:29:48,423 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [155204268] [2022-02-21 04:29:48,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:29:48,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:29:48,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:29:48,607 INFO L290 TraceCheckUtils]: 0: Hoare triple {96#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(35, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0; {96#true} is VALID [2022-02-21 04:29:48,607 INFO L290 TraceCheckUtils]: 1: Hoare triple {96#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, 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~ret30#1, main_#t~ret31#1, main_#t~post32#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {96#true} is VALID [2022-02-21 04:29:48,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {96#true} assume !(0 == ~r1~0);init_~tmp~0#1 := 0; {98#(= |ULTIMATE.start_init_~tmp~0#1| 0)} is VALID [2022-02-21 04:29:48,610 INFO L290 TraceCheckUtils]: 3: Hoare triple {98#(= |ULTIMATE.start_init_~tmp~0#1| 0)} init_#res#1 := init_~tmp~0#1; {99#(= |ULTIMATE.start_init_#res#1| 0)} is VALID [2022-02-21 04:29:48,611 INFO L290 TraceCheckUtils]: 4: Hoare triple {99#(= |ULTIMATE.start_init_#res#1| 0)} main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#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; {100#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} is VALID [2022-02-21 04:29:48,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {100#(= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)} assume !(0 == assume_abort_if_not_~cond#1); {97#false} is VALID [2022-02-21 04:29:48,611 INFO L290 TraceCheckUtils]: 6: Hoare triple {97#false} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {97#false} is VALID [2022-02-21 04:29:48,612 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:29:48,613 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:29:48,614 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [155204268] [2022-02-21 04:29:48,614 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [155204268] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:29:48,615 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:29:48,615 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:29:48,616 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174380255] [2022-02-21 04:29:48,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:29:48,621 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 04:29:48,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:29:48,622 INFO L85 PathProgramCache]: Analyzing trace with hash 225661616, now seen corresponding path program 1 times [2022-02-21 04:29:48,622 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:29:48,622 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34978384] [2022-02-21 04:29:48,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:29:48,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:29:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:29:48,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {101#true} assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {101#true} is VALID [2022-02-21 04:29:48,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {101#true} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {101#true} is VALID [2022-02-21 04:29:48,826 INFO L290 TraceCheckUtils]: 2: Hoare triple {101#true} assume !(node1_~m1~0#1 != ~nomsg~0); {101#true} is VALID [2022-02-21 04:29:48,826 INFO L290 TraceCheckUtils]: 3: Hoare triple {101#true} ~mode1~0 := 0; {101#true} is VALID [2022-02-21 04:29:48,826 INFO L290 TraceCheckUtils]: 4: Hoare triple {101#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {101#true} is VALID [2022-02-21 04:29:48,826 INFO L290 TraceCheckUtils]: 5: Hoare triple {101#true} assume !(0 != ~mode2~0 % 256); {101#true} is VALID [2022-02-21 04:29:48,827 INFO L290 TraceCheckUtils]: 6: Hoare triple {101#true} assume ~send2~0 != ~nomsg~0 && ~p2_new~0 == ~nomsg~0;node2_#t~ite5#1 := ~send2~0; {101#true} is VALID [2022-02-21 04:29:48,827 INFO L290 TraceCheckUtils]: 7: Hoare triple {101#true} ~p2_new~0 := (if node2_#t~ite5#1 % 256 <= 127 then node2_#t~ite5#1 % 256 else node2_#t~ite5#1 % 256 - 256);havoc node2_#t~ite5#1;~mode2~0 := 1; {101#true} is VALID [2022-02-21 04:29:48,835 INFO L290 TraceCheckUtils]: 8: Hoare triple {101#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {101#true} is VALID [2022-02-21 04:29:48,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {101#true} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {101#true} is VALID [2022-02-21 04:29:48,835 INFO L290 TraceCheckUtils]: 10: Hoare triple {101#true} assume !(node3_~m3~0#1 != ~nomsg~0); {101#true} is VALID [2022-02-21 04:29:48,835 INFO L290 TraceCheckUtils]: 11: Hoare triple {101#true} ~mode3~0 := 0; {101#true} is VALID [2022-02-21 04:29:48,835 INFO L290 TraceCheckUtils]: 12: Hoare triple {101#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {101#true} is VALID [2022-02-21 04:29:48,836 INFO L290 TraceCheckUtils]: 13: Hoare triple {101#true} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {101#true} is VALID [2022-02-21 04:29:48,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {101#true} assume !(node4_~m4~0#1 != ~nomsg~0); {101#true} is VALID [2022-02-21 04:29:48,836 INFO L290 TraceCheckUtils]: 15: Hoare triple {101#true} ~mode4~0 := 0; {101#true} is VALID [2022-02-21 04:29:48,836 INFO L290 TraceCheckUtils]: 16: Hoare triple {101#true} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {101#true} is VALID [2022-02-21 04:29:48,836 INFO L290 TraceCheckUtils]: 17: Hoare triple {101#true} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {101#true} is VALID [2022-02-21 04:29:48,836 INFO L290 TraceCheckUtils]: 18: Hoare triple {101#true} assume !(node5_~m5~0#1 != ~nomsg~0); {101#true} is VALID [2022-02-21 04:29:48,837 INFO L290 TraceCheckUtils]: 19: Hoare triple {101#true} ~mode5~0 := 0; {101#true} is VALID [2022-02-21 04:29:48,837 INFO L290 TraceCheckUtils]: 20: Hoare triple {101#true} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {101#true} is VALID [2022-02-21 04:29:48,837 INFO L290 TraceCheckUtils]: 21: Hoare triple {101#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {103#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:29:48,838 INFO L290 TraceCheckUtils]: 22: Hoare triple {103#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {104#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:29:48,839 INFO L290 TraceCheckUtils]: 23: Hoare triple {104#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#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; {105#(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:29:48,839 INFO L290 TraceCheckUtils]: 24: Hoare triple {105#(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); {102#false} is VALID [2022-02-21 04:29:48,840 INFO L290 TraceCheckUtils]: 25: Hoare triple {102#false} assume { :end_inline_assert } true;main_#t~post32#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post32#1;havoc main_#t~post32#1; {102#false} is VALID [2022-02-21 04:29:48,840 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:29:48,840 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:29:48,840 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34978384] [2022-02-21 04:29:48,840 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34978384] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:29:48,855 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:29:48,855 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:29:48,855 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843222199] [2022-02-21 04:29:48,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:29:48,856 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:29:48,857 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:29:48,873 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:29:48,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:29:48,886 INFO L87 Difference]: Start difference. First operand has 92 states, 91 states have (on average 1.7142857142857142) internal successors, (156), 91 states have internal predecessors, (156), 0 states have call successors, (0), 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 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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:29:49,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:29:49,253 INFO L93 Difference]: Finished difference Result 95 states and 155 transitions. [2022-02-21 04:29:49,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:29:49,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 1.4) internal successors, (7), 5 states have internal predecessors, (7), 0 states have call successors, (0), 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:29:49,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:29:49,267 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 95 states and 155 transitions. [2022-02-21 04:29:49,276 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2022-02-21 04:29:49,280 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 95 states to 87 states and 117 transitions. [2022-02-21 04:29:49,280 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 87 [2022-02-21 04:29:49,281 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 87 [2022-02-21 04:29:49,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 117 transitions. [2022-02-21 04:29:49,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:29:49,281 INFO L681 BuchiCegarLoop]: Abstraction has 87 states and 117 transitions. [2022-02-21 04:29:49,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 117 transitions. [2022-02-21 04:29:49,303 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-02-21 04:29:49,304 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:29:49,306 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states and 117 transitions. Second operand has 87 states, 87 states have (on average 1.3448275862068966) internal successors, (117), 86 states have internal predecessors, (117), 0 states have call successors, (0), 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:29:49,307 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states and 117 transitions. Second operand has 87 states, 87 states have (on average 1.3448275862068966) internal successors, (117), 86 states have internal predecessors, (117), 0 states have call successors, (0), 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:29:49,308 INFO L87 Difference]: Start difference. First operand 87 states and 117 transitions. Second operand has 87 states, 87 states have (on average 1.3448275862068966) internal successors, (117), 86 states have internal predecessors, (117), 0 states have call successors, (0), 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:29:49,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:29:49,315 INFO L93 Difference]: Finished difference Result 87 states and 117 transitions. [2022-02-21 04:29:49,315 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 117 transitions. [2022-02-21 04:29:49,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:29:49,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:29:49,317 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 87 states have (on average 1.3448275862068966) internal successors, (117), 86 states have internal predecessors, (117), 0 states have call successors, (0), 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 87 states and 117 transitions. [2022-02-21 04:29:49,317 INFO L87 Difference]: Start difference. First operand has 87 states, 87 states have (on average 1.3448275862068966) internal successors, (117), 86 states have internal predecessors, (117), 0 states have call successors, (0), 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 87 states and 117 transitions. [2022-02-21 04:29:49,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:29:49,325 INFO L93 Difference]: Finished difference Result 87 states and 117 transitions. [2022-02-21 04:29:49,325 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 117 transitions. [2022-02-21 04:29:49,326 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:29:49,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:29:49,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:29:49,327 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:29:49,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 87 states have (on average 1.3448275862068966) internal successors, (117), 86 states have internal predecessors, (117), 0 states have call successors, (0), 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:29:49,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 117 transitions. [2022-02-21 04:29:49,331 INFO L704 BuchiCegarLoop]: Abstraction has 87 states and 117 transitions. [2022-02-21 04:29:49,331 INFO L587 BuchiCegarLoop]: Abstraction has 87 states and 117 transitions. [2022-02-21 04:29:49,331 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 04:29:49,331 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 117 transitions. [2022-02-21 04:29:49,334 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2022-02-21 04:29:49,334 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:29:49,334 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:29:49,338 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] [2022-02-21 04:29:49,338 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] [2022-02-21 04:29:49,338 INFO L791 eck$LassoCheckResult]: Stem: 282#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(35, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0; 272#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, 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~ret30#1, main_#t~ret31#1, main_#t~post32#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 211#L198 assume 0 == ~r1~0; 212#L199 assume ~id1~0 >= 0; 267#L200 assume 0 == ~st1~0; 268#L201 assume ~send1~0 == ~id1~0; 246#L202 assume 0 == ~mode1~0 % 256; 247#L203 assume ~id2~0 >= 0; 262#L204 assume 0 == ~st2~0; 223#L205 assume ~send2~0 == ~id2~0; 224#L206 assume 0 == ~mode2~0 % 256; 213#L207 assume ~id3~0 >= 0; 214#L208 assume 0 == ~st3~0; 271#L209 assume ~send3~0 == ~id3~0; 225#L210 assume 0 == ~mode3~0 % 256; 226#L211 assume ~id4~0 >= 0; 215#L212 assume 0 == ~st4~0; 216#L213 assume ~send4~0 == ~id4~0; 288#L214 assume 0 == ~mode4~0 % 256; 289#L215 assume ~id5~0 >= 0; 270#L216 assume 0 == ~st5~0; 252#L217 assume ~send5~0 == ~id5~0; 253#L218 assume 0 == ~mode5~0 % 256; 273#L219 assume ~id1~0 != ~id2~0; 291#L220 assume ~id1~0 != ~id3~0; 245#L221 assume ~id1~0 != ~id4~0; 243#L222 assume ~id1~0 != ~id5~0; 244#L223 assume ~id2~0 != ~id3~0; 236#L224 assume ~id2~0 != ~id4~0; 237#L225 assume ~id2~0 != ~id5~0; 231#L226 assume ~id3~0 != ~id4~0; 232#L227 assume ~id3~0 != ~id5~0; 248#L228 assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; 249#L198-1 init_#res#1 := init_~tmp~0#1; 207#L323 main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#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; 208#L22 assume !(0 == assume_abort_if_not_~cond#1); 264#L21 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 235#L395-2 [2022-02-21 04:29:49,338 INFO L793 eck$LassoCheckResult]: Loop: 235#L395-2 assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 217#L71 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 218#L75 assume !(node1_~m1~0#1 != ~nomsg~0); 263#L75-1 ~mode1~0 := 0; 210#L71-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 274#L99 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 275#L102 assume !(node2_~m2~0#1 != ~nomsg~0); 254#L102-1 ~mode2~0 := 0; 255#L99-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 238#L124 assume !(0 != ~mode3~0 % 256); 240#L137 assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; 279#L137-2 ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; 251#L124-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 257#L149 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 258#L152 assume !(node4_~m4~0#1 != ~nomsg~0); 221#L152-1 ~mode4~0 := 0; 227#L149-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 281#L174 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 285#L177 assume !(node5_~m5~0#1 != ~nomsg~0); 261#L177-1 ~mode5~0 := 0; 242#L174-2 assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 228#L331 assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; 229#L331-1 check_#res#1 := check_~tmp~1#1; 205#L351 main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#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; 206#L425 assume !(0 == assert_~arg#1 % 256); 269#L420 assume { :end_inline_assert } true;main_#t~post32#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post32#1;havoc main_#t~post32#1; 235#L395-2 [2022-02-21 04:29:49,339 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:29:49,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1992034189, now seen corresponding path program 1 times [2022-02-21 04:29:49,339 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:29:49,340 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889432457] [2022-02-21 04:29:49,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:29:49,340 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:29:49,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:29:49,388 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:29:49,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:29:49,440 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:29:49,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:29:49,442 INFO L85 PathProgramCache]: Analyzing trace with hash 571407792, now seen corresponding path program 1 times [2022-02-21 04:29:49,442 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:29:49,442 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193721631] [2022-02-21 04:29:49,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:29:49,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:29:49,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:29:49,546 INFO L290 TraceCheckUtils]: 0: Hoare triple {471#true} assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {471#true} is VALID [2022-02-21 04:29:49,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {471#true} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {471#true} is VALID [2022-02-21 04:29:49,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {471#true} assume !(node1_~m1~0#1 != ~nomsg~0); {471#true} is VALID [2022-02-21 04:29:49,547 INFO L290 TraceCheckUtils]: 3: Hoare triple {471#true} ~mode1~0 := 0; {471#true} is VALID [2022-02-21 04:29:49,547 INFO L290 TraceCheckUtils]: 4: Hoare triple {471#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {471#true} is VALID [2022-02-21 04:29:49,547 INFO L290 TraceCheckUtils]: 5: Hoare triple {471#true} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {471#true} is VALID [2022-02-21 04:29:49,547 INFO L290 TraceCheckUtils]: 6: Hoare triple {471#true} assume !(node2_~m2~0#1 != ~nomsg~0); {471#true} is VALID [2022-02-21 04:29:49,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {471#true} ~mode2~0 := 0; {471#true} is VALID [2022-02-21 04:29:49,547 INFO L290 TraceCheckUtils]: 8: Hoare triple {471#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {471#true} is VALID [2022-02-21 04:29:49,547 INFO L290 TraceCheckUtils]: 9: Hoare triple {471#true} assume !(0 != ~mode3~0 % 256); {471#true} is VALID [2022-02-21 04:29:49,547 INFO L290 TraceCheckUtils]: 10: Hoare triple {471#true} assume ~send3~0 != ~nomsg~0 && ~p3_new~0 == ~nomsg~0;node3_#t~ite6#1 := ~send3~0; {471#true} is VALID [2022-02-21 04:29:49,547 INFO L290 TraceCheckUtils]: 11: Hoare triple {471#true} ~p3_new~0 := (if node3_#t~ite6#1 % 256 <= 127 then node3_#t~ite6#1 % 256 else node3_#t~ite6#1 % 256 - 256);havoc node3_#t~ite6#1;~mode3~0 := 1; {471#true} is VALID [2022-02-21 04:29:49,549 INFO L290 TraceCheckUtils]: 12: Hoare triple {471#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {471#true} is VALID [2022-02-21 04:29:49,549 INFO L290 TraceCheckUtils]: 13: Hoare triple {471#true} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {471#true} is VALID [2022-02-21 04:29:49,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {471#true} assume !(node4_~m4~0#1 != ~nomsg~0); {471#true} is VALID [2022-02-21 04:29:49,550 INFO L290 TraceCheckUtils]: 15: Hoare triple {471#true} ~mode4~0 := 0; {471#true} is VALID [2022-02-21 04:29:49,550 INFO L290 TraceCheckUtils]: 16: Hoare triple {471#true} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {471#true} is VALID [2022-02-21 04:29:49,550 INFO L290 TraceCheckUtils]: 17: Hoare triple {471#true} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {471#true} is VALID [2022-02-21 04:29:49,553 INFO L290 TraceCheckUtils]: 18: Hoare triple {471#true} assume !(node5_~m5~0#1 != ~nomsg~0); {471#true} is VALID [2022-02-21 04:29:49,553 INFO L290 TraceCheckUtils]: 19: Hoare triple {471#true} ~mode5~0 := 0; {471#true} is VALID [2022-02-21 04:29:49,553 INFO L290 TraceCheckUtils]: 20: Hoare triple {471#true} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {471#true} is VALID [2022-02-21 04:29:49,554 INFO L290 TraceCheckUtils]: 21: Hoare triple {471#true} assume !(~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1);check_~tmp~1#1 := 0; {473#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} is VALID [2022-02-21 04:29:49,554 INFO L290 TraceCheckUtils]: 22: Hoare triple {473#(and (<= |ULTIMATE.start_check_~tmp~1#1| 0) (<= 0 |ULTIMATE.start_check_~tmp~1#1|))} check_#res#1 := check_~tmp~1#1; {474#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} is VALID [2022-02-21 04:29:49,556 INFO L290 TraceCheckUtils]: 23: Hoare triple {474#(and (<= 0 |ULTIMATE.start_check_#res#1|) (<= |ULTIMATE.start_check_#res#1| 0))} main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#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; {475#(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:29:49,557 INFO L290 TraceCheckUtils]: 24: Hoare triple {475#(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); {472#false} is VALID [2022-02-21 04:29:49,557 INFO L290 TraceCheckUtils]: 25: Hoare triple {472#false} assume { :end_inline_assert } true;main_#t~post32#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post32#1;havoc main_#t~post32#1; {472#false} is VALID [2022-02-21 04:29:49,558 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:29:49,558 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:29:49,558 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193721631] [2022-02-21 04:29:49,559 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193721631] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:29:49,559 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:29:49,559 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 04:29:49,560 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534688183] [2022-02-21 04:29:49,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:29:49,560 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:29:49,561 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:29:49,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 04:29:49,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-21 04:29:49,562 INFO L87 Difference]: Start difference. First operand 87 states and 117 transitions. cyclomatic complexity: 31 Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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:29:49,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:29:49,793 INFO L93 Difference]: Finished difference Result 90 states and 119 transitions. [2022-02-21 04:29:49,794 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-21 04:29:49,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 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:29:49,812 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:29:49,813 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 90 states and 119 transitions. [2022-02-21 04:29:49,815 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2022-02-21 04:29:49,817 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 90 states to 87 states and 114 transitions. [2022-02-21 04:29:49,817 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 87 [2022-02-21 04:29:49,817 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 87 [2022-02-21 04:29:49,817 INFO L73 IsDeterministic]: Start isDeterministic. Operand 87 states and 114 transitions. [2022-02-21 04:29:49,818 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:29:49,818 INFO L681 BuchiCegarLoop]: Abstraction has 87 states and 114 transitions. [2022-02-21 04:29:49,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states and 114 transitions. [2022-02-21 04:29:49,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-02-21 04:29:49,821 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:29:49,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states and 114 transitions. Second operand has 87 states, 87 states have (on average 1.3103448275862069) internal successors, (114), 86 states have internal predecessors, (114), 0 states have call successors, (0), 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:29:49,821 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states and 114 transitions. Second operand has 87 states, 87 states have (on average 1.3103448275862069) internal successors, (114), 86 states have internal predecessors, (114), 0 states have call successors, (0), 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:29:49,821 INFO L87 Difference]: Start difference. First operand 87 states and 114 transitions. Second operand has 87 states, 87 states have (on average 1.3103448275862069) internal successors, (114), 86 states have internal predecessors, (114), 0 states have call successors, (0), 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:29:49,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:29:49,823 INFO L93 Difference]: Finished difference Result 87 states and 114 transitions. [2022-02-21 04:29:49,823 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 114 transitions. [2022-02-21 04:29:49,824 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:29:49,824 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:29:49,824 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 87 states have (on average 1.3103448275862069) internal successors, (114), 86 states have internal predecessors, (114), 0 states have call successors, (0), 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 87 states and 114 transitions. [2022-02-21 04:29:49,824 INFO L87 Difference]: Start difference. First operand has 87 states, 87 states have (on average 1.3103448275862069) internal successors, (114), 86 states have internal predecessors, (114), 0 states have call successors, (0), 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 87 states and 114 transitions. [2022-02-21 04:29:49,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:29:49,826 INFO L93 Difference]: Finished difference Result 87 states and 114 transitions. [2022-02-21 04:29:49,826 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 114 transitions. [2022-02-21 04:29:49,827 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:29:49,827 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:29:49,827 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:29:49,827 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:29:49,827 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 87 states have (on average 1.3103448275862069) internal successors, (114), 86 states have internal predecessors, (114), 0 states have call successors, (0), 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:29:49,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 114 transitions. [2022-02-21 04:29:49,829 INFO L704 BuchiCegarLoop]: Abstraction has 87 states and 114 transitions. [2022-02-21 04:29:49,829 INFO L587 BuchiCegarLoop]: Abstraction has 87 states and 114 transitions. [2022-02-21 04:29:49,829 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 04:29:49,829 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 87 states and 114 transitions. [2022-02-21 04:29:49,830 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 50 [2022-02-21 04:29:49,830 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:29:49,830 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:29:49,831 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] [2022-02-21 04:29:49,831 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] [2022-02-21 04:29:49,831 INFO L791 eck$LassoCheckResult]: Stem: 647#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(35, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0; 637#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, 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~ret30#1, main_#t~ret31#1, main_#t~post32#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 576#L198 assume 0 == ~r1~0; 577#L199 assume ~id1~0 >= 0; 632#L200 assume 0 == ~st1~0; 633#L201 assume ~send1~0 == ~id1~0; 611#L202 assume 0 == ~mode1~0 % 256; 612#L203 assume ~id2~0 >= 0; 627#L204 assume 0 == ~st2~0; 588#L205 assume ~send2~0 == ~id2~0; 589#L206 assume 0 == ~mode2~0 % 256; 578#L207 assume ~id3~0 >= 0; 579#L208 assume 0 == ~st3~0; 636#L209 assume ~send3~0 == ~id3~0; 590#L210 assume 0 == ~mode3~0 % 256; 591#L211 assume ~id4~0 >= 0; 583#L212 assume 0 == ~st4~0; 584#L213 assume ~send4~0 == ~id4~0; 653#L214 assume 0 == ~mode4~0 % 256; 654#L215 assume ~id5~0 >= 0; 635#L216 assume 0 == ~st5~0; 619#L217 assume ~send5~0 == ~id5~0; 620#L218 assume 0 == ~mode5~0 % 256; 638#L219 assume ~id1~0 != ~id2~0; 656#L220 assume ~id1~0 != ~id3~0; 610#L221 assume ~id1~0 != ~id4~0; 608#L222 assume ~id1~0 != ~id5~0; 609#L223 assume ~id2~0 != ~id3~0; 601#L224 assume ~id2~0 != ~id4~0; 602#L225 assume ~id2~0 != ~id5~0; 595#L226 assume ~id3~0 != ~id4~0; 596#L227 assume ~id3~0 != ~id5~0; 613#L228 assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; 614#L198-1 init_#res#1 := init_~tmp~0#1; 572#L323 main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#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; 573#L22 assume !(0 == assume_abort_if_not_~cond#1); 629#L21 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 600#L395-2 [2022-02-21 04:29:49,833 INFO L793 eck$LassoCheckResult]: Loop: 600#L395-2 assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 580#L71 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 581#L75 assume !(node1_~m1~0#1 != ~nomsg~0); 628#L75-1 ~mode1~0 := 0; 575#L71-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 639#L99 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 640#L102 assume !(node2_~m2~0#1 != ~nomsg~0); 617#L102-1 ~mode2~0 := 0; 618#L99-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 603#L124 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 604#L127 assume !(node3_~m3~0#1 != ~nomsg~0); 615#L127-1 ~mode3~0 := 0; 616#L124-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 622#L149 assume !(0 != ~mode4~0 % 256); 624#L162 assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; 631#L162-2 ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; 592#L149-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 646#L174 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 650#L177 assume !(node5_~m5~0#1 != ~nomsg~0); 626#L177-1 ~mode5~0 := 0; 607#L174-2 assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 593#L331 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 594#L332 assume ~r1~0 >= 5; 597#L336 assume ~r1~0 < 5;check_~tmp~1#1 := 1; 598#L331-1 check_#res#1 := check_~tmp~1#1; 570#L351 main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#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; 571#L425 assume !(0 == assert_~arg#1 % 256); 634#L420 assume { :end_inline_assert } true;main_#t~post32#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post32#1;havoc main_#t~post32#1; 600#L395-2 [2022-02-21 04:29:49,834 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:29:49,834 INFO L85 PathProgramCache]: Analyzing trace with hash -1992034189, now seen corresponding path program 2 times [2022-02-21 04:29:49,834 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:29:49,834 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [158539911] [2022-02-21 04:29:49,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:29:49,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:29:49,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:29:49,871 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:29:49,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:29:49,901 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:29:49,903 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:29:49,903 INFO L85 PathProgramCache]: Analyzing trace with hash -747827424, now seen corresponding path program 1 times [2022-02-21 04:29:49,903 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:29:49,903 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29749084] [2022-02-21 04:29:49,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:29:49,904 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:29:49,913 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:29:49,925 INFO L290 TraceCheckUtils]: 0: Hoare triple {836#true} assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {836#true} is VALID [2022-02-21 04:29:49,925 INFO L290 TraceCheckUtils]: 1: Hoare triple {836#true} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {836#true} is VALID [2022-02-21 04:29:49,926 INFO L290 TraceCheckUtils]: 2: Hoare triple {836#true} assume !(node1_~m1~0#1 != ~nomsg~0); {836#true} is VALID [2022-02-21 04:29:49,926 INFO L290 TraceCheckUtils]: 3: Hoare triple {836#true} ~mode1~0 := 0; {836#true} is VALID [2022-02-21 04:29:49,926 INFO L290 TraceCheckUtils]: 4: Hoare triple {836#true} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {836#true} is VALID [2022-02-21 04:29:49,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {836#true} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {836#true} is VALID [2022-02-21 04:29:49,926 INFO L290 TraceCheckUtils]: 6: Hoare triple {836#true} assume !(node2_~m2~0#1 != ~nomsg~0); {836#true} is VALID [2022-02-21 04:29:49,926 INFO L290 TraceCheckUtils]: 7: Hoare triple {836#true} ~mode2~0 := 0; {836#true} is VALID [2022-02-21 04:29:49,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {836#true} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {836#true} is VALID [2022-02-21 04:29:49,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {836#true} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {836#true} is VALID [2022-02-21 04:29:49,927 INFO L290 TraceCheckUtils]: 10: Hoare triple {836#true} assume !(node3_~m3~0#1 != ~nomsg~0); {836#true} is VALID [2022-02-21 04:29:49,927 INFO L290 TraceCheckUtils]: 11: Hoare triple {836#true} ~mode3~0 := 0; {836#true} is VALID [2022-02-21 04:29:49,928 INFO L290 TraceCheckUtils]: 12: Hoare triple {836#true} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {836#true} is VALID [2022-02-21 04:29:49,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {836#true} assume !(0 != ~mode4~0 % 256); {836#true} is VALID [2022-02-21 04:29:49,928 INFO L290 TraceCheckUtils]: 14: Hoare triple {836#true} assume ~send4~0 != ~nomsg~0 && ~p4_new~0 == ~nomsg~0;node4_#t~ite7#1 := ~send4~0; {836#true} is VALID [2022-02-21 04:29:49,928 INFO L290 TraceCheckUtils]: 15: Hoare triple {836#true} ~p4_new~0 := (if node4_#t~ite7#1 % 256 <= 127 then node4_#t~ite7#1 % 256 else node4_#t~ite7#1 % 256 - 256);havoc node4_#t~ite7#1;~mode4~0 := 1; {836#true} is VALID [2022-02-21 04:29:49,928 INFO L290 TraceCheckUtils]: 16: Hoare triple {836#true} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {836#true} is VALID [2022-02-21 04:29:49,928 INFO L290 TraceCheckUtils]: 17: Hoare triple {836#true} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {836#true} is VALID [2022-02-21 04:29:49,929 INFO L290 TraceCheckUtils]: 18: Hoare triple {836#true} assume !(node5_~m5~0#1 != ~nomsg~0); {836#true} is VALID [2022-02-21 04:29:49,929 INFO L290 TraceCheckUtils]: 19: Hoare triple {836#true} ~mode5~0 := 0; {836#true} is VALID [2022-02-21 04:29:49,929 INFO L290 TraceCheckUtils]: 20: Hoare triple {836#true} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {836#true} is VALID [2022-02-21 04:29:49,929 INFO L290 TraceCheckUtils]: 21: Hoare triple {836#true} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {836#true} is VALID [2022-02-21 04:29:49,930 INFO L290 TraceCheckUtils]: 22: Hoare triple {836#true} assume ~r1~0 >= 5; {838#(not (<= ~r1~0 4))} is VALID [2022-02-21 04:29:49,930 INFO L290 TraceCheckUtils]: 23: Hoare triple {838#(not (<= ~r1~0 4))} assume ~r1~0 < 5;check_~tmp~1#1 := 1; {837#false} is VALID [2022-02-21 04:29:49,930 INFO L290 TraceCheckUtils]: 24: Hoare triple {837#false} check_#res#1 := check_~tmp~1#1; {837#false} is VALID [2022-02-21 04:29:49,930 INFO L290 TraceCheckUtils]: 25: Hoare triple {837#false} main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#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; {837#false} is VALID [2022-02-21 04:29:49,930 INFO L290 TraceCheckUtils]: 26: Hoare triple {837#false} assume !(0 == assert_~arg#1 % 256); {837#false} is VALID [2022-02-21 04:29:49,931 INFO L290 TraceCheckUtils]: 27: Hoare triple {837#false} assume { :end_inline_assert } true;main_#t~post32#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post32#1;havoc main_#t~post32#1; {837#false} is VALID [2022-02-21 04:29:49,931 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:29:49,931 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:29:49,931 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29749084] [2022-02-21 04:29:49,931 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [29749084] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:29:49,931 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:29:49,932 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:29:49,932 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [63759178] [2022-02-21 04:29:49,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:29:49,932 INFO L808 eck$LassoCheckResult]: loop already infeasible [2022-02-21 04:29:49,932 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:29:49,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:29:49,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:29:49,933 INFO L87 Difference]: Start difference. First operand 87 states and 114 transitions. cyclomatic complexity: 28 Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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:29:50,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:29:50,051 INFO L93 Difference]: Finished difference Result 131 states and 180 transitions. [2022-02-21 04:29:50,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 04:29:50,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 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:29:50,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:29:50,071 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 131 states and 180 transitions. [2022-02-21 04:29:50,074 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2022-02-21 04:29:50,076 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 131 states to 131 states and 180 transitions. [2022-02-21 04:29:50,076 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 131 [2022-02-21 04:29:50,077 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 131 [2022-02-21 04:29:50,077 INFO L73 IsDeterministic]: Start isDeterministic. Operand 131 states and 180 transitions. [2022-02-21 04:29:50,077 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:29:50,077 INFO L681 BuchiCegarLoop]: Abstraction has 131 states and 180 transitions. [2022-02-21 04:29:50,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states and 180 transitions. [2022-02-21 04:29:50,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2022-02-21 04:29:50,081 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 04:29:50,081 INFO L82 GeneralOperation]: Start isEquivalent. First operand 131 states and 180 transitions. Second operand has 131 states, 131 states have (on average 1.3740458015267176) internal successors, (180), 130 states have internal predecessors, (180), 0 states have call successors, (0), 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:29:50,081 INFO L74 IsIncluded]: Start isIncluded. First operand 131 states and 180 transitions. Second operand has 131 states, 131 states have (on average 1.3740458015267176) internal successors, (180), 130 states have internal predecessors, (180), 0 states have call successors, (0), 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:29:50,082 INFO L87 Difference]: Start difference. First operand 131 states and 180 transitions. Second operand has 131 states, 131 states have (on average 1.3740458015267176) internal successors, (180), 130 states have internal predecessors, (180), 0 states have call successors, (0), 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:29:50,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:29:50,084 INFO L93 Difference]: Finished difference Result 131 states and 180 transitions. [2022-02-21 04:29:50,084 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 180 transitions. [2022-02-21 04:29:50,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:29:50,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:29:50,085 INFO L74 IsIncluded]: Start isIncluded. First operand has 131 states, 131 states have (on average 1.3740458015267176) internal successors, (180), 130 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 131 states and 180 transitions. [2022-02-21 04:29:50,086 INFO L87 Difference]: Start difference. First operand has 131 states, 131 states have (on average 1.3740458015267176) internal successors, (180), 130 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 131 states and 180 transitions. [2022-02-21 04:29:50,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:29:50,088 INFO L93 Difference]: Finished difference Result 131 states and 180 transitions. [2022-02-21 04:29:50,088 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 180 transitions. [2022-02-21 04:29:50,104 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 04:29:50,105 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 04:29:50,105 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 04:29:50,105 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 04:29:50,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 131 states have (on average 1.3740458015267176) internal successors, (180), 130 states have internal predecessors, (180), 0 states have call successors, (0), 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:29:50,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 180 transitions. [2022-02-21 04:29:50,108 INFO L704 BuchiCegarLoop]: Abstraction has 131 states and 180 transitions. [2022-02-21 04:29:50,108 INFO L587 BuchiCegarLoop]: Abstraction has 131 states and 180 transitions. [2022-02-21 04:29:50,108 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 04:29:50,108 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 180 transitions. [2022-02-21 04:29:50,109 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 94 [2022-02-21 04:29:50,109 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:29:50,109 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:29:50,112 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] [2022-02-21 04:29:50,112 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:29:50,113 INFO L791 eck$LassoCheckResult]: Stem: 1051#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(35, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0; 1041#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, 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~ret30#1, main_#t~ret31#1, main_#t~post32#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; 976#L198 assume 0 == ~r1~0; 977#L199 assume ~id1~0 >= 0; 1036#L200 assume 0 == ~st1~0; 1037#L201 assume ~send1~0 == ~id1~0; 1011#L202 assume 0 == ~mode1~0 % 256; 1012#L203 assume ~id2~0 >= 0; 1026#L204 assume 0 == ~st2~0; 985#L205 assume ~send2~0 == ~id2~0; 986#L206 assume 0 == ~mode2~0 % 256; 978#L207 assume ~id3~0 >= 0; 979#L208 assume 0 == ~st3~0; 1040#L209 assume ~send3~0 == ~id3~0; 990#L210 assume 0 == ~mode3~0 % 256; 991#L211 assume ~id4~0 >= 0; 980#L212 assume 0 == ~st4~0; 981#L213 assume ~send4~0 == ~id4~0; 1057#L214 assume 0 == ~mode4~0 % 256; 1058#L215 assume ~id5~0 >= 0; 1039#L216 assume 0 == ~st5~0; 1017#L217 assume ~send5~0 == ~id5~0; 1018#L218 assume 0 == ~mode5~0 % 256; 1042#L219 assume ~id1~0 != ~id2~0; 1060#L220 assume ~id1~0 != ~id3~0; 1010#L221 assume ~id1~0 != ~id4~0; 1008#L222 assume ~id1~0 != ~id5~0; 1009#L223 assume ~id2~0 != ~id3~0; 1001#L224 assume ~id2~0 != ~id4~0; 1002#L225 assume ~id2~0 != ~id5~0; 996#L226 assume ~id3~0 != ~id4~0; 997#L227 assume ~id3~0 != ~id5~0; 1013#L228 assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; 1014#L198-1 init_#res#1 := init_~tmp~0#1; 972#L323 main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#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; 973#L22 assume !(0 == assume_abort_if_not_~cond#1); 1031#L21 assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; 1000#L395-2 [2022-02-21 04:29:50,113 INFO L793 eck$LassoCheckResult]: Loop: 1000#L395-2 assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; 982#L71 assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; 983#L75 assume !(node1_~m1~0#1 != ~nomsg~0); 1030#L75-1 ~mode1~0 := 0; 975#L71-2 assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; 1043#L99 assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; 1044#L102 assume !(node2_~m2~0#1 != ~nomsg~0); 1019#L102-1 ~mode2~0 := 0; 1020#L99-2 assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; 1003#L124 assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; 1004#L127 assume !(node3_~m3~0#1 != ~nomsg~0); 1015#L127-1 ~mode3~0 := 0; 1016#L124-2 assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; 1023#L149 assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; 1024#L152 assume !(node4_~m4~0#1 != ~nomsg~0); 988#L152-1 ~mode4~0 := 0; 1071#L149-2 assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; 1070#L174 assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; 1067#L177 assume !(node5_~m5~0#1 != ~nomsg~0); 1065#L177-1 ~mode5~0 := 0; 1063#L174-2 assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; 1062#L331 assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; 1061#L332 assume !(~r1~0 >= 5); 1021#L335 assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; 1022#L336 assume ~r1~0 < 5;check_~tmp~1#1 := 1; 1029#L331-1 check_#res#1 := check_~tmp~1#1; 970#L351 main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#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; 971#L425 assume !(0 == assert_~arg#1 % 256); 1038#L420 assume { :end_inline_assert } true;main_#t~post32#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post32#1;havoc main_#t~post32#1; 1000#L395-2 [2022-02-21 04:29:50,113 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:29:50,113 INFO L85 PathProgramCache]: Analyzing trace with hash -1992034189, now seen corresponding path program 3 times [2022-02-21 04:29:50,114 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:29:50,114 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251072226] [2022-02-21 04:29:50,114 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:29:50,114 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:29:50,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:29:50,158 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:29:50,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:29:50,181 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:29:50,182 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:29:50,182 INFO L85 PathProgramCache]: Analyzing trace with hash -148360473, now seen corresponding path program 1 times [2022-02-21 04:29:50,182 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:29:50,182 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1426948357] [2022-02-21 04:29:50,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:29:50,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:29:50,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:29:50,196 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 04:29:50,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 04:29:50,206 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 04:29:50,219 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:29:50,219 INFO L85 PathProgramCache]: Analyzing trace with hash -1947490379, now seen corresponding path program 1 times [2022-02-21 04:29:50,220 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 04:29:50,220 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687746675] [2022-02-21 04:29:50,220 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 04:29:50,220 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 04:29:50,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:29:50,275 INFO L290 TraceCheckUtils]: 0: Hoare triple {1370#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(35, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0; {1370#true} is VALID [2022-02-21 04:29:50,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {1370#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, 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~ret30#1, main_#t~ret31#1, main_#t~post32#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1370#true} is VALID [2022-02-21 04:29:50,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {1370#true} assume 0 == ~r1~0; {1370#true} is VALID [2022-02-21 04:29:50,276 INFO L290 TraceCheckUtils]: 3: Hoare triple {1370#true} assume ~id1~0 >= 0; {1370#true} is VALID [2022-02-21 04:29:50,276 INFO L290 TraceCheckUtils]: 4: Hoare triple {1370#true} assume 0 == ~st1~0; {1370#true} is VALID [2022-02-21 04:29:50,276 INFO L290 TraceCheckUtils]: 5: Hoare triple {1370#true} assume ~send1~0 == ~id1~0; {1370#true} is VALID [2022-02-21 04:29:50,277 INFO L290 TraceCheckUtils]: 6: Hoare triple {1370#true} assume 0 == ~mode1~0 % 256; {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:29:50,277 INFO L290 TraceCheckUtils]: 7: Hoare triple {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 >= 0; {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:29:50,278 INFO L290 TraceCheckUtils]: 8: Hoare triple {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st2~0; {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:29:50,278 INFO L290 TraceCheckUtils]: 9: Hoare triple {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send2~0 == ~id2~0; {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:29:50,279 INFO L290 TraceCheckUtils]: 10: Hoare triple {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode2~0 % 256; {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:29:50,279 INFO L290 TraceCheckUtils]: 11: Hoare triple {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 >= 0; {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:29:50,280 INFO L290 TraceCheckUtils]: 12: Hoare triple {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st3~0; {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:29:50,280 INFO L290 TraceCheckUtils]: 13: Hoare triple {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send3~0 == ~id3~0; {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:29:50,281 INFO L290 TraceCheckUtils]: 14: Hoare triple {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode3~0 % 256; {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:29:50,281 INFO L290 TraceCheckUtils]: 15: Hoare triple {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 >= 0; {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:29:50,282 INFO L290 TraceCheckUtils]: 16: Hoare triple {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st4~0; {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:29:50,282 INFO L290 TraceCheckUtils]: 17: Hoare triple {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send4~0 == ~id4~0; {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:29:50,282 INFO L290 TraceCheckUtils]: 18: Hoare triple {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode4~0 % 256; {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:29:50,284 INFO L290 TraceCheckUtils]: 19: Hoare triple {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id5~0 >= 0; {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:29:50,285 INFO L290 TraceCheckUtils]: 20: Hoare triple {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~st5~0; {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:29:50,285 INFO L290 TraceCheckUtils]: 21: Hoare triple {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~send5~0 == ~id5~0; {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:29:50,286 INFO L290 TraceCheckUtils]: 22: Hoare triple {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 == ~mode5~0 % 256; {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:29:50,286 INFO L290 TraceCheckUtils]: 23: Hoare triple {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id2~0; {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:29:50,287 INFO L290 TraceCheckUtils]: 24: Hoare triple {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id3~0; {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:29:50,287 INFO L290 TraceCheckUtils]: 25: Hoare triple {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id4~0; {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:29:50,288 INFO L290 TraceCheckUtils]: 26: Hoare triple {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id1~0 != ~id5~0; {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:29:50,289 INFO L290 TraceCheckUtils]: 27: Hoare triple {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id3~0; {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:29:50,289 INFO L290 TraceCheckUtils]: 28: Hoare triple {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id4~0; {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:29:50,290 INFO L290 TraceCheckUtils]: 29: Hoare triple {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id2~0 != ~id5~0; {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:29:50,290 INFO L290 TraceCheckUtils]: 30: Hoare triple {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id4~0; {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:29:50,291 INFO L290 TraceCheckUtils]: 31: Hoare triple {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id3~0 != ~id5~0; {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:29:50,292 INFO L290 TraceCheckUtils]: 32: Hoare triple {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:29:50,292 INFO L290 TraceCheckUtils]: 33: Hoare triple {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} init_#res#1 := init_~tmp~0#1; {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:29:50,293 INFO L290 TraceCheckUtils]: 34: Hoare triple {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#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; {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:29:50,293 INFO L290 TraceCheckUtils]: 35: Hoare triple {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !(0 == assume_abort_if_not_~cond#1); {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:29:50,294 INFO L290 TraceCheckUtils]: 36: Hoare triple {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:29:50,294 INFO L290 TraceCheckUtils]: 37: Hoare triple {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} is VALID [2022-02-21 04:29:50,295 INFO L290 TraceCheckUtils]: 38: Hoare triple {1372#(= (+ (* (- 256) (div ~mode1~0 256)) ~mode1~0) 0)} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1371#false} is VALID [2022-02-21 04:29:50,295 INFO L290 TraceCheckUtils]: 39: Hoare triple {1371#false} assume !(node1_~m1~0#1 != ~nomsg~0); {1371#false} is VALID [2022-02-21 04:29:50,295 INFO L290 TraceCheckUtils]: 40: Hoare triple {1371#false} ~mode1~0 := 0; {1371#false} is VALID [2022-02-21 04:29:50,295 INFO L290 TraceCheckUtils]: 41: Hoare triple {1371#false} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1371#false} is VALID [2022-02-21 04:29:50,295 INFO L290 TraceCheckUtils]: 42: Hoare triple {1371#false} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1371#false} is VALID [2022-02-21 04:29:50,296 INFO L290 TraceCheckUtils]: 43: Hoare triple {1371#false} assume !(node2_~m2~0#1 != ~nomsg~0); {1371#false} is VALID [2022-02-21 04:29:50,296 INFO L290 TraceCheckUtils]: 44: Hoare triple {1371#false} ~mode2~0 := 0; {1371#false} is VALID [2022-02-21 04:29:50,296 INFO L290 TraceCheckUtils]: 45: Hoare triple {1371#false} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1371#false} is VALID [2022-02-21 04:29:50,296 INFO L290 TraceCheckUtils]: 46: Hoare triple {1371#false} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1371#false} is VALID [2022-02-21 04:29:50,296 INFO L290 TraceCheckUtils]: 47: Hoare triple {1371#false} assume !(node3_~m3~0#1 != ~nomsg~0); {1371#false} is VALID [2022-02-21 04:29:50,296 INFO L290 TraceCheckUtils]: 48: Hoare triple {1371#false} ~mode3~0 := 0; {1371#false} is VALID [2022-02-21 04:29:50,297 INFO L290 TraceCheckUtils]: 49: Hoare triple {1371#false} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1371#false} is VALID [2022-02-21 04:29:50,297 INFO L290 TraceCheckUtils]: 50: Hoare triple {1371#false} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1371#false} is VALID [2022-02-21 04:29:50,297 INFO L290 TraceCheckUtils]: 51: Hoare triple {1371#false} assume !(node4_~m4~0#1 != ~nomsg~0); {1371#false} is VALID [2022-02-21 04:29:50,297 INFO L290 TraceCheckUtils]: 52: Hoare triple {1371#false} ~mode4~0 := 0; {1371#false} is VALID [2022-02-21 04:29:50,297 INFO L290 TraceCheckUtils]: 53: Hoare triple {1371#false} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {1371#false} is VALID [2022-02-21 04:29:50,297 INFO L290 TraceCheckUtils]: 54: Hoare triple {1371#false} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1371#false} is VALID [2022-02-21 04:29:50,298 INFO L290 TraceCheckUtils]: 55: Hoare triple {1371#false} assume !(node5_~m5~0#1 != ~nomsg~0); {1371#false} is VALID [2022-02-21 04:29:50,298 INFO L290 TraceCheckUtils]: 56: Hoare triple {1371#false} ~mode5~0 := 0; {1371#false} is VALID [2022-02-21 04:29:50,298 INFO L290 TraceCheckUtils]: 57: Hoare triple {1371#false} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1371#false} is VALID [2022-02-21 04:29:50,298 INFO L290 TraceCheckUtils]: 58: Hoare triple {1371#false} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {1371#false} is VALID [2022-02-21 04:29:50,298 INFO L290 TraceCheckUtils]: 59: Hoare triple {1371#false} assume !(~r1~0 >= 5); {1371#false} is VALID [2022-02-21 04:29:50,298 INFO L290 TraceCheckUtils]: 60: Hoare triple {1371#false} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {1371#false} is VALID [2022-02-21 04:29:50,299 INFO L290 TraceCheckUtils]: 61: Hoare triple {1371#false} assume ~r1~0 < 5;check_~tmp~1#1 := 1; {1371#false} is VALID [2022-02-21 04:29:50,299 INFO L290 TraceCheckUtils]: 62: Hoare triple {1371#false} check_#res#1 := check_~tmp~1#1; {1371#false} is VALID [2022-02-21 04:29:50,309 INFO L290 TraceCheckUtils]: 63: Hoare triple {1371#false} main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#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; {1371#false} is VALID [2022-02-21 04:29:50,309 INFO L290 TraceCheckUtils]: 64: Hoare triple {1371#false} assume !(0 == assert_~arg#1 % 256); {1371#false} is VALID [2022-02-21 04:29:50,309 INFO L290 TraceCheckUtils]: 65: Hoare triple {1371#false} assume { :end_inline_assert } true;main_#t~post32#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post32#1;havoc main_#t~post32#1; {1371#false} is VALID [2022-02-21 04:29:50,309 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:29:50,310 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 04:29:50,311 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687746675] [2022-02-21 04:29:50,311 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [687746675] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 04:29:50,311 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 04:29:50,311 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 04:29:50,311 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1074961352] [2022-02-21 04:29:50,311 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 04:29:51,058 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:29:51,059 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:29:51,059 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:29:51,059 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:29:51,059 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 04:29:51,059 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:51,059 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:29:51,059 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:29:51,060 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.5.1.ufo.BOUNDED-10.pals.c_Iteration4_Loop [2022-02-21 04:29:51,060 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:29:51,060 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:29:51,076 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:51,082 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:51,086 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:51,087 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:51,089 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:51,094 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:51,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:51,106 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:51,111 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:51,114 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:51,118 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:51,120 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:51,121 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:51,148 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:51,153 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:51,154 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:51,160 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:51,163 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:51,771 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:29:51,772 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 04:29:51,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:51,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:29:51,775 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:29:51,782 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 04:29:51,782 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:29:51,799 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Waiting until timeout for monitored process [2022-02-21 04:29:51,831 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Forceful destruction successful, exit code 0 [2022-02-21 04:29:51,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:51,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:29:51,832 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:29:51,833 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:29:51,834 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 04:29:51,834 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 04:29:51,994 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 04:29:51,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Ended with exit code 0 [2022-02-21 04:29:51,999 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 04:29:51,999 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 04:29:51,999 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 04:29:51,999 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 04:29:51,999 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 04:29:51,999 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:51,999 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 04:29:51,999 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 04:29:51,999 INFO L133 ssoRankerPreferences]: Filename of dumped script: pals_lcr.5.1.ufo.BOUNDED-10.pals.c_Iteration4_Loop [2022-02-21 04:29:51,999 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 04:29:51,999 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 04:29:52,002 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:52,017 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:52,022 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:52,024 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:52,026 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:52,031 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:52,041 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:52,043 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:52,048 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:52,050 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:52,055 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:52,057 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:52,059 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:52,063 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:52,065 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:52,070 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:52,101 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:52,104 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 04:29:52,747 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 04:29:52,750 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 04:29:52,751 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:52,751 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:29:52,752 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:29:52,753 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:29:52,755 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:29:52,761 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:29:52,761 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:29:52,762 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:29:52,762 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:29:52,762 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:29:52,763 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:29:52,763 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:29:52,765 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:29:52,780 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (4)] Forceful destruction successful, exit code 0 [2022-02-21 04:29:52,780 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:52,780 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:29:52,781 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:29:52,782 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:29:52,783 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:29:52,789 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:29:52,789 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:29:52,789 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:29:52,789 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:29:52,789 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:29:52,790 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:29:52,790 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:29:52,810 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:29:52,827 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:29:52,827 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:52,827 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:29:52,829 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:29:52,829 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:29:52,830 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:29:52,837 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:29:52,837 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:29:52,837 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:29:52,837 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:29:52,837 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:29:52,837 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:29:52,837 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:29:52,838 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:29:52,853 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:29:52,853 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:52,853 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:29:52,854 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:29:52,854 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:29:52,856 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:29:52,862 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:29:52,862 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:29:52,862 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:29:52,862 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:29:52,862 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:29:52,862 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:29:52,862 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:29:52,863 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 04:29:52,878 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:29:52,878 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:52,879 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:29:52,879 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:29:52,880 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:29:52,888 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:29:52,893 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 04:29:52,894 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 04:29:52,894 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 04:29:52,894 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 04:29:52,894 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 04:29:52,894 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 04:29:52,894 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 04:29:52,915 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 04:29:52,924 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 04:29:52,924 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 04:29:52,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 04:29:52,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 04:29:52,927 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:29:52,929 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:29:52,937 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 04:29:52,938 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 04:29:52,938 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 04:29:52,938 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_main_~i2~0#1) = -2*ULTIMATE.start_main_~i2~0#1 + 19 Supporting invariants [] [2022-02-21 04:29:52,957 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Ended with exit code 0 [2022-02-21 04:29:52,965 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 04:29:52,983 INFO L390 LassoCheck]: Loop: "assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0;" "assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0;" "assume !(node1_~m1~0#1 != ~nomsg~0);" "~mode1~0 := 0;" "assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0;" "assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0;" "assume !(node2_~m2~0#1 != ~nomsg~0);" "~mode2~0 := 0;" "assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0;" "assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0;" "assume !(node3_~m3~0#1 != ~nomsg~0);" "~mode3~0 := 0;" "assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0;" "assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0;" "assume !(node4_~m4~0#1 != ~nomsg~0);" "~mode4~0 := 0;" "assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0;" "assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0;" "assume !(node5_~m5~0#1 != ~nomsg~0);" "~mode5~0 := 0;" "assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1;" "assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1;" "assume !(~r1~0 >= 5);" "assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0;" "assume ~r1~0 < 5;check_~tmp~1#1 := 1;" "check_#res#1 := check_~tmp~1#1;" "main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#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~post32#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post32#1;havoc main_#t~post32#1;" [2022-02-21 04:29:53,032 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:29:53,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:29:53,051 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 04:29:53,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:29:53,093 INFO L263 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 04:29:53,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:29:53,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:29:53,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {1373#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(35, 2);call #Ultimate.allocInit(12, 3);~nomsg~0 := -1;~r1~0 := 0;~p1~0 := 0;~p1_old~0 := 0;~p1_new~0 := 0;~id1~0 := 0;~st1~0 := 0;~send1~0 := 0;~mode1~0 := 0;~p2~0 := 0;~p2_old~0 := 0;~p2_new~0 := 0;~id2~0 := 0;~st2~0 := 0;~send2~0 := 0;~mode2~0 := 0;~p3~0 := 0;~p3_old~0 := 0;~p3_new~0 := 0;~id3~0 := 0;~st3~0 := 0;~send3~0 := 0;~mode3~0 := 0;~p4~0 := 0;~p4_old~0 := 0;~p4_new~0 := 0;~id4~0 := 0;~st4~0 := 0;~send4~0 := 0;~mode4~0 := 0;~p5~0 := 0;~p5_old~0 := 0;~p5_new~0 := 0;~id5~0 := 0;~st5~0 := 0;~send5~0 := 0;~mode5~0 := 0; {1373#unseeded} is VALID [2022-02-21 04:29:53,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {1373#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet9#1, 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~ret30#1, main_#t~ret31#1, main_#t~post32#1, main_~c1~0#1, main_~i2~0#1;havoc main_~c1~0#1;havoc main_~i2~0#1;main_~c1~0#1 := 0;~r1~0 := main_#t~nondet9#1;havoc main_#t~nondet9#1;~id1~0 := main_#t~nondet10#1;havoc main_#t~nondet10#1;~st1~0 := main_#t~nondet11#1;havoc main_#t~nondet11#1;~send1~0 := main_#t~nondet12#1;havoc main_#t~nondet12#1;~mode1~0 := main_#t~nondet13#1;havoc main_#t~nondet13#1;~id2~0 := main_#t~nondet14#1;havoc main_#t~nondet14#1;~st2~0 := main_#t~nondet15#1;havoc main_#t~nondet15#1;~send2~0 := main_#t~nondet16#1;havoc main_#t~nondet16#1;~mode2~0 := main_#t~nondet17#1;havoc main_#t~nondet17#1;~id3~0 := main_#t~nondet18#1;havoc main_#t~nondet18#1;~st3~0 := main_#t~nondet19#1;havoc main_#t~nondet19#1;~send3~0 := main_#t~nondet20#1;havoc main_#t~nondet20#1;~mode3~0 := main_#t~nondet21#1;havoc main_#t~nondet21#1;~id4~0 := main_#t~nondet22#1;havoc main_#t~nondet22#1;~st4~0 := main_#t~nondet23#1;havoc main_#t~nondet23#1;~send4~0 := main_#t~nondet24#1;havoc main_#t~nondet24#1;~mode4~0 := main_#t~nondet25#1;havoc main_#t~nondet25#1;~id5~0 := main_#t~nondet26#1;havoc main_#t~nondet26#1;~st5~0 := main_#t~nondet27#1;havoc main_#t~nondet27#1;~send5~0 := main_#t~nondet28#1;havoc main_#t~nondet28#1;~mode5~0 := main_#t~nondet29#1;havoc main_#t~nondet29#1;assume { :begin_inline_init } true;havoc init_#res#1;havoc init_~tmp~0#1;havoc init_~tmp~0#1; {1373#unseeded} is VALID [2022-02-21 04:29:53,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {1373#unseeded} assume 0 == ~r1~0; {1373#unseeded} is VALID [2022-02-21 04:29:53,153 INFO L290 TraceCheckUtils]: 3: Hoare triple {1373#unseeded} assume ~id1~0 >= 0; {1373#unseeded} is VALID [2022-02-21 04:29:53,154 INFO L290 TraceCheckUtils]: 4: Hoare triple {1373#unseeded} assume 0 == ~st1~0; {1373#unseeded} is VALID [2022-02-21 04:29:53,154 INFO L290 TraceCheckUtils]: 5: Hoare triple {1373#unseeded} assume ~send1~0 == ~id1~0; {1373#unseeded} is VALID [2022-02-21 04:29:53,154 INFO L290 TraceCheckUtils]: 6: Hoare triple {1373#unseeded} assume 0 == ~mode1~0 % 256; {1373#unseeded} is VALID [2022-02-21 04:29:53,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {1373#unseeded} assume ~id2~0 >= 0; {1373#unseeded} is VALID [2022-02-21 04:29:53,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {1373#unseeded} assume 0 == ~st2~0; {1373#unseeded} is VALID [2022-02-21 04:29:53,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {1373#unseeded} assume ~send2~0 == ~id2~0; {1373#unseeded} is VALID [2022-02-21 04:29:53,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {1373#unseeded} assume 0 == ~mode2~0 % 256; {1373#unseeded} is VALID [2022-02-21 04:29:53,155 INFO L290 TraceCheckUtils]: 11: Hoare triple {1373#unseeded} assume ~id3~0 >= 0; {1373#unseeded} is VALID [2022-02-21 04:29:53,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {1373#unseeded} assume 0 == ~st3~0; {1373#unseeded} is VALID [2022-02-21 04:29:53,156 INFO L290 TraceCheckUtils]: 13: Hoare triple {1373#unseeded} assume ~send3~0 == ~id3~0; {1373#unseeded} is VALID [2022-02-21 04:29:53,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {1373#unseeded} assume 0 == ~mode3~0 % 256; {1373#unseeded} is VALID [2022-02-21 04:29:53,157 INFO L290 TraceCheckUtils]: 15: Hoare triple {1373#unseeded} assume ~id4~0 >= 0; {1373#unseeded} is VALID [2022-02-21 04:29:53,157 INFO L290 TraceCheckUtils]: 16: Hoare triple {1373#unseeded} assume 0 == ~st4~0; {1373#unseeded} is VALID [2022-02-21 04:29:53,157 INFO L290 TraceCheckUtils]: 17: Hoare triple {1373#unseeded} assume ~send4~0 == ~id4~0; {1373#unseeded} is VALID [2022-02-21 04:29:53,157 INFO L290 TraceCheckUtils]: 18: Hoare triple {1373#unseeded} assume 0 == ~mode4~0 % 256; {1373#unseeded} is VALID [2022-02-21 04:29:53,158 INFO L290 TraceCheckUtils]: 19: Hoare triple {1373#unseeded} assume ~id5~0 >= 0; {1373#unseeded} is VALID [2022-02-21 04:29:53,158 INFO L290 TraceCheckUtils]: 20: Hoare triple {1373#unseeded} assume 0 == ~st5~0; {1373#unseeded} is VALID [2022-02-21 04:29:53,158 INFO L290 TraceCheckUtils]: 21: Hoare triple {1373#unseeded} assume ~send5~0 == ~id5~0; {1373#unseeded} is VALID [2022-02-21 04:29:53,158 INFO L290 TraceCheckUtils]: 22: Hoare triple {1373#unseeded} assume 0 == ~mode5~0 % 256; {1373#unseeded} is VALID [2022-02-21 04:29:53,159 INFO L290 TraceCheckUtils]: 23: Hoare triple {1373#unseeded} assume ~id1~0 != ~id2~0; {1373#unseeded} is VALID [2022-02-21 04:29:53,159 INFO L290 TraceCheckUtils]: 24: Hoare triple {1373#unseeded} assume ~id1~0 != ~id3~0; {1373#unseeded} is VALID [2022-02-21 04:29:53,159 INFO L290 TraceCheckUtils]: 25: Hoare triple {1373#unseeded} assume ~id1~0 != ~id4~0; {1373#unseeded} is VALID [2022-02-21 04:29:53,160 INFO L290 TraceCheckUtils]: 26: Hoare triple {1373#unseeded} assume ~id1~0 != ~id5~0; {1373#unseeded} is VALID [2022-02-21 04:29:53,160 INFO L290 TraceCheckUtils]: 27: Hoare triple {1373#unseeded} assume ~id2~0 != ~id3~0; {1373#unseeded} is VALID [2022-02-21 04:29:53,161 INFO L290 TraceCheckUtils]: 28: Hoare triple {1373#unseeded} assume ~id2~0 != ~id4~0; {1373#unseeded} is VALID [2022-02-21 04:29:53,161 INFO L290 TraceCheckUtils]: 29: Hoare triple {1373#unseeded} assume ~id2~0 != ~id5~0; {1373#unseeded} is VALID [2022-02-21 04:29:53,161 INFO L290 TraceCheckUtils]: 30: Hoare triple {1373#unseeded} assume ~id3~0 != ~id4~0; {1373#unseeded} is VALID [2022-02-21 04:29:53,161 INFO L290 TraceCheckUtils]: 31: Hoare triple {1373#unseeded} assume ~id3~0 != ~id5~0; {1373#unseeded} is VALID [2022-02-21 04:29:53,162 INFO L290 TraceCheckUtils]: 32: Hoare triple {1373#unseeded} assume ~id4~0 != ~id5~0;init_~tmp~0#1 := 1; {1373#unseeded} is VALID [2022-02-21 04:29:53,162 INFO L290 TraceCheckUtils]: 33: Hoare triple {1373#unseeded} init_#res#1 := init_~tmp~0#1; {1373#unseeded} is VALID [2022-02-21 04:29:53,162 INFO L290 TraceCheckUtils]: 34: Hoare triple {1373#unseeded} main_#t~ret30#1 := init_#res#1;assume { :end_inline_init } true;main_~i2~0#1 := main_#t~ret30#1;havoc main_#t~ret30#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; {1373#unseeded} is VALID [2022-02-21 04:29:53,163 INFO L290 TraceCheckUtils]: 35: Hoare triple {1373#unseeded} assume !(0 == assume_abort_if_not_~cond#1); {1373#unseeded} is VALID [2022-02-21 04:29:53,163 INFO L290 TraceCheckUtils]: 36: Hoare triple {1373#unseeded} assume { :end_inline_assume_abort_if_not } true;~p1_old~0 := ~nomsg~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~nomsg~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~nomsg~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~nomsg~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~nomsg~0;~p5_new~0 := ~nomsg~0;main_~i2~0#1 := 0; {1373#unseeded} is VALID [2022-02-21 04:29:53,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:29:53,179 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 04:29:53,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 04:29:53,189 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 04:29:53,416 INFO L290 TraceCheckUtils]: 0: Hoare triple {1376#(>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|)))} assume !!(main_~i2~0#1 < 10);assume { :begin_inline_node1 } true;havoc node1_#t~ite4#1, node1_~m1~0#1;havoc node1_~m1~0#1;node1_~m1~0#1 := ~nomsg~0; {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:29:53,416 INFO L290 TraceCheckUtils]: 1: Hoare triple {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume 0 != ~mode1~0 % 256;~r1~0 := (if (1 + ~r1~0) % 256 <= 127 then (1 + ~r1~0) % 256 else (1 + ~r1~0) % 256 - 256);node1_~m1~0#1 := ~p5_old~0;~p5_old~0 := ~nomsg~0; {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:29:53,417 INFO L290 TraceCheckUtils]: 2: Hoare triple {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(node1_~m1~0#1 != ~nomsg~0); {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:29:53,418 INFO L290 TraceCheckUtils]: 3: Hoare triple {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} ~mode1~0 := 0; {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:29:53,418 INFO L290 TraceCheckUtils]: 4: Hoare triple {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume { :end_inline_node1 } true;assume { :begin_inline_node2 } true;havoc node2_#t~ite5#1, node2_~m2~0#1;havoc node2_~m2~0#1;node2_~m2~0#1 := ~nomsg~0; {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:29:53,418 INFO L290 TraceCheckUtils]: 5: Hoare triple {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume 0 != ~mode2~0 % 256;node2_~m2~0#1 := ~p1_old~0;~p1_old~0 := ~nomsg~0; {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:29:53,419 INFO L290 TraceCheckUtils]: 6: Hoare triple {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(node2_~m2~0#1 != ~nomsg~0); {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:29:53,419 INFO L290 TraceCheckUtils]: 7: Hoare triple {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} ~mode2~0 := 0; {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:29:53,420 INFO L290 TraceCheckUtils]: 8: Hoare triple {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume { :end_inline_node2 } true;assume { :begin_inline_node3 } true;havoc node3_#t~ite6#1, node3_~m3~0#1;havoc node3_~m3~0#1;node3_~m3~0#1 := ~nomsg~0; {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:29:53,420 INFO L290 TraceCheckUtils]: 9: Hoare triple {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume 0 != ~mode3~0 % 256;node3_~m3~0#1 := ~p2_old~0;~p2_old~0 := ~nomsg~0; {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:29:53,420 INFO L290 TraceCheckUtils]: 10: Hoare triple {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(node3_~m3~0#1 != ~nomsg~0); {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:29:53,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} ~mode3~0 := 0; {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:29:53,421 INFO L290 TraceCheckUtils]: 12: Hoare triple {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume { :end_inline_node3 } true;assume { :begin_inline_node4 } true;havoc node4_#t~ite7#1, node4_~m4~0#1;havoc node4_~m4~0#1;node4_~m4~0#1 := ~nomsg~0; {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:29:53,421 INFO L290 TraceCheckUtils]: 13: Hoare triple {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume 0 != ~mode4~0 % 256;node4_~m4~0#1 := ~p3_old~0;~p3_old~0 := ~nomsg~0; {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:29:53,422 INFO L290 TraceCheckUtils]: 14: Hoare triple {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(node4_~m4~0#1 != ~nomsg~0); {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:29:53,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} ~mode4~0 := 0; {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:29:53,425 INFO L290 TraceCheckUtils]: 16: Hoare triple {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume { :end_inline_node4 } true;assume { :begin_inline_node5 } true;havoc node5_#t~ite8#1, node5_~m5~0#1;havoc node5_~m5~0#1;node5_~m5~0#1 := ~nomsg~0; {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:29:53,426 INFO L290 TraceCheckUtils]: 17: Hoare triple {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume 0 != ~mode5~0 % 256;node5_~m5~0#1 := ~p4_old~0;~p4_old~0 := ~nomsg~0; {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:29:53,426 INFO L290 TraceCheckUtils]: 18: Hoare triple {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(node5_~m5~0#1 != ~nomsg~0); {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:29:53,426 INFO L290 TraceCheckUtils]: 19: Hoare triple {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} ~mode5~0 := 0; {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:29:53,427 INFO L290 TraceCheckUtils]: 20: Hoare triple {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume { :end_inline_node5 } true;~p1_old~0 := ~p1_new~0;~p1_new~0 := ~nomsg~0;~p2_old~0 := ~p2_new~0;~p2_new~0 := ~nomsg~0;~p3_old~0 := ~p3_new~0;~p3_new~0 := ~nomsg~0;~p4_old~0 := ~p4_new~0;~p4_new~0 := ~nomsg~0;~p5_old~0 := ~p5_new~0;~p5_new~0 := ~nomsg~0;assume { :begin_inline_check } true;havoc check_#res#1;havoc check_~tmp~1#1;havoc check_~tmp~1#1; {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:29:53,427 INFO L290 TraceCheckUtils]: 21: Hoare triple {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0 <= 1; {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:29:53,428 INFO L290 TraceCheckUtils]: 22: Hoare triple {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(~r1~0 >= 5); {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:29:53,428 INFO L290 TraceCheckUtils]: 23: Hoare triple {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume 0 == ~st1~0 + ~st2~0 + ~st3~0 + ~st4~0 + ~st5~0; {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:29:53,429 INFO L290 TraceCheckUtils]: 24: Hoare triple {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume ~r1~0 < 5;check_~tmp~1#1 := 1; {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:29:53,429 INFO L290 TraceCheckUtils]: 25: Hoare triple {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} check_#res#1 := check_~tmp~1#1; {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:29:53,429 INFO L290 TraceCheckUtils]: 26: Hoare triple {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} main_#t~ret31#1 := check_#res#1;assume { :end_inline_check } true;main_~c1~0#1 := main_#t~ret31#1;havoc main_#t~ret31#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; {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:29:53,430 INFO L290 TraceCheckUtils]: 27: Hoare triple {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume !(0 == assert_~arg#1 % 256); {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} is VALID [2022-02-21 04:29:53,430 INFO L290 TraceCheckUtils]: 28: Hoare triple {1499#(and (>= oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|))) (< |ULTIMATE.start_main_~i2~0#1| 10))} assume { :end_inline_assert } true;main_#t~post32#1 := main_~i2~0#1;main_~i2~0#1 := 1 + main_#t~post32#1;havoc main_#t~post32#1; {1386#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ 19 (* (- 2) |ULTIMATE.start_main_~i2~0#1|)))))} is VALID [2022-02-21 04:29:53,431 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:29:53,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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:29:53,449 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:29:53,450 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 37 letters. Loop has 29 letters. [2022-02-21 04:29:53,451 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,453 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:29:53,454 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 131 states and 180 transitions. cyclomatic complexity: 50 Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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:29:53,582 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 131 states and 180 transitions. cyclomatic complexity: 50. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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 224 states and 323 transitions. Complement of second has 4 states. [2022-02-21 04:29:53,582 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:29:53,582 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:29:53,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 131 states and 180 transitions. cyclomatic complexity: 50 [2022-02-21 04:29:53,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:29:53,583 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:29:53,583 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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:29:53,586 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:29:53,586 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 04:29:53,586 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 04:29:53,586 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 224 states and 323 transitions. [2022-02-21 04:29:53,587 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:29:53,587 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:29:53,589 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 131 states and 180 transitions. cyclomatic complexity: 50 [2022-02-21 04:29:53,620 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 94 examples of accepted words. [2022-02-21 04:29:53,621 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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:29:53,622 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 04:29:53,622 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 04:29:53,622 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 224 states and 323 transitions. cyclomatic complexity: 100 [2022-02-21 04:29:53,622 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 224 states and 323 transitions. cyclomatic complexity: 100 [2022-02-21 04:29:53,622 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:29:53,623 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 04:29:53,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 37 letters. Loop has 29 letters. [2022-02-21 04:29:53,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 37 letters. Loop has 29 letters. [2022-02-21 04:29:53,623 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,623 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 37 letters. Loop has 29 letters. [2022-02-21 04:29:53,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,624 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:29:53,624 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:29:53,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 224 letters. Loop has 224 letters. [2022-02-21 04:29:53,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 224 letters. Loop has 224 letters. [2022-02-21 04:29:53,625 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,625 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 224 letters. Loop has 224 letters. [2022-02-21 04:29:53,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 131 letters. Loop has 131 letters. [2022-02-21 04:29:53,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 131 letters. Loop has 131 letters. [2022-02-21 04:29:53,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 131 letters. Loop has 131 letters. [2022-02-21 04:29:53,626 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,626 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:29:53,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 3 letters. Loop has 3 letters. [2022-02-21 04:29:53,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 51 letters. Loop has 29 letters. [2022-02-21 04:29:53,627 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,627 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 51 letters. Loop has 29 letters. [2022-02-21 04:29:53,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 51 letters. Loop has 29 letters. [2022-02-21 04:29:53,628 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,628 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 51 letters. Loop has 29 letters. [2022-02-21 04:29:53,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 86 letters. Loop has 31 letters. [2022-02-21 04:29:53,629 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,629 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 86 letters. Loop has 31 letters. [2022-02-21 04:29:53,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 86 letters. Loop has 31 letters. [2022-02-21 04:29:53,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 85 letters. Loop has 29 letters. [2022-02-21 04:29:53,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,630 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 85 letters. Loop has 29 letters. [2022-02-21 04:29:53,630 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 85 letters. Loop has 29 letters. [2022-02-21 04:29:53,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 62 letters. Loop has 29 letters. [2022-02-21 04:29:53,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,631 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,631 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 62 letters. Loop has 29 letters. [2022-02-21 04:29:53,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 40 letters. Loop has 29 letters. [2022-02-21 04:29:53,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 40 letters. Loop has 29 letters. [2022-02-21 04:29:53,632 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,632 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 40 letters. Loop has 29 letters. [2022-02-21 04:29:53,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 85 letters. Loop has 30 letters. [2022-02-21 04:29:53,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 85 letters. Loop has 30 letters. [2022-02-21 04:29:53,633 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,633 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 85 letters. Loop has 30 letters. [2022-02-21 04:29:53,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 80 letters. Loop has 29 letters. [2022-02-21 04:29:53,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 80 letters. Loop has 29 letters. [2022-02-21 04:29:53,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,634 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 80 letters. Loop has 29 letters. [2022-02-21 04:29:53,634 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 81 letters. Loop has 29 letters. [2022-02-21 04:29:53,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 81 letters. Loop has 29 letters. [2022-02-21 04:29:53,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 81 letters. Loop has 29 letters. [2022-02-21 04:29:53,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 62 letters. Loop has 29 letters. [2022-02-21 04:29:53,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 62 letters. Loop has 29 letters. [2022-02-21 04:29:53,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 65 letters. Loop has 29 letters. [2022-02-21 04:29:53,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 65 letters. Loop has 29 letters. [2022-02-21 04:29:53,637 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,637 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 42 letters. Loop has 29 letters. [2022-02-21 04:29:53,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 42 letters. Loop has 29 letters. [2022-02-21 04:29:53,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 42 letters. Loop has 29 letters. [2022-02-21 04:29:53,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,638 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 43 letters. Loop has 29 letters. [2022-02-21 04:29:53,638 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 43 letters. Loop has 29 letters. [2022-02-21 04:29:53,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 43 letters. Loop has 29 letters. [2022-02-21 04:29:53,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 43 letters. Loop has 29 letters. [2022-02-21 04:29:53,639 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,639 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 43 letters. Loop has 29 letters. [2022-02-21 04:29:53,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 43 letters. Loop has 29 letters. [2022-02-21 04:29:53,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 49 letters. Loop has 31 letters. [2022-02-21 04:29:53,640 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,640 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 49 letters. Loop has 31 letters. [2022-02-21 04:29:53,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 49 letters. Loop has 31 letters. [2022-02-21 04:29:53,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 44 letters. Loop has 30 letters. [2022-02-21 04:29:53,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,641 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 44 letters. Loop has 30 letters. [2022-02-21 04:29:53,641 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 44 letters. Loop has 30 letters. [2022-02-21 04:29:53,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 48 letters. Loop has 29 letters. [2022-02-21 04:29:53,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,642 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,642 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 48 letters. Loop has 29 letters. [2022-02-21 04:29:53,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 45 letters. Loop has 31 letters. [2022-02-21 04:29:53,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 45 letters. Loop has 31 letters. [2022-02-21 04:29:53,643 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,643 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 45 letters. Loop has 31 letters. [2022-02-21 04:29:53,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 83 letters. Loop has 29 letters. [2022-02-21 04:29:53,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 83 letters. Loop has 29 letters. [2022-02-21 04:29:53,644 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,644 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 83 letters. Loop has 29 letters. [2022-02-21 04:29:53,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 44 letters. Loop has 29 letters. [2022-02-21 04:29:53,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 44 letters. Loop has 29 letters. [2022-02-21 04:29:53,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 44 letters. Loop has 29 letters. [2022-02-21 04:29:53,645 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,645 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 41 letters. Loop has 31 letters. [2022-02-21 04:29:53,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 41 letters. Loop has 31 letters. [2022-02-21 04:29:53,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 41 letters. Loop has 31 letters. [2022-02-21 04:29:53,646 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,646 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 84 letters. Loop has 29 letters. [2022-02-21 04:29:53,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 84 letters. Loop has 29 letters. [2022-02-21 04:29:53,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 84 letters. Loop has 29 letters. [2022-02-21 04:29:53,647 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,647 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 84 letters. Loop has 29 letters. [2022-02-21 04:29:53,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 84 letters. Loop has 29 letters. [2022-02-21 04:29:53,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 84 letters. Loop has 29 letters. [2022-02-21 04:29:53,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,648 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 48 letters. Loop has 30 letters. [2022-02-21 04:29:53,648 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 48 letters. Loop has 30 letters. [2022-02-21 04:29:53,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 48 letters. Loop has 30 letters. [2022-02-21 04:29:53,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,649 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 40 letters. Loop has 30 letters. [2022-02-21 04:29:53,649 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 40 letters. Loop has 30 letters. [2022-02-21 04:29:53,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 40 letters. Loop has 30 letters. [2022-02-21 04:29:53,650 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,650 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 59 letters. Loop has 29 letters. [2022-02-21 04:29:53,656 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 59 letters. Loop has 29 letters. [2022-02-21 04:29:53,657 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,657 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 58 letters. Loop has 29 letters. [2022-02-21 04:29:53,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 58 letters. Loop has 29 letters. [2022-02-21 04:29:53,658 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,658 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 57 letters. Loop has 29 letters. [2022-02-21 04:29:53,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 57 letters. Loop has 29 letters. [2022-02-21 04:29:53,659 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,659 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 56 letters. Loop has 29 letters. [2022-02-21 04:29:53,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,660 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 56 letters. Loop has 29 letters. [2022-02-21 04:29:53,660 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 56 letters. Loop has 29 letters. [2022-02-21 04:29:53,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,661 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 56 letters. Loop has 29 letters. [2022-02-21 04:29:53,661 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 57 letters. Loop has 31 letters. [2022-02-21 04:29:53,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,662 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 57 letters. Loop has 31 letters. [2022-02-21 04:29:53,662 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 55 letters. Loop has 29 letters. [2022-02-21 04:29:53,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,663 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,663 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 55 letters. Loop has 29 letters. [2022-02-21 04:29:53,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 56 letters. Loop has 30 letters. [2022-02-21 04:29:53,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,664 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,664 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 56 letters. Loop has 30 letters. [2022-02-21 04:29:53,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 55 letters. Loop has 29 letters. [2022-02-21 04:29:53,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,665 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,665 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 55 letters. Loop has 29 letters. [2022-02-21 04:29:53,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 54 letters. Loop has 29 letters. [2022-02-21 04:29:53,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,666 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,666 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 54 letters. Loop has 29 letters. [2022-02-21 04:29:53,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 53 letters. Loop has 29 letters. [2022-02-21 04:29:53,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,667 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,667 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 53 letters. Loop has 29 letters. [2022-02-21 04:29:53,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 52 letters. Loop has 29 letters. [2022-02-21 04:29:53,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,668 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,668 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 52 letters. Loop has 29 letters. [2022-02-21 04:29:53,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 82 letters. Loop has 31 letters. [2022-02-21 04:29:53,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 82 letters. Loop has 31 letters. [2022-02-21 04:29:53,669 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,669 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 82 letters. Loop has 31 letters. [2022-02-21 04:29:53,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 80 letters. Loop has 29 letters. [2022-02-21 04:29:53,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,670 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 80 letters. Loop has 29 letters. [2022-02-21 04:29:53,670 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 80 letters. Loop has 29 letters. [2022-02-21 04:29:53,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 81 letters. Loop has 30 letters. [2022-02-21 04:29:53,671 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,671 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 81 letters. Loop has 30 letters. [2022-02-21 04:29:53,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 81 letters. Loop has 30 letters. [2022-02-21 04:29:53,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 79 letters. Loop has 29 letters. [2022-02-21 04:29:53,672 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,672 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 79 letters. Loop has 29 letters. [2022-02-21 04:29:53,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 79 letters. Loop has 29 letters. [2022-02-21 04:29:53,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 78 letters. Loop has 29 letters. [2022-02-21 04:29:53,673 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,673 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 78 letters. Loop has 29 letters. [2022-02-21 04:29:53,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 78 letters. Loop has 29 letters. [2022-02-21 04:29:53,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 77 letters. Loop has 29 letters. [2022-02-21 04:29:53,674 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,674 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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 29 letters. [2022-02-21 04:29:53,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 77 letters. Loop has 29 letters. [2022-02-21 04:29:53,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 77 letters. Loop has 29 letters. [2022-02-21 04:29:53,675 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,675 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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 29 letters. [2022-02-21 04:29:53,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 77 letters. Loop has 29 letters. [2022-02-21 04:29:53,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,676 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 76 letters. Loop has 29 letters. [2022-02-21 04:29:53,676 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 76 letters. Loop has 29 letters. [2022-02-21 04:29:53,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,677 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 78 letters. Loop has 31 letters. [2022-02-21 04:29:53,677 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 78 letters. Loop has 31 letters. [2022-02-21 04:29:53,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 78 letters. Loop has 31 letters. [2022-02-21 04:29:53,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,678 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 76 letters. Loop has 29 letters. [2022-02-21 04:29:53,678 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 76 letters. Loop has 29 letters. [2022-02-21 04:29:53,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,679 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 77 letters. Loop has 30 letters. [2022-02-21 04:29:53,679 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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 30 letters. [2022-02-21 04:29:53,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 77 letters. Loop has 30 letters. [2022-02-21 04:29:53,680 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,680 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 75 letters. Loop has 29 letters. [2022-02-21 04:29:53,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 75 letters. Loop has 29 letters. [2022-02-21 04:29:53,681 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,681 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 74 letters. Loop has 29 letters. [2022-02-21 04:29:53,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 74 letters. Loop has 29 letters. [2022-02-21 04:29:53,682 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,682 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 73 letters. Loop has 29 letters. [2022-02-21 04:29:53,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 73 letters. Loop has 29 letters. [2022-02-21 04:29:53,683 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,683 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 73 letters. Loop has 29 letters. [2022-02-21 04:29:53,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,684 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 73 letters. Loop has 29 letters. [2022-02-21 04:29:53,684 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 72 letters. Loop has 29 letters. [2022-02-21 04:29:53,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,685 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 72 letters. Loop has 29 letters. [2022-02-21 04:29:53,685 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 74 letters. Loop has 31 letters. [2022-02-21 04:29:53,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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 31 letters. [2022-02-21 04:29:53,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,686 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 74 letters. Loop has 31 letters. [2022-02-21 04:29:53,686 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 72 letters. Loop has 29 letters. [2022-02-21 04:29:53,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,687 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 72 letters. Loop has 29 letters. [2022-02-21 04:29:53,687 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 73 letters. Loop has 30 letters. [2022-02-21 04:29:53,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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 30 letters. [2022-02-21 04:29:53,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,688 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 73 letters. Loop has 30 letters. [2022-02-21 04:29:53,688 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 71 letters. Loop has 29 letters. [2022-02-21 04:29:53,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,689 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 71 letters. Loop has 29 letters. [2022-02-21 04:29:53,689 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 70 letters. Loop has 29 letters. [2022-02-21 04:29:53,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,690 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 70 letters. Loop has 29 letters. [2022-02-21 04:29:53,690 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 69 letters. Loop has 29 letters. [2022-02-21 04:29:53,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,691 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 69 letters. Loop has 29 letters. [2022-02-21 04:29:53,691 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 68 letters. Loop has 29 letters. [2022-02-21 04:29:53,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,692 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,692 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 68 letters. Loop has 29 letters. [2022-02-21 04:29:53,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 67 letters. Loop has 29 letters. [2022-02-21 04:29:53,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,693 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,693 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 67 letters. Loop has 29 letters. [2022-02-21 04:29:53,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 66 letters. Loop has 29 letters. [2022-02-21 04:29:53,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,694 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,694 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 66 letters. Loop has 29 letters. [2022-02-21 04:29:53,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 63 letters. Loop has 29 letters. [2022-02-21 04:29:53,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,695 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,695 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 63 letters. Loop has 29 letters. [2022-02-21 04:29:53,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 65 letters. Loop has 29 letters. [2022-02-21 04:29:53,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,696 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,696 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 65 letters. Loop has 29 letters. [2022-02-21 04:29:53,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 64 letters. Loop has 29 letters. [2022-02-21 04:29:53,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,697 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,697 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 64 letters. Loop has 29 letters. [2022-02-21 04:29:53,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 64 letters. Loop has 29 letters. [2022-02-21 04:29:53,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,698 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,698 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 64 letters. Loop has 29 letters. [2022-02-21 04:29:53,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 63 letters. Loop has 29 letters. [2022-02-21 04:29:53,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,699 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,699 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 63 letters. Loop has 29 letters. [2022-02-21 04:29:53,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 40 letters. Loop has 29 letters. [2022-02-21 04:29:53,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 40 letters. Loop has 29 letters. [2022-02-21 04:29:53,700 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,700 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 40 letters. Loop has 29 letters. [2022-02-21 04:29:53,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 41 letters. Loop has 29 letters. [2022-02-21 04:29:53,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 41 letters. Loop has 29 letters. [2022-02-21 04:29:53,701 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,701 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 41 letters. Loop has 29 letters. [2022-02-21 04:29:53,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 38 letters. Loop has 29 letters. [2022-02-21 04:29:53,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 38 letters. Loop has 29 letters. [2022-02-21 04:29:53,702 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,702 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 38 letters. Loop has 29 letters. [2022-02-21 04:29:53,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 39 letters. Loop has 29 letters. [2022-02-21 04:29:53,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 39 letters. Loop has 29 letters. [2022-02-21 04:29:53,703 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,703 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 39 letters. Loop has 29 letters. [2022-02-21 04:29:53,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 39 letters. Loop has 29 letters. [2022-02-21 04:29:53,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 39 letters. Loop has 29 letters. [2022-02-21 04:29:53,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,704 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 39 letters. Loop has 29 letters. [2022-02-21 04:29:53,704 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 52 letters. Loop has 30 letters. [2022-02-21 04:29:53,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,705 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 52 letters. Loop has 30 letters. [2022-02-21 04:29:53,705 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 52 letters. Loop has 29 letters. [2022-02-21 04:29:53,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 52 letters. Loop has 29 letters. [2022-02-21 04:29:53,706 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,706 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 53 letters. Loop has 31 letters. [2022-02-21 04:29:53,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 53 letters. Loop has 31 letters. [2022-02-21 04:29:53,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 53 letters. Loop has 31 letters. [2022-02-21 04:29:53,707 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,707 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 81 letters. Loop has 29 letters. [2022-02-21 04:29:53,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 81 letters. Loop has 29 letters. [2022-02-21 04:29:53,708 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,708 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 81 letters. Loop has 29 letters. [2022-02-21 04:29:53,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 82 letters. Loop has 29 letters. [2022-02-21 04:29:53,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 82 letters. Loop has 29 letters. [2022-02-21 04:29:53,709 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,709 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 82 letters. Loop has 29 letters. [2022-02-21 04:29:53,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 87 letters. Loop has 29 letters. [2022-02-21 04:29:53,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 87 letters. Loop has 29 letters. [2022-02-21 04:29:53,710 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,710 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 87 letters. Loop has 29 letters. [2022-02-21 04:29:53,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 88 letters. Loop has 29 letters. [2022-02-21 04:29:53,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 88 letters. Loop has 29 letters. [2022-02-21 04:29:53,711 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,711 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 88 letters. Loop has 29 letters. [2022-02-21 04:29:53,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 60 letters. Loop has 29 letters. [2022-02-21 04:29:53,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,712 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,712 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 60 letters. Loop has 29 letters. [2022-02-21 04:29:53,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 61 letters. Loop has 29 letters. [2022-02-21 04:29:53,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,713 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,713 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 61 letters. Loop has 29 letters. [2022-02-21 04:29:53,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 37 letters. Loop has 29 letters. [2022-02-21 04:29:53,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 37 letters. Loop has 29 letters. [2022-02-21 04:29:53,714 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,714 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 37 letters. Loop has 29 letters. [2022-02-21 04:29:53,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 46 letters. Loop has 29 letters. [2022-02-21 04:29:53,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,715 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 46 letters. Loop has 29 letters. [2022-02-21 04:29:53,715 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 46 letters. Loop has 29 letters. [2022-02-21 04:29:53,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 47 letters. Loop has 29 letters. [2022-02-21 04:29:53,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 47 letters. Loop has 29 letters. [2022-02-21 04:29:53,716 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,716 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 47 letters. Loop has 29 letters. [2022-02-21 04:29:53,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 47 letters. Loop has 29 letters. [2022-02-21 04:29:53,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 47 letters. Loop has 29 letters. [2022-02-21 04:29:53,717 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,717 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 47 letters. Loop has 29 letters. [2022-02-21 04:29:53,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 85 letters. Loop has 29 letters. [2022-02-21 04:29:53,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 85 letters. Loop has 29 letters. [2022-02-21 04:29:53,718 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,718 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 85 letters. Loop has 29 letters. [2022-02-21 04:29:53,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 86 letters. Loop has 29 letters. [2022-02-21 04:29:53,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 86 letters. Loop has 29 letters. [2022-02-21 04:29:53,719 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,719 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 86 letters. Loop has 29 letters. [2022-02-21 04:29:53,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 48 letters. Loop has 29 letters. [2022-02-21 04:29:53,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,720 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,720 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 48 letters. Loop has 29 letters. [2022-02-21 04:29:53,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 49 letters. Loop has 29 letters. [2022-02-21 04:29:53,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,721 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,721 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 49 letters. Loop has 29 letters. [2022-02-21 04:29:53,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 44 letters. Loop has 29 letters. [2022-02-21 04:29:53,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 44 letters. Loop has 29 letters. [2022-02-21 04:29:53,722 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,722 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 44 letters. Loop has 29 letters. [2022-02-21 04:29:53,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 45 letters. Loop has 29 letters. [2022-02-21 04:29:53,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 45 letters. Loop has 29 letters. [2022-02-21 04:29:53,723 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,723 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 45 letters. Loop has 29 letters. [2022-02-21 04:29:53,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 60 letters. Loop has 29 letters. [2022-02-21 04:29:53,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,724 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 60 letters. Loop has 29 letters. [2022-02-21 04:29:53,724 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 61 letters. Loop has 29 letters. [2022-02-21 04:29:53,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,725 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 61 letters. Loop has 29 letters. [2022-02-21 04:29:53,725 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 50 letters. Loop has 29 letters. [2022-02-21 04:29:53,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 50 letters. Loop has 29 letters. [2022-02-21 04:29:53,726 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,726 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 131 states and 180 transitions. cyclomatic complexity: 50 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:29:53,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 0 states 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:29:53,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,727 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 224 states and 323 transitions. cyclomatic complexity: 100 Stem has 1 letters. Loop has 2 letters. [2022-02-21 04:29:53,727 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,727 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 04:29:53,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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:29:53,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2022-02-21 04:29:53,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 114 transitions. Stem has 37 letters. Loop has 29 letters. [2022-02-21 04:29:53,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 114 transitions. Stem has 66 letters. Loop has 29 letters. [2022-02-21 04:29:53,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,729 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 114 transitions. Stem has 37 letters. Loop has 58 letters. [2022-02-21 04:29:53,729 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 04:29:53,730 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 224 states and 323 transitions. cyclomatic complexity: 100 [2022-02-21 04:29:53,735 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:29:53,735 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 224 states to 0 states and 0 transitions. [2022-02-21 04:29:53,735 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:29:53,735 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:29:53,735 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:29:53,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:29:53,735 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:29:53,736 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:29:53,736 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 04:29:53,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 04:29:53,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 04:29:53,736 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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:29:53,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 04:29:53,737 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 04:29:53,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 04:29:53,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 22.0) internal successors, (66), 3 states have internal predecessors, (66), 0 states have call successors, (0), 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:29:53,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 04:29:53,778 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-02-21 04:29:53,778 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:29:53,778 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 04:29:53,778 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 04:29:53,778 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 04:29:53,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 04:29:53,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 04:29:53,778 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:29:53,778 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:29:53,778 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 04:29:53,779 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 04:29:53,779 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 04:29:53,779 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 04:29:53,779 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 04:29:53,783 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 04:29:53 BoogieIcfgContainer [2022-02-21 04:29:53,783 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 04:29:53,784 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 04:29:53,784 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 04:29:53,784 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 04:29:53,784 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 04:29:48" (3/4) ... [2022-02-21 04:29:53,786 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 04:29:53,786 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 04:29:53,787 INFO L158 Benchmark]: Toolchain (without parser) took 6405.34ms. Allocated memory was 115.3MB in the beginning and 201.3MB in the end (delta: 86.0MB). Free memory was 82.9MB in the beginning and 131.2MB in the end (delta: -48.4MB). Peak memory consumption was 37.3MB. Max. memory is 16.1GB. [2022-02-21 04:29:53,787 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 81.8MB. Free memory was 40.5MB in the beginning and 40.5MB in the end (delta: 39.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:29:53,788 INFO L158 Benchmark]: CACSL2BoogieTranslator took 279.80ms. Allocated memory is still 115.3MB. Free memory was 82.9MB in the beginning and 86.3MB in the end (delta: -3.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-21 04:29:53,788 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.59ms. Allocated memory is still 115.3MB. Free memory was 86.3MB in the beginning and 82.7MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 04:29:53,788 INFO L158 Benchmark]: Boogie Preprocessor took 21.47ms. Allocated memory is still 115.3MB. Free memory was 82.7MB in the beginning and 81.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:29:53,788 INFO L158 Benchmark]: RCFGBuilder took 546.58ms. Allocated memory is still 115.3MB. Free memory was 81.2MB in the beginning and 58.4MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2022-02-21 04:29:53,789 INFO L158 Benchmark]: BuchiAutomizer took 5488.50ms. Allocated memory was 115.3MB in the beginning and 201.3MB in the end (delta: 86.0MB). Free memory was 58.2MB in the beginning and 131.2MB in the end (delta: -73.1MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. [2022-02-21 04:29:53,789 INFO L158 Benchmark]: Witness Printer took 2.33ms. Allocated memory is still 201.3MB. Free memory is still 131.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 04:29:53,790 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17ms. Allocated memory is still 81.8MB. Free memory was 40.5MB in the beginning and 40.5MB in the end (delta: 39.8kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 279.80ms. Allocated memory is still 115.3MB. Free memory was 82.9MB in the beginning and 86.3MB in the end (delta: -3.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.59ms. Allocated memory is still 115.3MB. Free memory was 86.3MB in the beginning and 82.7MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 21.47ms. Allocated memory is still 115.3MB. Free memory was 82.7MB in the beginning and 81.2MB in the end (delta: 1.5MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 546.58ms. Allocated memory is still 115.3MB. Free memory was 81.2MB in the beginning and 58.4MB in the end (delta: 22.8MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * BuchiAutomizer took 5488.50ms. Allocated memory was 115.3MB in the beginning and 201.3MB in the end (delta: 86.0MB). Free memory was 58.2MB in the beginning and 131.2MB in the end (delta: -73.1MB). Peak memory consumption was 15.0MB. Max. memory is 16.1GB. * Witness Printer took 2.33ms. Allocated memory is still 201.3MB. Free memory is still 131.2MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 5 terminating modules (4 trivial, 1 deterministic, 0 nondeterministic). One deterministic module has affine ranking function 19 + -2 * i2 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 5.4s and 5 iterations. TraceHistogramMax:1. Analysis of lassos took 3.7s. Construction of modules took 0.0s. Büchi inclusion checks took 1.4s. Highest rank in rank-based complementation 3. Minimization of det autom 5. Minimization of nondet autom 0. Automata minimization 0.1s AutomataMinimizationTime, 3 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 131 states and ocurred in iteration 3. Nontrivial modules had stage [1, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 231 SdHoareTripleChecker+Valid, 0.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 231 mSDsluCounter, 1487 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 937 mSDsCounter, 37 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 36 IncrementalHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 37 mSolverCounterUnsat, 550 mSDtfsCounter, 36 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI2 SFLT0 conc0 concLT1 SILN0 SILU0 SILI1 SILT0 lasso0 LassoPreprocessingBenchmarks: Lassos: inital167 mio100 ax100 hnf100 lsp37 ukn100 mio100 lsp100 div104 bol100 ite100 ukn100 eq218 hnf85 smp100 dnf100 smp100 tf101 neg100 sie100 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 14ms VariablesStem: 0 VariablesLoop: 4 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 0 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 1 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.2s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 04:29:53,817 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