./Ultimate.py --spec ../sv-benchmarks/c/properties/termination.prp --file ../sv-benchmarks/c/bitvector/soft_float_2a.c.cil.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/bitvector/soft_float_2a.c.cil.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 f330893f1140a32f6e6dacd6cc5115391759545d59ea17334f6f3b644ed5a51c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 03:37:13,490 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 03:37:13,492 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 03:37:13,525 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 03:37:13,526 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 03:37:13,529 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 03:37:13,531 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 03:37:13,533 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 03:37:13,535 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 03:37:13,539 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 03:37:13,540 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 03:37:13,541 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 03:37:13,541 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 03:37:13,543 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 03:37:13,544 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 03:37:13,545 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 03:37:13,546 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 03:37:13,547 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 03:37:13,550 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 03:37:13,554 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 03:37:13,555 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 03:37:13,555 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 03:37:13,557 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 03:37:13,557 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 03:37:13,559 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 03:37:13,559 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 03:37:13,559 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 03:37:13,561 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 03:37:13,561 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 03:37:13,561 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 03:37:13,562 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 03:37:13,562 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 03:37:13,563 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 03:37:13,564 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 03:37:13,565 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 03:37:13,565 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 03:37:13,566 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 03:37:13,567 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 03:37:13,567 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 03:37:13,568 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 03:37:13,568 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 03:37:13,570 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Termination-32bit-Automizer_Default.epf [2022-02-21 03:37:13,593 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 03:37:13,594 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 03:37:13,594 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 03:37:13,594 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 03:37:13,595 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 03:37:13,595 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 03:37:13,595 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 03:37:13,596 INFO L136 SettingsManager]: Preferences of BuchiAutomizer differ from their defaults: [2022-02-21 03:37:13,596 INFO L138 SettingsManager]: * NCSB implementation=INTSET_LAZY3 [2022-02-21 03:37:13,596 INFO L138 SettingsManager]: * Use old map elimination=false [2022-02-21 03:37:13,596 INFO L138 SettingsManager]: * Use external solver (rank synthesis)=false [2022-02-21 03:37:13,597 INFO L138 SettingsManager]: * Use only trivial implications for array writes=true [2022-02-21 03:37:13,597 INFO L138 SettingsManager]: * Rank analysis=LINEAR_WITH_GUESSES [2022-02-21 03:37:13,597 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 03:37:13,597 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 03:37:13,597 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 03:37:13,597 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 03:37:13,597 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 03:37:13,598 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 03:37:13,598 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=ASSUME [2022-02-21 03:37:13,598 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=ASSUME [2022-02-21 03:37:13,598 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=ASSUME [2022-02-21 03:37:13,598 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 03:37:13,598 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-21 03:37:13,598 INFO L138 SettingsManager]: * Assume nondeterminstic values are in range=false [2022-02-21 03:37:13,599 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 03:37:13,599 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=ASSUME [2022-02-21 03:37:13,599 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 03:37:13,599 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 03:37:13,599 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 03:37:13,599 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 03:37:13,600 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-02-21 03:37:13,600 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 -> f330893f1140a32f6e6dacd6cc5115391759545d59ea17334f6f3b644ed5a51c [2022-02-21 03:37:13,799 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 03:37:13,817 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 03:37:13,818 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 03:37:13,819 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 03:37:13,820 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 03:37:13,820 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c [2022-02-21 03:37:13,864 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7af43212e/a1e212b6bb94406eb264e9d45691c923/FLAG5448f30f2 [2022-02-21 03:37:14,231 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 03:37:14,232 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/bitvector/soft_float_2a.c.cil.c [2022-02-21 03:37:14,240 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7af43212e/a1e212b6bb94406eb264e9d45691c923/FLAG5448f30f2 [2022-02-21 03:37:14,249 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7af43212e/a1e212b6bb94406eb264e9d45691c923 [2022-02-21 03:37:14,251 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 03:37:14,252 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 03:37:14,255 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 03:37:14,255 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 03:37:14,257 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 03:37:14,259 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:37:14" (1/1) ... [2022-02-21 03:37:14,259 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1bad36b5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:14, skipping insertion in model container [2022-02-21 03:37:14,260 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 03:37:14" (1/1) ... [2022-02-21 03:37:14,264 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 03:37:14,292 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 03:37:14,389 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/bitvector/soft_float_2a.c.cil.c[728,741] [2022-02-21 03:37:14,440 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:37:14,446 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 03:37:14,453 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/bitvector/soft_float_2a.c.cil.c[728,741] [2022-02-21 03:37:14,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 03:37:14,501 INFO L208 MainTranslator]: Completed translation [2022-02-21 03:37:14,507 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:14 WrapperNode [2022-02-21 03:37:14,507 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 03:37:14,508 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 03:37:14,508 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 03:37:14,508 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 03:37:14,513 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:14" (1/1) ... [2022-02-21 03:37:14,525 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:14" (1/1) ... [2022-02-21 03:37:14,565 INFO L137 Inliner]: procedures = 17, calls = 15, calls flagged for inlining = 10, calls inlined = 8, statements flattened = 430 [2022-02-21 03:37:14,565 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 03:37:14,566 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 03:37:14,566 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 03:37:14,566 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 03:37:14,572 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:14" (1/1) ... [2022-02-21 03:37:14,572 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:14" (1/1) ... [2022-02-21 03:37:14,575 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:14" (1/1) ... [2022-02-21 03:37:14,575 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:14" (1/1) ... [2022-02-21 03:37:14,582 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:14" (1/1) ... [2022-02-21 03:37:14,587 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:14" (1/1) ... [2022-02-21 03:37:14,589 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:14" (1/1) ... [2022-02-21 03:37:14,592 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 03:37:14,593 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 03:37:14,593 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 03:37:14,593 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 03:37:14,594 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:14" (1/1) ... [2022-02-21 03:37:14,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:14,622 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:14,652 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 03:37:14,671 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 03:37:14,684 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 03:37:14,684 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 03:37:14,684 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 03:37:14,687 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 03:37:14,741 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 03:37:14,743 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 03:37:15,325 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 03:37:15,335 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 03:37:15,335 INFO L299 CfgBuilder]: Removed 8 assume(true) statements. [2022-02-21 03:37:15,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:37:15 BoogieIcfgContainer [2022-02-21 03:37:15,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 03:37:15,340 INFO L113 PluginConnector]: ------------------------BuchiAutomizer---------------------------- [2022-02-21 03:37:15,340 INFO L271 PluginConnector]: Initializing BuchiAutomizer... [2022-02-21 03:37:15,342 INFO L275 PluginConnector]: BuchiAutomizer initialized [2022-02-21 03:37:15,343 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:37:15,343 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "CDTParser AST 21.02 03:37:14" (1/3) ... [2022-02-21 03:37:15,344 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@587eabda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:37:15, skipping insertion in model container [2022-02-21 03:37:15,344 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:37:15,344 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 03:37:14" (2/3) ... [2022-02-21 03:37:15,345 INFO L205 PluginConnector]: Invalid model from BuchiAutomizer for observer de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer.BuchiAutomizerObserver@587eabda and model type de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer AST 21.02 03:37:15, skipping insertion in model container [2022-02-21 03:37:15,345 INFO L99 BuchiAutomizer]: Safety of program was proven or not checked, starting termination analysis [2022-02-21 03:37:15,345 INFO L185 PluginConnector]: Executing the observer BuchiAutomizerObserver from plugin BuchiAutomizer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:37:15" (3/3) ... [2022-02-21 03:37:15,349 INFO L388 chiAutomizerObserver]: Analyzing ICFG soft_float_2a.c.cil.c [2022-02-21 03:37:15,389 INFO L359 BuchiCegarLoop]: Interprodecural is true [2022-02-21 03:37:15,389 INFO L360 BuchiCegarLoop]: Hoare is false [2022-02-21 03:37:15,389 INFO L361 BuchiCegarLoop]: Compute interpolants for ForwardPredicates [2022-02-21 03:37:15,389 INFO L362 BuchiCegarLoop]: Backedges is STRAIGHT_LINE [2022-02-21 03:37:15,389 INFO L363 BuchiCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2022-02-21 03:37:15,389 INFO L364 BuchiCegarLoop]: Difference is false [2022-02-21 03:37:15,390 INFO L365 BuchiCegarLoop]: Minimize is MINIMIZE_SEVPA [2022-02-21 03:37:15,390 INFO L368 BuchiCegarLoop]: ======== Iteration 0==of CEGAR loop == BuchiCegarLoop======== [2022-02-21 03:37:15,416 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 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 03:37:15,458 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 24 [2022-02-21 03:37:15,458 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:15,458 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:15,463 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:37:15,463 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:37:15,463 INFO L425 BuchiCegarLoop]: ======== Iteration 1============ [2022-02-21 03:37:15,465 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 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 03:37:15,482 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 24 [2022-02-21 03:37:15,482 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:15,482 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:15,483 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1] [2022-02-21 03:37:15,483 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:37:15,487 INFO L791 eck$LassoCheckResult]: Stem: 115#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(22, 2);call #Ultimate.allocInit(12, 3); 46#L-1true assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 88#L29true assume !(0 == base2flt_~m#1 % 4294967296); 112#L35true assume !(base2flt_~m#1 % 4294967296 < 16777216); 61#L57-2true [2022-02-21 03:37:15,488 INFO L793 eck$LassoCheckResult]: Loop: 61#L57-2true assume !false; 44#L58true assume base2flt_~m#1 % 4294967296 >= 33554432; 101#L59true assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 / 2; 61#L57-2true [2022-02-21 03:37:15,491 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:15,491 INFO L85 PathProgramCache]: Analyzing trace with hash 925696, now seen corresponding path program 1 times [2022-02-21 03:37:15,497 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:15,497 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993078288] [2022-02-21 03:37:15,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:15,498 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:15,652 INFO L290 TraceCheckUtils]: 0: Hoare triple {136#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(22, 2);call #Ultimate.allocInit(12, 3); {136#true} is VALID [2022-02-21 03:37:15,656 INFO L290 TraceCheckUtils]: 1: Hoare triple {136#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {138#(= |ULTIMATE.start_base2flt_~m#1| 0)} is VALID [2022-02-21 03:37:15,656 INFO L290 TraceCheckUtils]: 2: Hoare triple {138#(= |ULTIMATE.start_base2flt_~m#1| 0)} assume !(0 == base2flt_~m#1 % 4294967296); {138#(= |ULTIMATE.start_base2flt_~m#1| 0)} is VALID [2022-02-21 03:37:15,657 INFO L290 TraceCheckUtils]: 3: Hoare triple {138#(= |ULTIMATE.start_base2flt_~m#1| 0)} assume !(base2flt_~m#1 % 4294967296 < 16777216); {137#false} is VALID [2022-02-21 03:37:15,658 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 03:37:15,658 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:37:15,659 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993078288] [2022-02-21 03:37:15,659 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993078288] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:37:15,660 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:37:15,660 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:37:15,661 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [266916471] [2022-02-21 03:37:15,662 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:37:15,665 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:37:15,667 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:15,667 INFO L85 PathProgramCache]: Analyzing trace with hash 74612, now seen corresponding path program 1 times [2022-02-21 03:37:15,668 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:15,668 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1759495844] [2022-02-21 03:37:15,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:15,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:15,681 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:15,682 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:15,697 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:15,712 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:15,744 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:15,744 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:15,744 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:15,744 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:15,744 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:37:15,745 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:15,745 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:15,745 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:15,745 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration1_Loop [2022-02-21 03:37:15,745 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:15,746 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:15,756 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 03:37:15,764 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 03:37:15,868 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:15,869 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:37:15,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:15,871 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:15,904 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 03:37:15,911 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:37:15,911 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:15,911 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 03:37:15,937 INFO L437 LassoAnalysis]: Proved nontermination for one component. [2022-02-21 03:37:15,937 INFO L440 LassoAnalysis]: Non-Termination argument consisting of: Initial state: {ULTIMATE.start_base2flt_~m#1=-1} Honda state: {ULTIMATE.start_base2flt_~m#1=-1} Generalized eigenvectors: [] Lambdas: [] Nus: [] [2022-02-21 03:37:15,941 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (2)] Ended with exit code 0 [2022-02-21 03:37:15,941 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:15,941 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:15,942 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 03:37:15,955 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 03:37:15,957 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:37:15,957 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:15,992 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (3)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:15,992 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:15,992 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:15,993 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 03:37:15,994 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 03:37:15,996 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:37:15,996 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:16,035 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:37:16,046 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 03:37:16,046 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:16,046 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:16,047 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:16,047 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:16,047 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:37:16,047 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:16,047 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:16,047 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:16,047 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration1_Loop [2022-02-21 03:37:16,047 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:16,047 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:16,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 03:37:16,054 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 03:37:16,195 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:16,198 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:37:16,199 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:16,199 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:16,200 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 03:37:16,226 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:37:16,233 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:16,233 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:16,233 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:16,233 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:16,233 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:16,235 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 03:37:16,236 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:16,236 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:16,251 INFO L527 LassoAnalysis]: Proving termination failed for this template and these settings. [2022-02-21 03:37:16,269 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 03:37:16,270 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:16,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:16,272 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 03:37:16,291 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 03:37:16,296 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 03:37:16,322 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:16,322 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:16,322 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:16,322 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:16,322 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:16,323 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:16,323 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:16,340 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:37:16,343 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:37:16,343 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:37:16,344 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:16,344 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:16,346 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 03:37:16,384 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:37:16,384 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:37:16,384 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:37:16,384 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = -2*ULTIMATE.start_base2flt_~e#1 + 253 Supporting invariants [] [2022-02-21 03:37:16,399 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 03:37:16,402 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 03:37:16,416 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:37:16,422 INFO L390 LassoCheck]: Loop: "assume !false;" "assume base2flt_~m#1 % 4294967296 >= 33554432;" "assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 / 2;" [2022-02-21 03:37:16,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:16,448 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:16,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:16,465 INFO L263 TraceCheckSpWp]: Trace formula consists of 35 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:37:16,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:16,482 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:16,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {141#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(22, 2);call #Ultimate.allocInit(12, 3); {141#unseeded} is VALID [2022-02-21 03:37:16,493 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {141#unseeded} is VALID [2022-02-21 03:37:16,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {141#unseeded} assume !(0 == base2flt_~m#1 % 4294967296); {141#unseeded} is VALID [2022-02-21 03:37:16,494 INFO L290 TraceCheckUtils]: 3: Hoare triple {141#unseeded} assume !(base2flt_~m#1 % 4294967296 < 16777216); {141#unseeded} is VALID [2022-02-21 03:37:16,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:16,501 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:37:16,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:16,506 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:16,516 INFO L290 TraceCheckUtils]: 0: Hoare triple {144#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume !false; {144#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} is VALID [2022-02-21 03:37:16,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {144#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume base2flt_~m#1 % 4294967296 >= 33554432; {144#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} is VALID [2022-02-21 03:37:16,518 INFO L290 TraceCheckUtils]: 2: Hoare triple {144#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 / 2; {154#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))))} is VALID [2022-02-21 03:37:16,519 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 03:37:16,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 03:37:16,554 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 03:37:16,556 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:16,557 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,560 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:37:16,562 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 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 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 03:37:16,820 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 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 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Result 399 states and 720 transitions. Complement of second has 6 states. [2022-02-21 03:37:16,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: Buchi interpolant automaton has 4 states 1 stem states 1 non-accepting loop states 1 accepting loop states [2022-02-21 03:37:16,821 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:16,822 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 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 03:37:16,832 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 24 [2022-02-21 03:37:16,832 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:16,832 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:16,832 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 03:37:16,839 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:37:16,839 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:16,839 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:16,840 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 399 states and 720 transitions. [2022-02-21 03:37:16,844 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 39 [2022-02-21 03:37:16,844 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:16,844 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:16,847 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 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 03:37:16,852 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 24 [2022-02-21 03:37:16,859 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 24 examples of accepted words. [2022-02-21 03:37:16,859 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 03:37:16,864 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 3 [2022-02-21 03:37:16,864 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 2 examples of accepted words. [2022-02-21 03:37:16,864 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 399 states and 720 transitions. cyclomatic complexity: 341 [2022-02-21 03:37:16,871 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 39 examples of accepted words. [2022-02-21 03:37:16,871 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:16,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:16,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:16,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states 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 1 letters. [2022-02-21 03:37:16,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:37:16,872 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,872 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:37:16,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:16,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:16,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,873 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:16,873 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,874 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 399 letters. Loop has 399 letters. [2022-02-21 03:37:16,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 399 letters. Loop has 399 letters. [2022-02-21 03:37:16,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,875 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 399 letters. Loop has 399 letters. [2022-02-21 03:37:16,875 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 132 letters. Loop has 132 letters. [2022-02-21 03:37:16,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,876 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 132 letters. Loop has 132 letters. [2022-02-21 03:37:16,876 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,877 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 132 letters. Loop has 132 letters. [2022-02-21 03:37:16,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:37:16,879 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,879 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:37:16,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 4 letters. Loop has 4 letters. [2022-02-21 03:37:16,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,880 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:16,880 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:16,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:16,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:16,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:16,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:16,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:16,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:16,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:16,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:16,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:16,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:16,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:16,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:16,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:16,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:16,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:16,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:16,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:16,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:16,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:16,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:16,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:16,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:16,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:16,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:16,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:16,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:16,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:16,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:16,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:16,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:16,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:16,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:16,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:16,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:16,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:16,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:16,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:16,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:16,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:16,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:16,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:16,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:16,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:16,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:16,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:16,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:16,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:16,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:16,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:16,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:16,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:16,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:16,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:37:16,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:37:16,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:37:16,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:37:16,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:37:16,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:37:16,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:16,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:16,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:16,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:37:16,902 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,902 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:37:16,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:37:16,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:37:16,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:37:16,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:37:16,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:16,904 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,904 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:16,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:16,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states 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 1 letters. [2022-02-21 03:37:16,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:37:16,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,905 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 1 letters. Loop has 1 letters. [2022-02-21 03:37:16,905 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states 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 03:37:16,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:16,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:16,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:16,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:16,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,906 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:16,906 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:16,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:16,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:16,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:16,907 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,907 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:16,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:16,908 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,908 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:16,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:16,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:16,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:16,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:16,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,909 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:16,909 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:16,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:16,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:16,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:16,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:16,910 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,910 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:16,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:16,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,911 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:16,911 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:16,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:16,912 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,912 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:16,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:16,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:16,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:16,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,913 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:16,913 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:16,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:16,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:16,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:16,914 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,914 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:16,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:16,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:16,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:16,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,915 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:16,915 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:16,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:16,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,919 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:16,919 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:16,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:16,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:16,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:16,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:16,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,921 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:16,921 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:16,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:16,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:16,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:16,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:16,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,922 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:16,922 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:37:16,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:37:16,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 5 letters. Loop has 3 letters. [2022-02-21 03:37:16,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:16,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:16,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,923 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:16,923 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:37:16,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:37:16,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,924 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 6 letters. Loop has 3 letters. [2022-02-21 03:37:16,924 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:16,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:16,956 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,956 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:16,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:16,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:16,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,957 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:16,957 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:16,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:16,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:16,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:16,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:16,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,958 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:16,958 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:16,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:16,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:16,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:16,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:16,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,959 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:16,959 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:16,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:16,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:16,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:16,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:16,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,960 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:16,960 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:16,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,961 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:16,961 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,962 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:16,962 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:16,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:16,964 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,964 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:16,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:16,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:16,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:16,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:16,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,965 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:16,965 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:16,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:16,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:16,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:16,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:16,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:16,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,966 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:16,966 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:16,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:16,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:16,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:16,967 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,967 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:16,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:16,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:16,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:16,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,968 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:16,968 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 132 states, 131 states have (on average 1.83206106870229) internal successors, (240), 131 states have internal predecessors, (240), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:16,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:16,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,969 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 399 states and 720 transitions. cyclomatic complexity: 341 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:16,969 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,969 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:16,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 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 03:37:16,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 478 transitions. [2022-02-21 03:37:16,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 478 transitions. Stem has 4 letters. Loop has 3 letters. [2022-02-21 03:37:16,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,977 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 478 transitions. Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:16,977 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,978 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 4 states and 478 transitions. Stem has 4 letters. Loop has 6 letters. [2022-02-21 03:37:16,978 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:16,978 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 399 states and 720 transitions. cyclomatic complexity: 341 [2022-02-21 03:37:16,981 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 03:37:16,996 INFO L131 ngComponentsAnalysis]: Automaton has 13 accepting balls. 39 [2022-02-21 03:37:17,003 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 399 states to 127 states and 216 transitions. [2022-02-21 03:37:17,003 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 123 [2022-02-21 03:37:17,004 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 124 [2022-02-21 03:37:17,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 127 states and 216 transitions. [2022-02-21 03:37:17,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:37:17,004 INFO L681 BuchiCegarLoop]: Abstraction has 127 states and 216 transitions. [2022-02-21 03:37:17,015 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states and 216 transitions. [2022-02-21 03:37:17,028 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 108. [2022-02-21 03:37:17,028 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:17,031 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states and 216 transitions. Second operand has 108 states, 108 states have (on average 1.7407407407407407) internal successors, (188), 107 states have internal predecessors, (188), 0 states have call successors, (0), 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 03:37:17,033 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states and 216 transitions. Second operand has 108 states, 108 states have (on average 1.7407407407407407) internal successors, (188), 107 states have internal predecessors, (188), 0 states have call successors, (0), 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 03:37:17,037 INFO L87 Difference]: Start difference. First operand 127 states and 216 transitions. Second operand has 108 states, 108 states have (on average 1.7407407407407407) internal successors, (188), 107 states have internal predecessors, (188), 0 states have call successors, (0), 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 03:37:17,039 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:17,046 INFO L93 Difference]: Finished difference Result 127 states and 216 transitions. [2022-02-21 03:37:17,047 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 216 transitions. [2022-02-21 03:37:17,048 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:17,048 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:17,048 INFO L74 IsIncluded]: Start isIncluded. First operand has 108 states, 108 states have (on average 1.7407407407407407) internal successors, (188), 107 states have internal predecessors, (188), 0 states have call successors, (0), 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 127 states and 216 transitions. [2022-02-21 03:37:17,048 INFO L87 Difference]: Start difference. First operand has 108 states, 108 states have (on average 1.7407407407407407) internal successors, (188), 107 states have internal predecessors, (188), 0 states have call successors, (0), 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 127 states and 216 transitions. [2022-02-21 03:37:17,049 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:17,058 INFO L93 Difference]: Finished difference Result 127 states and 216 transitions. [2022-02-21 03:37:17,058 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 216 transitions. [2022-02-21 03:37:17,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:17,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:17,059 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:17,059 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:17,060 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 108 states have (on average 1.7407407407407407) internal successors, (188), 107 states have internal predecessors, (188), 0 states have call successors, (0), 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 03:37:17,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 188 transitions. [2022-02-21 03:37:17,064 INFO L704 BuchiCegarLoop]: Abstraction has 108 states and 188 transitions. [2022-02-21 03:37:17,065 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:37:17,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:37:17,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:37:17,068 INFO L87 Difference]: Start difference. First operand 108 states and 188 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 03:37:17,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:17,207 INFO L93 Difference]: Finished difference Result 65 states and 100 transitions. [2022-02-21 03:37:17,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:37:17,207 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 03:37:17,210 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:37:17,210 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 65 states and 100 transitions. [2022-02-21 03:37:17,212 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2022-02-21 03:37:17,213 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 65 states to 65 states and 100 transitions. [2022-02-21 03:37:17,213 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 65 [2022-02-21 03:37:17,214 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 65 [2022-02-21 03:37:17,214 INFO L73 IsDeterministic]: Start isDeterministic. Operand 65 states and 100 transitions. [2022-02-21 03:37:17,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:37:17,214 INFO L681 BuchiCegarLoop]: Abstraction has 65 states and 100 transitions. [2022-02-21 03:37:17,214 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states and 100 transitions. [2022-02-21 03:37:17,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2022-02-21 03:37:17,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:17,216 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states and 100 transitions. Second operand has 53 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 52 states have internal predecessors, (82), 0 states have call successors, (0), 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 03:37:17,216 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states and 100 transitions. Second operand has 53 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 52 states have internal predecessors, (82), 0 states have call successors, (0), 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 03:37:17,216 INFO L87 Difference]: Start difference. First operand 65 states and 100 transitions. Second operand has 53 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 52 states have internal predecessors, (82), 0 states have call successors, (0), 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 03:37:17,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:17,217 INFO L93 Difference]: Finished difference Result 65 states and 100 transitions. [2022-02-21 03:37:17,217 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 100 transitions. [2022-02-21 03:37:17,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:17,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:17,218 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 52 states have internal predecessors, (82), 0 states have call successors, (0), 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 65 states and 100 transitions. [2022-02-21 03:37:17,218 INFO L87 Difference]: Start difference. First operand has 53 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 52 states have internal predecessors, (82), 0 states have call successors, (0), 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 65 states and 100 transitions. [2022-02-21 03:37:17,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:17,219 INFO L93 Difference]: Finished difference Result 65 states and 100 transitions. [2022-02-21 03:37:17,219 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 100 transitions. [2022-02-21 03:37:17,219 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:17,219 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:17,219 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:17,219 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:17,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.5471698113207548) internal successors, (82), 52 states have internal predecessors, (82), 0 states have call successors, (0), 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 03:37:17,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 82 transitions. [2022-02-21 03:37:17,221 INFO L704 BuchiCegarLoop]: Abstraction has 53 states and 82 transitions. [2022-02-21 03:37:17,221 INFO L587 BuchiCegarLoop]: Abstraction has 53 states and 82 transitions. [2022-02-21 03:37:17,221 INFO L425 BuchiCegarLoop]: ======== Iteration 2============ [2022-02-21 03:37:17,221 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 82 transitions. [2022-02-21 03:37:17,221 INFO L131 ngComponentsAnalysis]: Automaton has 6 accepting balls. 18 [2022-02-21 03:37:17,221 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:17,221 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:17,221 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:37:17,221 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:37:17,221 INFO L791 eck$LassoCheckResult]: Stem: 1314#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(22, 2);call #Ultimate.allocInit(12, 3); 1308#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 1293#L29 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 1294#L79 base2flt_#res#1 := base2flt_~__retres4~0#1; 1272#L80 main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 1273#L29-1 assume !(0 == base2flt_~m#1 % 4294967296); 1309#L35-1 assume base2flt_~m#1 % 4294967296 < 16777216; 1297#L47-3 [2022-02-21 03:37:17,222 INFO L793 eck$LassoCheckResult]: Loop: 1297#L47-3 assume !false; 1289#L38-1 assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1; 1290#L47-2 assume base2flt_~m#1 % 4294967296 < 16777216; 1297#L47-3 [2022-02-21 03:37:17,222 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:17,222 INFO L85 PathProgramCache]: Analyzing trace with hash 1807920711, now seen corresponding path program 1 times [2022-02-21 03:37:17,222 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:17,222 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917313178] [2022-02-21 03:37:17,222 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:17,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:17,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:17,248 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:17,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:17,255 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:17,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:17,256 INFO L85 PathProgramCache]: Analyzing trace with hash 153118, now seen corresponding path program 1 times [2022-02-21 03:37:17,256 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:17,256 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1783230852] [2022-02-21 03:37:17,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:17,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:17,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:17,274 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:17,277 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:17,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:17,278 INFO L85 PathProgramCache]: Analyzing trace with hash 876132888, now seen corresponding path program 1 times [2022-02-21 03:37:17,278 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:17,278 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125287512] [2022-02-21 03:37:17,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:17,278 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:17,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:17,287 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:17,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:17,296 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:17,315 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:17,316 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:17,316 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:17,316 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:17,316 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:37:17,316 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:17,316 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:17,316 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:17,316 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration2_Loop [2022-02-21 03:37:17,316 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:17,316 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:17,316 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 03:37:17,320 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 03:37:17,378 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:17,378 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:37:17,378 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:17,378 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:17,379 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 03:37:17,390 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:37:17,390 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:17,398 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 03:37:17,424 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (8)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:17,424 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:17,425 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:17,426 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 03:37:17,426 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 03:37:17,428 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:37:17,428 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:17,456 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:37:17,459 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 03:37:17,459 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:17,459 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:17,459 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:17,459 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:17,459 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:37:17,459 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:17,459 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:17,459 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:17,459 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration2_Loop [2022-02-21 03:37:17,459 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:17,459 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:17,460 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 03:37:17,473 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:17,548 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:17,549 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:37:17,549 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:17,549 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:17,550 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:17,551 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Waiting until timeout for monitored process [2022-02-21 03:37:17,553 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:37:17,558 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:17,558 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:17,558 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:17,558 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:17,558 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:17,559 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:17,559 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:17,575 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:37:17,577 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:37:17,577 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:37:17,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:17,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:17,603 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:17,604 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Waiting until timeout for monitored process [2022-02-21 03:37:17,605 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:37:17,605 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:37:17,605 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:37:17,605 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = 2*ULTIMATE.start_base2flt_~e#1 + 255 Supporting invariants [] [2022-02-21 03:37:17,637 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (10)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:17,643 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:37:17,646 INFO L390 LassoCheck]: Loop: "assume !false;" "assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1;" "assume base2flt_~m#1 % 4294967296 < 16777216;" [2022-02-21 03:37:17,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:17,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:17,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:17,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:37:17,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:17,679 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:17,691 INFO L290 TraceCheckUtils]: 0: Hoare triple {1455#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(22, 2);call #Ultimate.allocInit(12, 3); {1455#unseeded} is VALID [2022-02-21 03:37:17,692 INFO L290 TraceCheckUtils]: 1: Hoare triple {1455#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {1455#unseeded} is VALID [2022-02-21 03:37:17,692 INFO L290 TraceCheckUtils]: 2: Hoare triple {1455#unseeded} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {1455#unseeded} is VALID [2022-02-21 03:37:17,692 INFO L290 TraceCheckUtils]: 3: Hoare triple {1455#unseeded} base2flt_#res#1 := base2flt_~__retres4~0#1; {1455#unseeded} is VALID [2022-02-21 03:37:17,693 INFO L290 TraceCheckUtils]: 4: Hoare triple {1455#unseeded} main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {1455#unseeded} is VALID [2022-02-21 03:37:17,693 INFO L290 TraceCheckUtils]: 5: Hoare triple {1455#unseeded} assume !(0 == base2flt_~m#1 % 4294967296); {1455#unseeded} is VALID [2022-02-21 03:37:17,693 INFO L290 TraceCheckUtils]: 6: Hoare triple {1455#unseeded} assume base2flt_~m#1 % 4294967296 < 16777216; {1455#unseeded} is VALID [2022-02-21 03:37:17,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:17,698 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:37:17,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:17,704 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:17,769 INFO L290 TraceCheckUtils]: 0: Hoare triple {1458#(>= oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))} assume !false; {1458#(>= oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))} is VALID [2022-02-21 03:37:17,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {1458#(>= oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))} assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1; {1494#(and (<= (+ |ULTIMATE.start_base2flt_~e#1| 1) (div (+ oldRank0 (- 255)) 2)) (< 0 (+ (div (+ oldRank0 (- 255)) 2) 128)))} is VALID [2022-02-21 03:37:17,771 INFO L290 TraceCheckUtils]: 2: Hoare triple {1494#(and (<= (+ |ULTIMATE.start_base2flt_~e#1| 1) (div (+ oldRank0 (- 255)) 2)) (< 0 (+ (div (+ oldRank0 (- 255)) 2) 128)))} assume base2flt_~m#1 % 4294967296 < 16777216; {1468#(or (and (>= oldRank0 0) (> oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))) unseeded)} is VALID [2022-02-21 03:37:17,771 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 03:37:17,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 03:37:17,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:37:17,776 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:17,776 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,776 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 03:37:17,777 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 82 transitions. cyclomatic complexity: 35 Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 03:37:17,877 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 82 transitions. cyclomatic complexity: 35. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 109 states and 171 transitions. Complement of second has 5 states. [2022-02-21 03:37:17,877 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 03:37:17,878 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:17,878 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 82 transitions. cyclomatic complexity: 35 [2022-02-21 03:37:17,878 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:17,878 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:17,878 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 03:37:17,879 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:17,879 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:17,879 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:17,879 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 109 states and 171 transitions. [2022-02-21 03:37:17,880 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 27 [2022-02-21 03:37:17,880 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:17,880 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:17,880 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 53 states and 82 transitions. cyclomatic complexity: 35 [2022-02-21 03:37:17,881 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 18 examples of accepted words. [2022-02-21 03:37:17,881 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 03:37:17,882 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:17,882 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:37:17,882 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 109 states and 171 transitions. cyclomatic complexity: 72 [2022-02-21 03:37:17,883 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 27 examples of accepted words. [2022-02-21 03:37:17,883 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:17,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:17,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:17,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:17,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states 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 03:37:17,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:17,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:17,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:17,884 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,884 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:17,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 109 letters. Loop has 109 letters. [2022-02-21 03:37:17,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 109 letters. Loop has 109 letters. [2022-02-21 03:37:17,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 109 letters. Loop has 109 letters. [2022-02-21 03:37:17,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 53 letters. Loop has 53 letters. [2022-02-21 03:37:17,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states 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 53 letters. [2022-02-21 03:37:17,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 53 letters. Loop has 53 letters. [2022-02-21 03:37:17,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:17,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states 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 03:37:17,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,885 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:17,885 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:17,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:17,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:17,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:17,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:17,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:17,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:17,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:17,886 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,886 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:17,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:17,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:17,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:17,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:17,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:17,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:17,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:17,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,887 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:17,887 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:17,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:17,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:17,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:17,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:17,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:17,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:17,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:17,888 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,888 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:17,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:17,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:17,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:17,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:17,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:17,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:17,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,889 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:17,889 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:17,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:17,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:17,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:17,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:17,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:17,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:17,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:17,890 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,890 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:17,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:17,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:17,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:17,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:17,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:17,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:17,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:17,891 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,891 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:17,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:17,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:17,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:17,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:17,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:17,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states 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 03:37:17,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:17,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:17,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,892 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:17,892 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:17,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:17,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:17,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:17,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:17,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:17,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:17,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:17,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,893 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:17,893 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:17,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:17,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:17,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:17,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:17,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:17,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:17,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:17,894 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,894 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:17,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:17,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:17,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:17,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:17,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:17,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:17,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:17,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:17,895 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,895 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:17,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:17,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:17,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:17,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:17,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:17,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:17,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:17,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:17,896 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,896 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:17,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:17,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:17,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:17,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:17,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:17,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:17,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:17,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,897 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:17,897 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:17,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:17,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:17,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:17,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:17,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:17,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:17,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:17,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,898 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:17,898 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:17,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:17,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:17,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:17,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:17,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:17,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:17,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:17,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,899 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:17,899 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:17,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:17,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:17,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:17,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:17,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:17,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:17,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:17,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:17,900 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,900 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:17,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:17,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:17,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:17,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:17,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 82 transitions. cyclomatic complexity: 35 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:17,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:17,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,901 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 109 states and 171 transitions. cyclomatic complexity: 72 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:17,901 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,901 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:17,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 03:37:17,903 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2022-02-21 03:37:17,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 99 transitions. Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:17,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 99 transitions. Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:17,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,903 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 99 transitions. Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:37:17,903 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:17,903 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 109 states and 171 transitions. cyclomatic complexity: 72 [2022-02-21 03:37:17,906 INFO L131 ngComponentsAnalysis]: Automaton has 9 accepting balls. 27 [2022-02-21 03:37:17,908 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 109 states to 97 states and 150 transitions. [2022-02-21 03:37:17,908 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 91 [2022-02-21 03:37:17,909 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 94 [2022-02-21 03:37:17,909 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 150 transitions. [2022-02-21 03:37:17,909 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:37:17,909 INFO L681 BuchiCegarLoop]: Abstraction has 97 states and 150 transitions. [2022-02-21 03:37:17,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states and 150 transitions. [2022-02-21 03:37:17,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 56. [2022-02-21 03:37:17,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:17,911 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states and 150 transitions. Second operand has 56 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 55 states have internal predecessors, (86), 0 states have call successors, (0), 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 03:37:17,911 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states and 150 transitions. Second operand has 56 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 55 states have internal predecessors, (86), 0 states have call successors, (0), 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 03:37:17,911 INFO L87 Difference]: Start difference. First operand 97 states and 150 transitions. Second operand has 56 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 55 states have internal predecessors, (86), 0 states have call successors, (0), 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 03:37:17,912 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:17,914 INFO L93 Difference]: Finished difference Result 97 states and 150 transitions. [2022-02-21 03:37:17,914 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 150 transitions. [2022-02-21 03:37:17,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:17,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:17,915 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 55 states have internal predecessors, (86), 0 states have call successors, (0), 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 97 states and 150 transitions. [2022-02-21 03:37:17,915 INFO L87 Difference]: Start difference. First operand has 56 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 55 states have internal predecessors, (86), 0 states have call successors, (0), 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 97 states and 150 transitions. [2022-02-21 03:37:17,915 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:17,917 INFO L93 Difference]: Finished difference Result 98 states and 151 transitions. [2022-02-21 03:37:17,918 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 151 transitions. [2022-02-21 03:37:17,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:17,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:17,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:17,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:17,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.5357142857142858) internal successors, (86), 55 states have internal predecessors, (86), 0 states have call successors, (0), 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 03:37:17,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 86 transitions. [2022-02-21 03:37:17,919 INFO L704 BuchiCegarLoop]: Abstraction has 56 states and 86 transitions. [2022-02-21 03:37:17,919 INFO L587 BuchiCegarLoop]: Abstraction has 56 states and 86 transitions. [2022-02-21 03:37:17,919 INFO L425 BuchiCegarLoop]: ======== Iteration 3============ [2022-02-21 03:37:17,919 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 86 transitions. [2022-02-21 03:37:17,920 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2022-02-21 03:37:17,920 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:17,920 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:17,920 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:37:17,920 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:37:17,920 INFO L791 eck$LassoCheckResult]: Stem: 1668#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(22, 2);call #Ultimate.allocInit(12, 3); 1661#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 1645#L29 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 1646#L79 base2flt_#res#1 := base2flt_~__retres4~0#1; 1623#L80 main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 1624#L29-1 assume !(0 == base2flt_~m#1 % 4294967296); 1662#L35-1 assume !(base2flt_~m#1 % 4294967296 < 16777216); 1629#L57-5 [2022-02-21 03:37:17,920 INFO L793 eck$LassoCheckResult]: Loop: 1629#L57-5 assume !false; 1625#L58-1 assume base2flt_~m#1 % 4294967296 >= 33554432; 1626#L59-1 assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 / 2; 1629#L57-5 [2022-02-21 03:37:17,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:17,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1807920737, now seen corresponding path program 1 times [2022-02-21 03:37:17,921 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:17,921 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1834438949] [2022-02-21 03:37:17,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:17,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:17,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:17,962 INFO L290 TraceCheckUtils]: 0: Hoare triple {2043#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(22, 2);call #Ultimate.allocInit(12, 3); {2043#true} is VALID [2022-02-21 03:37:17,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {2043#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {2043#true} is VALID [2022-02-21 03:37:17,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {2043#true} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {2043#true} is VALID [2022-02-21 03:37:17,962 INFO L290 TraceCheckUtils]: 3: Hoare triple {2043#true} base2flt_#res#1 := base2flt_~__retres4~0#1; {2043#true} is VALID [2022-02-21 03:37:17,963 INFO L290 TraceCheckUtils]: 4: Hoare triple {2043#true} main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {2045#(= (+ (- 1) |ULTIMATE.start_base2flt_~m#1|) 0)} is VALID [2022-02-21 03:37:17,963 INFO L290 TraceCheckUtils]: 5: Hoare triple {2045#(= (+ (- 1) |ULTIMATE.start_base2flt_~m#1|) 0)} assume !(0 == base2flt_~m#1 % 4294967296); {2045#(= (+ (- 1) |ULTIMATE.start_base2flt_~m#1|) 0)} is VALID [2022-02-21 03:37:17,964 INFO L290 TraceCheckUtils]: 6: Hoare triple {2045#(= (+ (- 1) |ULTIMATE.start_base2flt_~m#1|) 0)} assume !(base2flt_~m#1 % 4294967296 < 16777216); {2044#false} is VALID [2022-02-21 03:37:17,964 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 03:37:17,964 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:37:17,964 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1834438949] [2022-02-21 03:37:17,964 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1834438949] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:37:17,964 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:37:17,964 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 03:37:17,964 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626919109] [2022-02-21 03:37:17,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:37:17,965 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:37:17,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:17,965 INFO L85 PathProgramCache]: Analyzing trace with hash 178877, now seen corresponding path program 1 times [2022-02-21 03:37:17,965 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:17,965 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [661066038] [2022-02-21 03:37:17,965 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:17,965 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:17,971 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:17,971 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:17,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:17,984 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:18,022 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:18,022 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:18,022 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:18,022 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:18,022 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:37:18,022 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:18,022 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:18,022 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:18,022 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration3_Loop [2022-02-21 03:37:18,022 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:18,022 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:18,023 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 03:37:18,027 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 03:37:18,090 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:18,090 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:37:18,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:18,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:18,108 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:18,113 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Waiting until timeout for monitored process [2022-02-21 03:37:18,113 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:37:18,115 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:18,151 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (12)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:18,152 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:18,153 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:18,154 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:18,155 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Waiting until timeout for monitored process [2022-02-21 03:37:18,157 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:37:18,157 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:18,191 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:37:18,204 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (13)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:18,206 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:18,206 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:18,206 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:18,206 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:18,206 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:37:18,206 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:18,206 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:18,206 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:18,206 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration3_Loop [2022-02-21 03:37:18,206 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:18,206 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:18,207 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 03:37:18,212 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:18,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (11)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:18,324 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:18,324 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:37:18,324 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:18,324 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:18,328 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:18,337 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Waiting until timeout for monitored process [2022-02-21 03:37:18,338 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 03:37:18,344 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:18,344 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:18,344 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:18,344 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:18,344 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:18,345 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:18,345 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:18,360 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:37:18,362 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:37:18,362 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:37:18,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:18,362 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:18,363 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:18,367 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Waiting until timeout for monitored process [2022-02-21 03:37:18,368 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:37:18,368 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:37:18,368 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:37:18,368 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = -2*ULTIMATE.start_base2flt_~e#1 + 253 Supporting invariants [] [2022-02-21 03:37:18,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (14)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:18,405 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:37:18,408 INFO L390 LassoCheck]: Loop: "assume !false;" "assume base2flt_~m#1 % 4294967296 >= 33554432;" "assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 / 2;" [2022-02-21 03:37:18,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:18,421 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:18,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:18,435 INFO L263 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:37:18,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:18,441 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:18,454 INFO L290 TraceCheckUtils]: 0: Hoare triple {2048#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(22, 2);call #Ultimate.allocInit(12, 3); {2048#unseeded} is VALID [2022-02-21 03:37:18,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {2048#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {2048#unseeded} is VALID [2022-02-21 03:37:18,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {2048#unseeded} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {2048#unseeded} is VALID [2022-02-21 03:37:18,455 INFO L290 TraceCheckUtils]: 3: Hoare triple {2048#unseeded} base2flt_#res#1 := base2flt_~__retres4~0#1; {2048#unseeded} is VALID [2022-02-21 03:37:18,456 INFO L290 TraceCheckUtils]: 4: Hoare triple {2048#unseeded} main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {2048#unseeded} is VALID [2022-02-21 03:37:18,456 INFO L290 TraceCheckUtils]: 5: Hoare triple {2048#unseeded} assume !(0 == base2flt_~m#1 % 4294967296); {2048#unseeded} is VALID [2022-02-21 03:37:18,456 INFO L290 TraceCheckUtils]: 6: Hoare triple {2048#unseeded} assume !(base2flt_~m#1 % 4294967296 < 16777216); {2048#unseeded} is VALID [2022-02-21 03:37:18,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:18,462 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:37:18,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:18,467 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:18,476 INFO L290 TraceCheckUtils]: 0: Hoare triple {2051#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume !false; {2051#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} is VALID [2022-02-21 03:37:18,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {2051#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume base2flt_~m#1 % 4294967296 >= 33554432; {2051#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} is VALID [2022-02-21 03:37:18,477 INFO L290 TraceCheckUtils]: 2: Hoare triple {2051#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 / 2; {2061#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))))} is VALID [2022-02-21 03:37:18,477 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 03:37:18,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 03:37:18,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:37:18,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:18,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,483 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:37:18,483 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 86 transitions. cyclomatic complexity: 36 Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 03:37:18,581 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 86 transitions. cyclomatic complexity: 36. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 111 states and 174 transitions. Complement of second has 5 states. [2022-02-21 03:37:18,581 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 03:37:18,581 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:18,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 86 transitions. cyclomatic complexity: 36 [2022-02-21 03:37:18,581 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:18,581 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:18,581 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 03:37:18,582 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:18,582 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:18,582 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:18,582 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 111 states and 174 transitions. [2022-02-21 03:37:18,583 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 24 [2022-02-21 03:37:18,583 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:18,583 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:18,583 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 56 states and 86 transitions. cyclomatic complexity: 36 [2022-02-21 03:37:18,584 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 15 examples of accepted words. [2022-02-21 03:37:18,584 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 03:37:18,585 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:18,585 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:37:18,585 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 111 states and 174 transitions. cyclomatic complexity: 73 [2022-02-21 03:37:18,586 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 24 examples of accepted words. [2022-02-21 03:37:18,586 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:18,586 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:18,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:18,587 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,587 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:18,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states 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 03:37:18,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:18,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:18,591 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,591 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:18,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:18,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 111 letters. Loop has 111 letters. [2022-02-21 03:37:18,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 111 letters. Loop has 111 letters. [2022-02-21 03:37:18,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,592 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 111 letters. Loop has 111 letters. [2022-02-21 03:37:18,592 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,593 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 56 letters. Loop has 56 letters. [2022-02-21 03:37:18,593 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states 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 56 letters. [2022-02-21 03:37:18,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 56 letters. Loop has 56 letters. [2022-02-21 03:37:18,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:18,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states 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 03:37:18,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:18,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:18,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:18,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:18,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:18,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:18,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:18,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,594 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:18,594 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:18,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:18,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,595 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:18,595 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:18,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:18,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:18,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:18,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:18,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:18,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:18,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:18,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:18,596 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,596 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:18,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:18,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:18,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:18,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:18,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:18,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:18,597 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,597 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:18,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:18,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,598 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:18,598 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:18,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:18,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:18,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:18,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:18,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:18,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:18,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:18,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:18,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 8 letters. Loop has 3 letters. [2022-02-21 03:37:18,599 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,599 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:18,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:18,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 9 letters. Loop has 3 letters. [2022-02-21 03:37:18,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:18,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:18,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:18,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:18,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states 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 03:37:18,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:18,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:18,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:18,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:18,600 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,600 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:18,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:18,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:18,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:18,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:18,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:18,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:18,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:18,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:18,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,601 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:18,601 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:18,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:18,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:18,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:18,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:18,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,602 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:18,602 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,612 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:18,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:18,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:18,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:18,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,613 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:18,613 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:18,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:18,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:18,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:18,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:18,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:18,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:18,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:18,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 12 letters. Loop has 3 letters. [2022-02-21 03:37:18,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:18,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:18,614 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,614 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 11 letters. Loop has 3 letters. [2022-02-21 03:37:18,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:18,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:18,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:18,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:18,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:18,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:18,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:18,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:18,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:18,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:18,615 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,615 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:18,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:18,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:18,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:18,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:18,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:18,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:18,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:18,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:18,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:18,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:18,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:18,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,616 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:18,616 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:18,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:18,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:18,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:18,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:18,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:18,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:18,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:18,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:18,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:18,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 86 transitions. cyclomatic complexity: 36 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:18,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:18,617 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,617 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 111 states and 174 transitions. cyclomatic complexity: 73 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:18,618 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,618 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:18,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 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 03:37:18,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2022-02-21 03:37:18,635 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 98 transitions. Stem has 7 letters. Loop has 3 letters. [2022-02-21 03:37:18,635 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 98 transitions. Stem has 10 letters. Loop has 3 letters. [2022-02-21 03:37:18,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,636 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 98 transitions. Stem has 7 letters. Loop has 6 letters. [2022-02-21 03:37:18,636 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:18,636 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 111 states and 174 transitions. cyclomatic complexity: 73 [2022-02-21 03:37:18,638 INFO L131 ngComponentsAnalysis]: Automaton has 8 accepting balls. 24 [2022-02-21 03:37:18,640 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 111 states to 99 states and 153 transitions. [2022-02-21 03:37:18,640 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 92 [2022-02-21 03:37:18,640 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 93 [2022-02-21 03:37:18,640 INFO L73 IsDeterministic]: Start isDeterministic. Operand 99 states and 153 transitions. [2022-02-21 03:37:18,640 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:37:18,640 INFO L681 BuchiCegarLoop]: Abstraction has 99 states and 153 transitions. [2022-02-21 03:37:18,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states and 153 transitions. [2022-02-21 03:37:18,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 59. [2022-02-21 03:37:18,642 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:18,642 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states and 153 transitions. Second operand has 59 states, 59 states have (on average 1.5254237288135593) internal successors, (90), 58 states have internal predecessors, (90), 0 states have call successors, (0), 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 03:37:18,642 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states and 153 transitions. Second operand has 59 states, 59 states have (on average 1.5254237288135593) internal successors, (90), 58 states have internal predecessors, (90), 0 states have call successors, (0), 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 03:37:18,642 INFO L87 Difference]: Start difference. First operand 99 states and 153 transitions. Second operand has 59 states, 59 states have (on average 1.5254237288135593) internal successors, (90), 58 states have internal predecessors, (90), 0 states have call successors, (0), 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 03:37:18,642 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:18,644 INFO L93 Difference]: Finished difference Result 99 states and 153 transitions. [2022-02-21 03:37:18,645 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 153 transitions. [2022-02-21 03:37:18,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:18,645 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:18,645 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 59 states have (on average 1.5254237288135593) internal successors, (90), 58 states have internal predecessors, (90), 0 states have call successors, (0), 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 99 states and 153 transitions. [2022-02-21 03:37:18,645 INFO L87 Difference]: Start difference. First operand has 59 states, 59 states have (on average 1.5254237288135593) internal successors, (90), 58 states have internal predecessors, (90), 0 states have call successors, (0), 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 99 states and 153 transitions. [2022-02-21 03:37:18,645 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:18,647 INFO L93 Difference]: Finished difference Result 99 states and 153 transitions. [2022-02-21 03:37:18,647 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 153 transitions. [2022-02-21 03:37:18,647 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:18,647 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:18,648 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:18,648 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:18,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.5254237288135593) internal successors, (90), 58 states have internal predecessors, (90), 0 states have call successors, (0), 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 03:37:18,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 90 transitions. [2022-02-21 03:37:18,649 INFO L704 BuchiCegarLoop]: Abstraction has 59 states and 90 transitions. [2022-02-21 03:37:18,649 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:37:18,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:37:18,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:37:18,650 INFO L87 Difference]: Start difference. First operand 59 states and 90 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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 03:37:18,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:18,765 INFO L93 Difference]: Finished difference Result 61 states and 87 transitions. [2022-02-21 03:37:18,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:37:18,765 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 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 03:37:18,770 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 03:37:18,772 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 61 states and 87 transitions. [2022-02-21 03:37:18,773 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2022-02-21 03:37:18,774 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 61 states to 61 states and 87 transitions. [2022-02-21 03:37:18,774 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 57 [2022-02-21 03:37:18,774 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 57 [2022-02-21 03:37:18,774 INFO L73 IsDeterministic]: Start isDeterministic. Operand 61 states and 87 transitions. [2022-02-21 03:37:18,776 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:37:18,776 INFO L681 BuchiCegarLoop]: Abstraction has 61 states and 87 transitions. [2022-02-21 03:37:18,776 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states and 87 transitions. [2022-02-21 03:37:18,778 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 53. [2022-02-21 03:37:18,778 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:18,779 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states and 87 transitions. Second operand has 53 states, 53 states have (on average 1.490566037735849) internal successors, (79), 52 states have internal predecessors, (79), 0 states have call successors, (0), 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 03:37:18,779 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states and 87 transitions. Second operand has 53 states, 53 states have (on average 1.490566037735849) internal successors, (79), 52 states have internal predecessors, (79), 0 states have call successors, (0), 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 03:37:18,779 INFO L87 Difference]: Start difference. First operand 61 states and 87 transitions. Second operand has 53 states, 53 states have (on average 1.490566037735849) internal successors, (79), 52 states have internal predecessors, (79), 0 states have call successors, (0), 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 03:37:18,779 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:18,780 INFO L93 Difference]: Finished difference Result 61 states and 87 transitions. [2022-02-21 03:37:18,780 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 87 transitions. [2022-02-21 03:37:18,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:18,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:18,780 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 53 states have (on average 1.490566037735849) internal successors, (79), 52 states have internal predecessors, (79), 0 states have call successors, (0), 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 61 states and 87 transitions. [2022-02-21 03:37:18,780 INFO L87 Difference]: Start difference. First operand has 53 states, 53 states have (on average 1.490566037735849) internal successors, (79), 52 states have internal predecessors, (79), 0 states have call successors, (0), 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 61 states and 87 transitions. [2022-02-21 03:37:18,780 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:18,781 INFO L93 Difference]: Finished difference Result 61 states and 87 transitions. [2022-02-21 03:37:18,781 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 87 transitions. [2022-02-21 03:37:18,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:18,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:18,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:18,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:18,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 53 states have (on average 1.490566037735849) internal successors, (79), 52 states have internal predecessors, (79), 0 states have call successors, (0), 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 03:37:18,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 79 transitions. [2022-02-21 03:37:18,783 INFO L704 BuchiCegarLoop]: Abstraction has 53 states and 79 transitions. [2022-02-21 03:37:18,783 INFO L587 BuchiCegarLoop]: Abstraction has 53 states and 79 transitions. [2022-02-21 03:37:18,783 INFO L425 BuchiCegarLoop]: ======== Iteration 4============ [2022-02-21 03:37:18,783 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 79 transitions. [2022-02-21 03:37:18,783 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2022-02-21 03:37:18,783 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:18,783 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:18,784 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:37:18,784 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:37:18,784 INFO L791 eck$LassoCheckResult]: Stem: 2747#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(22, 2);call #Ultimate.allocInit(12, 3); 2718#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 2719#L29 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 2751#L79 base2flt_#res#1 := base2flt_~__retres4~0#1; 2723#L80 main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 2724#L29-1 assume !(0 == base2flt_~m#1 % 4294967296); 2726#L35-1 assume base2flt_~m#1 % 4294967296 < 16777216; 2727#L47-3 assume !false; 2748#L38-1 assume base2flt_~e#1 <= -128;base2flt_~__retres4~0#1 := 0; 2725#L79-1 base2flt_#res#1 := base2flt_~__retres4~0#1; 2737#L80-1 main_#t~ret23#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 2744#L29-2 assume !(0 == base2flt_~m#1 % 4294967296); 2741#L35-2 assume !(base2flt_~m#1 % 4294967296 < 16777216); 2742#L57-8 [2022-02-21 03:37:18,784 INFO L793 eck$LassoCheckResult]: Loop: 2742#L57-8 assume !false; 2734#L58-2 assume base2flt_~m#1 % 4294967296 >= 33554432; 2735#L59-2 assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 / 2; 2742#L57-8 [2022-02-21 03:37:18,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:18,785 INFO L85 PathProgramCache]: Analyzing trace with hash 359266186, now seen corresponding path program 1 times [2022-02-21 03:37:18,785 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:18,785 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640497912] [2022-02-21 03:37:18,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:18,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:18,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:18,832 INFO L290 TraceCheckUtils]: 0: Hoare triple {3011#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(22, 2);call #Ultimate.allocInit(12, 3); {3011#true} is VALID [2022-02-21 03:37:18,832 INFO L290 TraceCheckUtils]: 1: Hoare triple {3011#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {3011#true} is VALID [2022-02-21 03:37:18,833 INFO L290 TraceCheckUtils]: 2: Hoare triple {3011#true} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {3011#true} is VALID [2022-02-21 03:37:18,833 INFO L290 TraceCheckUtils]: 3: Hoare triple {3011#true} base2flt_#res#1 := base2flt_~__retres4~0#1; {3011#true} is VALID [2022-02-21 03:37:18,833 INFO L290 TraceCheckUtils]: 4: Hoare triple {3011#true} main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {3013#(= |ULTIMATE.start_base2flt_~e#1| 0)} is VALID [2022-02-21 03:37:18,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {3013#(= |ULTIMATE.start_base2flt_~e#1| 0)} assume !(0 == base2flt_~m#1 % 4294967296); {3013#(= |ULTIMATE.start_base2flt_~e#1| 0)} is VALID [2022-02-21 03:37:18,834 INFO L290 TraceCheckUtils]: 6: Hoare triple {3013#(= |ULTIMATE.start_base2flt_~e#1| 0)} assume base2flt_~m#1 % 4294967296 < 16777216; {3013#(= |ULTIMATE.start_base2flt_~e#1| 0)} is VALID [2022-02-21 03:37:18,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {3013#(= |ULTIMATE.start_base2flt_~e#1| 0)} assume !false; {3013#(= |ULTIMATE.start_base2flt_~e#1| 0)} is VALID [2022-02-21 03:37:18,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {3013#(= |ULTIMATE.start_base2flt_~e#1| 0)} assume base2flt_~e#1 <= -128;base2flt_~__retres4~0#1 := 0; {3012#false} is VALID [2022-02-21 03:37:18,834 INFO L290 TraceCheckUtils]: 9: Hoare triple {3012#false} base2flt_#res#1 := base2flt_~__retres4~0#1; {3012#false} is VALID [2022-02-21 03:37:18,834 INFO L290 TraceCheckUtils]: 10: Hoare triple {3012#false} main_#t~ret23#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {3012#false} is VALID [2022-02-21 03:37:18,835 INFO L290 TraceCheckUtils]: 11: Hoare triple {3012#false} assume !(0 == base2flt_~m#1 % 4294967296); {3012#false} is VALID [2022-02-21 03:37:18,835 INFO L290 TraceCheckUtils]: 12: Hoare triple {3012#false} assume !(base2flt_~m#1 % 4294967296 < 16777216); {3012#false} is VALID [2022-02-21 03:37:18,835 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 03:37:18,835 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:37:18,835 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640497912] [2022-02-21 03:37:18,835 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640497912] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:37:18,835 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:37:18,835 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 03:37:18,835 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1916329269] [2022-02-21 03:37:18,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:37:18,835 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:37:18,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:18,836 INFO L85 PathProgramCache]: Analyzing trace with hash 283142, now seen corresponding path program 1 times [2022-02-21 03:37:18,836 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:18,836 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [281598307] [2022-02-21 03:37:18,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:18,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:18,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:18,845 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:18,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:18,849 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:18,872 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:18,872 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:18,872 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:18,872 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:18,872 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:37:18,872 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:18,872 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:18,872 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:18,872 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration4_Loop [2022-02-21 03:37:18,872 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:18,872 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:18,873 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 03:37:18,877 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:18,969 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:18,969 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:37:18,969 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:18,969 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:18,970 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:18,971 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Waiting until timeout for monitored process [2022-02-21 03:37:18,974 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:37:18,974 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:19,021 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (16)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:19,021 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:19,022 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:19,022 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:19,023 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Waiting until timeout for monitored process [2022-02-21 03:37:19,025 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:37:19,025 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:19,058 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:37:19,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (17)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:19,060 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:19,061 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:19,061 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:19,061 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:19,061 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:37:19,061 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:19,061 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:19,061 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:19,061 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration4_Loop [2022-02-21 03:37:19,061 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:19,061 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:19,061 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 03:37:19,075 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 03:37:19,144 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:19,144 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:37:19,144 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:19,144 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:19,160 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:19,161 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Waiting until timeout for monitored process [2022-02-21 03:37:19,163 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 03:37:19,168 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:19,169 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:19,169 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:19,169 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:19,169 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:19,170 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:19,170 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:19,185 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:37:19,188 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:37:19,188 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:37:19,188 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:19,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:19,198 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:19,204 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:37:19,204 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:37:19,204 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:37:19,204 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = -2*ULTIMATE.start_base2flt_~e#1 + 253 Supporting invariants [] [2022-02-21 03:37:19,218 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Waiting until timeout for monitored process [2022-02-21 03:37:19,222 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (18)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:19,229 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:37:19,232 INFO L390 LassoCheck]: Loop: "assume !false;" "assume base2flt_~m#1 % 4294967296 >= 33554432;" "assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 / 2;" [2022-02-21 03:37:19,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:19,247 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:19,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:19,264 INFO L263 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:37:19,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:19,272 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:19,310 INFO L290 TraceCheckUtils]: 0: Hoare triple {3016#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(22, 2);call #Ultimate.allocInit(12, 3); {3016#unseeded} is VALID [2022-02-21 03:37:19,310 INFO L290 TraceCheckUtils]: 1: Hoare triple {3016#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {3016#unseeded} is VALID [2022-02-21 03:37:19,311 INFO L290 TraceCheckUtils]: 2: Hoare triple {3016#unseeded} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {3016#unseeded} is VALID [2022-02-21 03:37:19,311 INFO L290 TraceCheckUtils]: 3: Hoare triple {3016#unseeded} base2flt_#res#1 := base2flt_~__retres4~0#1; {3016#unseeded} is VALID [2022-02-21 03:37:19,311 INFO L290 TraceCheckUtils]: 4: Hoare triple {3016#unseeded} main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {3016#unseeded} is VALID [2022-02-21 03:37:19,313 INFO L290 TraceCheckUtils]: 5: Hoare triple {3016#unseeded} assume !(0 == base2flt_~m#1 % 4294967296); {3016#unseeded} is VALID [2022-02-21 03:37:19,313 INFO L290 TraceCheckUtils]: 6: Hoare triple {3016#unseeded} assume base2flt_~m#1 % 4294967296 < 16777216; {3016#unseeded} is VALID [2022-02-21 03:37:19,314 INFO L290 TraceCheckUtils]: 7: Hoare triple {3016#unseeded} assume !false; {3016#unseeded} is VALID [2022-02-21 03:37:19,314 INFO L290 TraceCheckUtils]: 8: Hoare triple {3016#unseeded} assume base2flt_~e#1 <= -128;base2flt_~__retres4~0#1 := 0; {3016#unseeded} is VALID [2022-02-21 03:37:19,314 INFO L290 TraceCheckUtils]: 9: Hoare triple {3016#unseeded} base2flt_#res#1 := base2flt_~__retres4~0#1; {3016#unseeded} is VALID [2022-02-21 03:37:19,314 INFO L290 TraceCheckUtils]: 10: Hoare triple {3016#unseeded} main_#t~ret23#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {3016#unseeded} is VALID [2022-02-21 03:37:19,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {3016#unseeded} assume !(0 == base2flt_~m#1 % 4294967296); {3016#unseeded} is VALID [2022-02-21 03:37:19,315 INFO L290 TraceCheckUtils]: 12: Hoare triple {3016#unseeded} assume !(base2flt_~m#1 % 4294967296 < 16777216); {3016#unseeded} is VALID [2022-02-21 03:37:19,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:19,323 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:37:19,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:19,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:19,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {3019#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume !false; {3019#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} is VALID [2022-02-21 03:37:19,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {3019#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume base2flt_~m#1 % 4294967296 >= 33554432; {3019#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} is VALID [2022-02-21 03:37:19,335 INFO L290 TraceCheckUtils]: 2: Hoare triple {3019#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 / 2; {3029#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))))} is VALID [2022-02-21 03:37:19,335 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 03:37:19,335 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 03:37:19,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:37:19,339 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:19,339 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,339 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:37:19,340 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 53 states and 79 transitions. cyclomatic complexity: 31 Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 03:37:19,399 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (19)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:19,426 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (15)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:19,485 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 53 states and 79 transitions. cyclomatic complexity: 31. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 88 states and 133 transitions. Complement of second has 5 states. [2022-02-21 03:37:19,485 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 03:37:19,485 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:19,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 53 states and 79 transitions. cyclomatic complexity: 31 [2022-02-21 03:37:19,485 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:19,485 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:19,485 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 03:37:19,486 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:19,486 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:19,486 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:19,486 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 88 states and 133 transitions. [2022-02-21 03:37:19,487 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2022-02-21 03:37:19,487 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:19,487 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:19,487 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 53 states and 79 transitions. cyclomatic complexity: 31 [2022-02-21 03:37:19,487 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2022-02-21 03:37:19,487 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 03:37:19,488 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:19,488 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:37:19,488 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 88 states and 133 transitions. cyclomatic complexity: 52 [2022-02-21 03:37:19,489 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 15 examples of accepted words. [2022-02-21 03:37:19,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:19,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:19,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:19,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:19,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states 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 03:37:19,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:19,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:19,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:19,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:19,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,489 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 88 letters. Loop has 88 letters. [2022-02-21 03:37:19,489 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states 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 88 letters. [2022-02-21 03:37:19,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 88 letters. Loop has 88 letters. [2022-02-21 03:37:19,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 53 letters. Loop has 53 letters. [2022-02-21 03:37:19,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states 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 53 letters. [2022-02-21 03:37:19,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 53 letters. Loop has 53 letters. [2022-02-21 03:37:19,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:19,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states 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 03:37:19,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:19,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:19,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:19,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:19,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:19,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:19,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:19,490 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,490 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:19,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:19,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:19,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:19,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:19,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:19,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:19,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:19,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:19,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:19,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:19,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:19,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:19,491 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,491 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:19,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:19,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:19,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:19,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:19,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:19,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:19,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:19,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:19,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:19,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:19,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:19,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:19,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:19,492 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,492 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:19,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:19,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:19,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:19,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states 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 03:37:19,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:19,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:19,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:19,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:19,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:19,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:19,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:19,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:19,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,493 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:19,493 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:19,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:19,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:19,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:19,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:19,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:19,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:19,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:19,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:19,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:19,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:19,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:19,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:19,494 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,494 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:19,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:19,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 15 letters. Loop has 3 letters. [2022-02-21 03:37:19,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:19,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:19,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 14 letters. Loop has 3 letters. [2022-02-21 03:37:19,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:37:19,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:37:19,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:37:19,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:37:19,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:37:19,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:37:19,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:37:19,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,495 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:37:19,495 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:37:19,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:37:19,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:37:19,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:37:19,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:37:19,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:37:19,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:37:19,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 53 states and 79 transitions. cyclomatic complexity: 31 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:37:19,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:37:19,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,496 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 88 states and 133 transitions. cyclomatic complexity: 52 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:37:19,496 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,496 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:19,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 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 03:37:19,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-02-21 03:37:19,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 91 transitions. Stem has 13 letters. Loop has 3 letters. [2022-02-21 03:37:19,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 91 transitions. Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:19,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,497 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 91 transitions. Stem has 13 letters. Loop has 6 letters. [2022-02-21 03:37:19,497 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:19,498 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 88 states and 133 transitions. cyclomatic complexity: 52 [2022-02-21 03:37:19,499 INFO L131 ngComponentsAnalysis]: Automaton has 5 accepting balls. 15 [2022-02-21 03:37:19,516 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 88 states to 76 states and 112 transitions. [2022-02-21 03:37:19,516 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 69 [2022-02-21 03:37:19,516 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 70 [2022-02-21 03:37:19,516 INFO L73 IsDeterministic]: Start isDeterministic. Operand 76 states and 112 transitions. [2022-02-21 03:37:19,516 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:37:19,516 INFO L681 BuchiCegarLoop]: Abstraction has 76 states and 112 transitions. [2022-02-21 03:37:19,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states and 112 transitions. [2022-02-21 03:37:19,517 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 56. [2022-02-21 03:37:19,517 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:19,517 INFO L82 GeneralOperation]: Start isEquivalent. First operand 76 states and 112 transitions. Second operand has 56 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 55 states have internal predecessors, (83), 0 states have call successors, (0), 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 03:37:19,517 INFO L74 IsIncluded]: Start isIncluded. First operand 76 states and 112 transitions. Second operand has 56 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 55 states have internal predecessors, (83), 0 states have call successors, (0), 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 03:37:19,517 INFO L87 Difference]: Start difference. First operand 76 states and 112 transitions. Second operand has 56 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 55 states have internal predecessors, (83), 0 states have call successors, (0), 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 03:37:19,518 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:19,518 INFO L93 Difference]: Finished difference Result 76 states and 112 transitions. [2022-02-21 03:37:19,519 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 112 transitions. [2022-02-21 03:37:19,519 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:19,519 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:19,519 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 55 states have internal predecessors, (83), 0 states have call successors, (0), 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 76 states and 112 transitions. [2022-02-21 03:37:19,519 INFO L87 Difference]: Start difference. First operand has 56 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 55 states have internal predecessors, (83), 0 states have call successors, (0), 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 76 states and 112 transitions. [2022-02-21 03:37:19,519 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:19,520 INFO L93 Difference]: Finished difference Result 76 states and 112 transitions. [2022-02-21 03:37:19,520 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 112 transitions. [2022-02-21 03:37:19,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:19,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:19,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:19,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:19,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.4821428571428572) internal successors, (83), 55 states have internal predecessors, (83), 0 states have call successors, (0), 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 03:37:19,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 83 transitions. [2022-02-21 03:37:19,521 INFO L704 BuchiCegarLoop]: Abstraction has 56 states and 83 transitions. [2022-02-21 03:37:19,521 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:37:19,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 03:37:19,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 03:37:19,521 INFO L87 Difference]: Start difference. First operand 56 states and 83 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 03:37:19,597 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:19,597 INFO L93 Difference]: Finished difference Result 58 states and 84 transitions. [2022-02-21 03:37:19,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 03:37:19,597 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 03:37:19,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:37:19,608 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 58 states and 84 transitions. [2022-02-21 03:37:19,609 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 03:37:19,609 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 58 states to 57 states and 83 transitions. [2022-02-21 03:37:19,609 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 50 [2022-02-21 03:37:19,609 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 50 [2022-02-21 03:37:19,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 57 states and 83 transitions. [2022-02-21 03:37:19,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:37:19,609 INFO L681 BuchiCegarLoop]: Abstraction has 57 states and 83 transitions. [2022-02-21 03:37:19,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states and 83 transitions. [2022-02-21 03:37:19,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2022-02-21 03:37:19,611 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:19,611 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states and 83 transitions. Second operand has 56 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 55 states have internal predecessors, (82), 0 states have call successors, (0), 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 03:37:19,611 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states and 83 transitions. Second operand has 56 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 55 states have internal predecessors, (82), 0 states have call successors, (0), 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 03:37:19,611 INFO L87 Difference]: Start difference. First operand 57 states and 83 transitions. Second operand has 56 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 55 states have internal predecessors, (82), 0 states have call successors, (0), 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 03:37:19,611 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:19,612 INFO L93 Difference]: Finished difference Result 57 states and 83 transitions. [2022-02-21 03:37:19,612 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 83 transitions. [2022-02-21 03:37:19,612 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:19,612 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:19,612 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 55 states have internal predecessors, (82), 0 states have call successors, (0), 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 57 states and 83 transitions. [2022-02-21 03:37:19,612 INFO L87 Difference]: Start difference. First operand has 56 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 55 states have internal predecessors, (82), 0 states have call successors, (0), 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 57 states and 83 transitions. [2022-02-21 03:37:19,612 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:19,613 INFO L93 Difference]: Finished difference Result 57 states and 83 transitions. [2022-02-21 03:37:19,613 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 83 transitions. [2022-02-21 03:37:19,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:19,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:19,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:19,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:19,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 56 states have (on average 1.4642857142857142) internal successors, (82), 55 states have internal predecessors, (82), 0 states have call successors, (0), 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 03:37:19,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 82 transitions. [2022-02-21 03:37:19,614 INFO L704 BuchiCegarLoop]: Abstraction has 56 states and 82 transitions. [2022-02-21 03:37:19,614 INFO L587 BuchiCegarLoop]: Abstraction has 56 states and 82 transitions. [2022-02-21 03:37:19,614 INFO L425 BuchiCegarLoop]: ======== Iteration 5============ [2022-02-21 03:37:19,614 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 82 transitions. [2022-02-21 03:37:19,614 INFO L131 ngComponentsAnalysis]: Automaton has 3 accepting balls. 9 [2022-02-21 03:37:19,614 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:19,614 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:19,614 INFO L842 BuchiCegarLoop]: Counterexample stem histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 03:37:19,614 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:37:19,615 INFO L791 eck$LassoCheckResult]: Stem: 3628#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(22, 2);call #Ultimate.allocInit(12, 3); 3596#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 3597#L29 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 3632#L79 base2flt_#res#1 := base2flt_~__retres4~0#1; 3602#L80 main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 3603#L29-1 assume !(0 == base2flt_~m#1 % 4294967296); 3605#L35-1 assume base2flt_~m#1 % 4294967296 < 16777216; 3606#L47-3 assume !false; 3630#L38-1 assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1; 3618#L47-2 assume base2flt_~m#1 % 4294967296 < 16777216; 3619#L47-3 assume !false; 3629#L38-1 assume base2flt_~e#1 <= -128;base2flt_~__retres4~0#1 := 0; 3604#L79-1 base2flt_#res#1 := base2flt_~__retres4~0#1; 3621#L80-1 main_#t~ret23#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 3625#L29-2 assume !(0 == base2flt_~m#1 % 4294967296); 3622#L35-2 assume base2flt_~m#1 % 4294967296 < 16777216; 3624#L47-5 [2022-02-21 03:37:19,615 INFO L793 eck$LassoCheckResult]: Loop: 3624#L47-5 assume !false; 3627#L38-2 assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1; 3635#L47-4 assume base2flt_~m#1 % 4294967296 < 16777216; 3624#L47-5 [2022-02-21 03:37:19,615 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:19,615 INFO L85 PathProgramCache]: Analyzing trace with hash 1105339009, now seen corresponding path program 1 times [2022-02-21 03:37:19,615 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:19,615 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1193554913] [2022-02-21 03:37:19,615 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:19,615 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:19,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:19,657 INFO L290 TraceCheckUtils]: 0: Hoare triple {3886#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(22, 2);call #Ultimate.allocInit(12, 3); {3886#true} is VALID [2022-02-21 03:37:19,657 INFO L290 TraceCheckUtils]: 1: Hoare triple {3886#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {3886#true} is VALID [2022-02-21 03:37:19,657 INFO L290 TraceCheckUtils]: 2: Hoare triple {3886#true} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {3886#true} is VALID [2022-02-21 03:37:19,657 INFO L290 TraceCheckUtils]: 3: Hoare triple {3886#true} base2flt_#res#1 := base2flt_~__retres4~0#1; {3886#true} is VALID [2022-02-21 03:37:19,657 INFO L290 TraceCheckUtils]: 4: Hoare triple {3886#true} main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {3888#(= |ULTIMATE.start_base2flt_~e#1| 0)} is VALID [2022-02-21 03:37:19,658 INFO L290 TraceCheckUtils]: 5: Hoare triple {3888#(= |ULTIMATE.start_base2flt_~e#1| 0)} assume !(0 == base2flt_~m#1 % 4294967296); {3888#(= |ULTIMATE.start_base2flt_~e#1| 0)} is VALID [2022-02-21 03:37:19,658 INFO L290 TraceCheckUtils]: 6: Hoare triple {3888#(= |ULTIMATE.start_base2flt_~e#1| 0)} assume base2flt_~m#1 % 4294967296 < 16777216; {3888#(= |ULTIMATE.start_base2flt_~e#1| 0)} is VALID [2022-02-21 03:37:19,658 INFO L290 TraceCheckUtils]: 7: Hoare triple {3888#(= |ULTIMATE.start_base2flt_~e#1| 0)} assume !false; {3888#(= |ULTIMATE.start_base2flt_~e#1| 0)} is VALID [2022-02-21 03:37:19,659 INFO L290 TraceCheckUtils]: 8: Hoare triple {3888#(= |ULTIMATE.start_base2flt_~e#1| 0)} assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1; {3889#(<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1))} is VALID [2022-02-21 03:37:19,659 INFO L290 TraceCheckUtils]: 9: Hoare triple {3889#(<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1))} assume base2flt_~m#1 % 4294967296 < 16777216; {3889#(<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1))} is VALID [2022-02-21 03:37:19,659 INFO L290 TraceCheckUtils]: 10: Hoare triple {3889#(<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1))} assume !false; {3889#(<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1))} is VALID [2022-02-21 03:37:19,659 INFO L290 TraceCheckUtils]: 11: Hoare triple {3889#(<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1))} assume base2flt_~e#1 <= -128;base2flt_~__retres4~0#1 := 0; {3887#false} is VALID [2022-02-21 03:37:19,660 INFO L290 TraceCheckUtils]: 12: Hoare triple {3887#false} base2flt_#res#1 := base2flt_~__retres4~0#1; {3887#false} is VALID [2022-02-21 03:37:19,660 INFO L290 TraceCheckUtils]: 13: Hoare triple {3887#false} main_#t~ret23#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {3887#false} is VALID [2022-02-21 03:37:19,660 INFO L290 TraceCheckUtils]: 14: Hoare triple {3887#false} assume !(0 == base2flt_~m#1 % 4294967296); {3887#false} is VALID [2022-02-21 03:37:19,660 INFO L290 TraceCheckUtils]: 15: Hoare triple {3887#false} assume base2flt_~m#1 % 4294967296 < 16777216; {3887#false} is VALID [2022-02-21 03:37:19,660 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:19,660 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:37:19,660 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1193554913] [2022-02-21 03:37:19,660 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1193554913] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-21 03:37:19,660 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [67478916] [2022-02-21 03:37:19,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:19,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-21 03:37:19,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:19,676 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-21 03:37:19,680 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2022-02-21 03:37:19,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:19,723 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:37:19,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:19,732 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:19,787 INFO L290 TraceCheckUtils]: 0: Hoare triple {3886#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(22, 2);call #Ultimate.allocInit(12, 3); {3886#true} is VALID [2022-02-21 03:37:19,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {3886#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {3886#true} is VALID [2022-02-21 03:37:19,787 INFO L290 TraceCheckUtils]: 2: Hoare triple {3886#true} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {3886#true} is VALID [2022-02-21 03:37:19,787 INFO L290 TraceCheckUtils]: 3: Hoare triple {3886#true} base2flt_#res#1 := base2flt_~__retres4~0#1; {3886#true} is VALID [2022-02-21 03:37:19,788 INFO L290 TraceCheckUtils]: 4: Hoare triple {3886#true} main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {3905#(<= 0 |ULTIMATE.start_base2flt_~e#1|)} is VALID [2022-02-21 03:37:19,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {3905#(<= 0 |ULTIMATE.start_base2flt_~e#1|)} assume !(0 == base2flt_~m#1 % 4294967296); {3905#(<= 0 |ULTIMATE.start_base2flt_~e#1|)} is VALID [2022-02-21 03:37:19,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {3905#(<= 0 |ULTIMATE.start_base2flt_~e#1|)} assume base2flt_~m#1 % 4294967296 < 16777216; {3905#(<= 0 |ULTIMATE.start_base2flt_~e#1|)} is VALID [2022-02-21 03:37:19,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {3905#(<= 0 |ULTIMATE.start_base2flt_~e#1|)} assume !false; {3905#(<= 0 |ULTIMATE.start_base2flt_~e#1|)} is VALID [2022-02-21 03:37:19,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {3905#(<= 0 |ULTIMATE.start_base2flt_~e#1|)} assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1; {3889#(<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1))} is VALID [2022-02-21 03:37:19,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {3889#(<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1))} assume base2flt_~m#1 % 4294967296 < 16777216; {3889#(<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1))} is VALID [2022-02-21 03:37:19,790 INFO L290 TraceCheckUtils]: 10: Hoare triple {3889#(<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1))} assume !false; {3889#(<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1))} is VALID [2022-02-21 03:37:19,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {3889#(<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1))} assume base2flt_~e#1 <= -128;base2flt_~__retres4~0#1 := 0; {3887#false} is VALID [2022-02-21 03:37:19,791 INFO L290 TraceCheckUtils]: 12: Hoare triple {3887#false} base2flt_#res#1 := base2flt_~__retres4~0#1; {3887#false} is VALID [2022-02-21 03:37:19,791 INFO L290 TraceCheckUtils]: 13: Hoare triple {3887#false} main_#t~ret23#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {3887#false} is VALID [2022-02-21 03:37:19,791 INFO L290 TraceCheckUtils]: 14: Hoare triple {3887#false} assume !(0 == base2flt_~m#1 % 4294967296); {3887#false} is VALID [2022-02-21 03:37:19,791 INFO L290 TraceCheckUtils]: 15: Hoare triple {3887#false} assume base2flt_~m#1 % 4294967296 < 16777216; {3887#false} is VALID [2022-02-21 03:37:19,791 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:19,791 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-21 03:37:19,861 INFO L290 TraceCheckUtils]: 15: Hoare triple {3887#false} assume base2flt_~m#1 % 4294967296 < 16777216; {3887#false} is VALID [2022-02-21 03:37:19,861 INFO L290 TraceCheckUtils]: 14: Hoare triple {3887#false} assume !(0 == base2flt_~m#1 % 4294967296); {3887#false} is VALID [2022-02-21 03:37:19,862 INFO L290 TraceCheckUtils]: 13: Hoare triple {3887#false} main_#t~ret23#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {3887#false} is VALID [2022-02-21 03:37:19,862 INFO L290 TraceCheckUtils]: 12: Hoare triple {3887#false} base2flt_#res#1 := base2flt_~__retres4~0#1; {3887#false} is VALID [2022-02-21 03:37:19,862 INFO L290 TraceCheckUtils]: 11: Hoare triple {3951#(not (<= (+ |ULTIMATE.start_base2flt_~e#1| 128) 0))} assume base2flt_~e#1 <= -128;base2flt_~__retres4~0#1 := 0; {3887#false} is VALID [2022-02-21 03:37:19,862 INFO L290 TraceCheckUtils]: 10: Hoare triple {3951#(not (<= (+ |ULTIMATE.start_base2flt_~e#1| 128) 0))} assume !false; {3951#(not (<= (+ |ULTIMATE.start_base2flt_~e#1| 128) 0))} is VALID [2022-02-21 03:37:19,863 INFO L290 TraceCheckUtils]: 9: Hoare triple {3951#(not (<= (+ |ULTIMATE.start_base2flt_~e#1| 128) 0))} assume base2flt_~m#1 % 4294967296 < 16777216; {3951#(not (<= (+ |ULTIMATE.start_base2flt_~e#1| 128) 0))} is VALID [2022-02-21 03:37:19,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {3961#(< 0 (+ |ULTIMATE.start_base2flt_~e#1| 127))} assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1; {3951#(not (<= (+ |ULTIMATE.start_base2flt_~e#1| 128) 0))} is VALID [2022-02-21 03:37:19,866 INFO L290 TraceCheckUtils]: 7: Hoare triple {3961#(< 0 (+ |ULTIMATE.start_base2flt_~e#1| 127))} assume !false; {3961#(< 0 (+ |ULTIMATE.start_base2flt_~e#1| 127))} is VALID [2022-02-21 03:37:19,866 INFO L290 TraceCheckUtils]: 6: Hoare triple {3961#(< 0 (+ |ULTIMATE.start_base2flt_~e#1| 127))} assume base2flt_~m#1 % 4294967296 < 16777216; {3961#(< 0 (+ |ULTIMATE.start_base2flt_~e#1| 127))} is VALID [2022-02-21 03:37:19,867 INFO L290 TraceCheckUtils]: 5: Hoare triple {3961#(< 0 (+ |ULTIMATE.start_base2flt_~e#1| 127))} assume !(0 == base2flt_~m#1 % 4294967296); {3961#(< 0 (+ |ULTIMATE.start_base2flt_~e#1| 127))} is VALID [2022-02-21 03:37:19,867 INFO L290 TraceCheckUtils]: 4: Hoare triple {3886#true} main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {3961#(< 0 (+ |ULTIMATE.start_base2flt_~e#1| 127))} is VALID [2022-02-21 03:37:19,867 INFO L290 TraceCheckUtils]: 3: Hoare triple {3886#true} base2flt_#res#1 := base2flt_~__retres4~0#1; {3886#true} is VALID [2022-02-21 03:37:19,867 INFO L290 TraceCheckUtils]: 2: Hoare triple {3886#true} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {3886#true} is VALID [2022-02-21 03:37:19,868 INFO L290 TraceCheckUtils]: 1: Hoare triple {3886#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {3886#true} is VALID [2022-02-21 03:37:19,869 INFO L290 TraceCheckUtils]: 0: Hoare triple {3886#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(22, 2);call #Ultimate.allocInit(12, 3); {3886#true} is VALID [2022-02-21 03:37:19,869 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 03:37:19,869 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [67478916] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-21 03:37:19,870 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-21 03:37:19,870 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2022-02-21 03:37:19,870 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [139444412] [2022-02-21 03:37:19,870 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-21 03:37:19,870 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:37:19,871 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:19,871 INFO L85 PathProgramCache]: Analyzing trace with hash 257383, now seen corresponding path program 1 times [2022-02-21 03:37:19,871 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:19,871 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [397670386] [2022-02-21 03:37:19,871 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:19,871 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:19,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:19,880 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:19,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:19,882 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:19,913 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:19,913 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:19,913 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:19,913 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:19,914 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:37:19,914 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:19,914 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:19,914 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:19,914 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration5_Loop [2022-02-21 03:37:19,914 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:19,914 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:19,914 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 03:37:19,917 INFO L141 MapEliminator]: Using MapEliminator with SimplificationTechnique=SIMPLIFY_DDA XnfConversionTechnique=BOTTOM_UP_WITH_LOCAL_SIMPLIFICATION AddInequalities=false OnlyTrivialImplicationsArrayWrite=true OnlyTrivialImplicationsForModifiedArguments=true OnlyArgumentsInFormula=true [2022-02-21 03:37:19,966 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:19,966 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:37:19,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:19,967 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:19,968 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:19,980 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Waiting until timeout for monitored process [2022-02-21 03:37:19,980 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:37:19,981 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:20,017 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (21)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:20,018 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:20,018 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:20,019 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (exit command is (exit), workingDir is null) [2022-02-21 03:37:20,020 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Waiting until timeout for monitored process [2022-02-21 03:37:20,022 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:37:20,022 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:20,052 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:37:20,058 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (22)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:20,058 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:20,058 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:20,058 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:20,058 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:20,058 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:37:20,058 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:20,058 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:20,058 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:20,058 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration5_Loop [2022-02-21 03:37:20,058 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:20,058 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:20,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 03:37:20,064 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 03:37:20,124 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:20,124 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:37:20,124 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:20,125 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:20,127 INFO L229 MonitoredProcess]: Starting monitored process 23 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 03:37:20,132 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 03:37:20,138 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:20,138 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:20,138 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:20,138 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:20,138 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:20,140 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:20,140 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:20,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Waiting until timeout for monitored process [2022-02-21 03:37:20,155 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:37:20,172 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:37:20,172 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:37:20,172 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:20,172 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:20,174 INFO L229 MonitoredProcess]: Starting monitored process 24 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 03:37:20,175 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Waiting until timeout for monitored process [2022-02-21 03:37:20,176 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:37:20,176 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:37:20,176 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:37:20,176 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = 2*ULTIMATE.start_base2flt_~e#1 + 255 Supporting invariants [] [2022-02-21 03:37:20,192 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (23)] Ended with exit code 0 [2022-02-21 03:37:20,196 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:37:20,199 INFO L390 LassoCheck]: Loop: "assume !false;" "assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1;" "assume base2flt_~m#1 % 4294967296 < 16777216;" [2022-02-21 03:37:20,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:20,211 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:20,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:20,241 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:37:20,255 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:20,255 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:20,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {3985#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(22, 2);call #Ultimate.allocInit(12, 3); {3985#unseeded} is VALID [2022-02-21 03:37:20,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {3985#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {3985#unseeded} is VALID [2022-02-21 03:37:20,284 INFO L290 TraceCheckUtils]: 2: Hoare triple {3985#unseeded} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {3985#unseeded} is VALID [2022-02-21 03:37:20,285 INFO L290 TraceCheckUtils]: 3: Hoare triple {3985#unseeded} base2flt_#res#1 := base2flt_~__retres4~0#1; {3985#unseeded} is VALID [2022-02-21 03:37:20,299 INFO L290 TraceCheckUtils]: 4: Hoare triple {3985#unseeded} main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {3985#unseeded} is VALID [2022-02-21 03:37:20,300 INFO L290 TraceCheckUtils]: 5: Hoare triple {3985#unseeded} assume !(0 == base2flt_~m#1 % 4294967296); {3985#unseeded} is VALID [2022-02-21 03:37:20,302 INFO L290 TraceCheckUtils]: 6: Hoare triple {3985#unseeded} assume base2flt_~m#1 % 4294967296 < 16777216; {3985#unseeded} is VALID [2022-02-21 03:37:20,302 INFO L290 TraceCheckUtils]: 7: Hoare triple {3985#unseeded} assume !false; {3985#unseeded} is VALID [2022-02-21 03:37:20,303 INFO L290 TraceCheckUtils]: 8: Hoare triple {3985#unseeded} assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1; {3985#unseeded} is VALID [2022-02-21 03:37:20,303 INFO L290 TraceCheckUtils]: 9: Hoare triple {3985#unseeded} assume base2flt_~m#1 % 4294967296 < 16777216; {3985#unseeded} is VALID [2022-02-21 03:37:20,303 INFO L290 TraceCheckUtils]: 10: Hoare triple {3985#unseeded} assume !false; {3985#unseeded} is VALID [2022-02-21 03:37:20,303 INFO L290 TraceCheckUtils]: 11: Hoare triple {3985#unseeded} assume base2flt_~e#1 <= -128;base2flt_~__retres4~0#1 := 0; {3985#unseeded} is VALID [2022-02-21 03:37:20,304 INFO L290 TraceCheckUtils]: 12: Hoare triple {3985#unseeded} base2flt_#res#1 := base2flt_~__retres4~0#1; {3985#unseeded} is VALID [2022-02-21 03:37:20,304 INFO L290 TraceCheckUtils]: 13: Hoare triple {3985#unseeded} main_#t~ret23#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {3985#unseeded} is VALID [2022-02-21 03:37:20,304 INFO L290 TraceCheckUtils]: 14: Hoare triple {3985#unseeded} assume !(0 == base2flt_~m#1 % 4294967296); {3985#unseeded} is VALID [2022-02-21 03:37:20,304 INFO L290 TraceCheckUtils]: 15: Hoare triple {3985#unseeded} assume base2flt_~m#1 % 4294967296 < 16777216; {3985#unseeded} is VALID [2022-02-21 03:37:20,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:20,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:37:20,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:20,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:20,340 INFO L290 TraceCheckUtils]: 0: Hoare triple {3988#(>= oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))} assume !false; {3988#(>= oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))} is VALID [2022-02-21 03:37:20,341 INFO L290 TraceCheckUtils]: 1: Hoare triple {3988#(>= oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))} assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1; {4051#(and (<= (+ |ULTIMATE.start_base2flt_~e#1| 1) (div (+ oldRank0 (- 255)) 2)) (< 0 (+ (div (+ oldRank0 (- 255)) 2) 128)))} is VALID [2022-02-21 03:37:20,341 INFO L290 TraceCheckUtils]: 2: Hoare triple {4051#(and (<= (+ |ULTIMATE.start_base2flt_~e#1| 1) (div (+ oldRank0 (- 255)) 2)) (< 0 (+ (div (+ oldRank0 (- 255)) 2) 128)))} assume base2flt_~m#1 % 4294967296 < 16777216; {3998#(or (and (>= oldRank0 0) (> oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))) unseeded)} is VALID [2022-02-21 03:37:20,341 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 03:37:20,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:20,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:37:20,347 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:20,347 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,347 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 03:37:20,347 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 56 states and 82 transitions. cyclomatic complexity: 31 Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:20,393 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (24)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:20,462 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 56 states and 82 transitions. cyclomatic complexity: 31. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Result 92 states and 137 transitions. Complement of second has 5 states. [2022-02-21 03:37:20,463 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 03:37:20,463 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:20,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 56 states and 82 transitions. cyclomatic complexity: 31 [2022-02-21 03:37:20,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:20,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:20,463 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:20,463 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:20,463 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:20,463 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:20,464 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 92 states and 137 transitions. [2022-02-21 03:37:20,464 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2022-02-21 03:37:20,464 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:20,464 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:20,464 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 56 states and 82 transitions. cyclomatic complexity: 31 [2022-02-21 03:37:20,465 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 9 examples of accepted words. [2022-02-21 03:37:20,465 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:20,465 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:20,465 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:37:20,465 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 92 states and 137 transitions. cyclomatic complexity: 52 [2022-02-21 03:37:20,466 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 12 examples of accepted words. [2022-02-21 03:37:20,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:20,466 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,466 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:20,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:20,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:20,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:20,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:20,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,467 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:20,467 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:20,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:20,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 92 letters. Loop has 92 letters. [2022-02-21 03:37:20,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 92 letters. Loop has 92 letters. [2022-02-21 03:37:20,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 92 letters. Loop has 92 letters. [2022-02-21 03:37:20,468 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,468 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 56 letters. Loop has 56 letters. [2022-02-21 03:37:20,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 56 letters. Loop has 56 letters. [2022-02-21 03:37:20,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 56 letters. Loop has 56 letters. [2022-02-21 03:37:20,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:20,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:20,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:20,469 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,469 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:20,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:20,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:20,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:37:20,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:37:20,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,470 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:37:20,470 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:37:20,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:37:20,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:37:20,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:20,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:20,471 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,471 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:20,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:37:20,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:37:20,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:37:20,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:37:20,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,472 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:37:20,472 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:37:20,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:20,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:20,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 18 letters. Loop has 3 letters. [2022-02-21 03:37:20,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:20,473 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,473 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:20,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:20,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:20,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:20,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 17 letters. Loop has 3 letters. [2022-02-21 03:37:20,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,474 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:20,474 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:20,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:20,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:37:20,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:37:20,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:37:20,475 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,475 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:20,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:20,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:20,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:37:20,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:37:20,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,476 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:37:20,476 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:37:20,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:37:20,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 22 letters. Loop has 3 letters. [2022-02-21 03:37:20,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:20,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:20,477 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,477 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:20,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:37:20,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:37:20,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:37:20,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:37:20,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,478 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:37:20,478 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:37:20,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:37:20,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:37:20,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:37:20,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:20,479 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,479 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:20,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:20,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:37:20,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:37:20,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 20 letters. Loop has 3 letters. [2022-02-21 03:37:20,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,480 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:20,480 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:20,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:20,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 56 states and 82 transitions. cyclomatic complexity: 31 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:37:20,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:37:20,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,481 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 92 states and 137 transitions. cyclomatic complexity: 52 Stem has 21 letters. Loop has 3 letters. [2022-02-21 03:37:20,481 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,481 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:20,482 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 03:37:20,482 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2022-02-21 03:37:20,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 92 transitions. Stem has 16 letters. Loop has 3 letters. [2022-02-21 03:37:20,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 92 transitions. Stem has 19 letters. Loop has 3 letters. [2022-02-21 03:37:20,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,483 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 92 transitions. Stem has 16 letters. Loop has 6 letters. [2022-02-21 03:37:20,483 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:20,483 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 92 states and 137 transitions. cyclomatic complexity: 52 [2022-02-21 03:37:20,484 INFO L131 ngComponentsAnalysis]: Automaton has 4 accepting balls. 12 [2022-02-21 03:37:20,485 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 92 states to 80 states and 116 transitions. [2022-02-21 03:37:20,486 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 68 [2022-02-21 03:37:20,486 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 71 [2022-02-21 03:37:20,486 INFO L73 IsDeterministic]: Start isDeterministic. Operand 80 states and 116 transitions. [2022-02-21 03:37:20,486 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:37:20,486 INFO L681 BuchiCegarLoop]: Abstraction has 80 states and 116 transitions. [2022-02-21 03:37:20,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states and 116 transitions. [2022-02-21 03:37:20,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 59. [2022-02-21 03:37:20,487 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:20,487 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states and 116 transitions. Second operand has 59 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 58 states have internal predecessors, (86), 0 states have call successors, (0), 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 03:37:20,487 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states and 116 transitions. Second operand has 59 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 58 states have internal predecessors, (86), 0 states have call successors, (0), 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 03:37:20,488 INFO L87 Difference]: Start difference. First operand 80 states and 116 transitions. Second operand has 59 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 58 states have internal predecessors, (86), 0 states have call successors, (0), 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 03:37:20,488 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:20,489 INFO L93 Difference]: Finished difference Result 81 states and 117 transitions. [2022-02-21 03:37:20,489 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 117 transitions. [2022-02-21 03:37:20,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:20,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:20,489 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 58 states have internal predecessors, (86), 0 states have call successors, (0), 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 80 states and 116 transitions. [2022-02-21 03:37:20,489 INFO L87 Difference]: Start difference. First operand has 59 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 58 states have internal predecessors, (86), 0 states have call successors, (0), 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 80 states and 116 transitions. [2022-02-21 03:37:20,490 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:20,491 INFO L93 Difference]: Finished difference Result 82 states and 118 transitions. [2022-02-21 03:37:20,491 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 118 transitions. [2022-02-21 03:37:20,491 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:20,491 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:20,491 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:20,491 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:20,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 59 states have (on average 1.4576271186440677) internal successors, (86), 58 states have internal predecessors, (86), 0 states have call successors, (0), 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 03:37:20,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 86 transitions. [2022-02-21 03:37:20,492 INFO L704 BuchiCegarLoop]: Abstraction has 59 states and 86 transitions. [2022-02-21 03:37:20,492 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:37:20,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-21 03:37:20,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2022-02-21 03:37:20,493 INFO L87 Difference]: Start difference. First operand 59 states and 86 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 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 03:37:20,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:20,661 INFO L93 Difference]: Finished difference Result 113 states and 158 transitions. [2022-02-21 03:37:20,661 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-21 03:37:20,662 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 0 states have call successors, (0), 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 03:37:20,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:37:20,686 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 113 states and 158 transitions. [2022-02-21 03:37:20,695 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:37:20,697 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 113 states to 107 states and 152 transitions. [2022-02-21 03:37:20,697 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 88 [2022-02-21 03:37:20,698 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 88 [2022-02-21 03:37:20,698 INFO L73 IsDeterministic]: Start isDeterministic. Operand 107 states and 152 transitions. [2022-02-21 03:37:20,698 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:37:20,698 INFO L681 BuchiCegarLoop]: Abstraction has 107 states and 152 transitions. [2022-02-21 03:37:20,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states and 152 transitions. [2022-02-21 03:37:20,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 74. [2022-02-21 03:37:20,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:20,699 INFO L82 GeneralOperation]: Start isEquivalent. First operand 107 states and 152 transitions. Second operand has 74 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 73 states have internal predecessors, (108), 0 states have call successors, (0), 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 03:37:20,699 INFO L74 IsIncluded]: Start isIncluded. First operand 107 states and 152 transitions. Second operand has 74 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 73 states have internal predecessors, (108), 0 states have call successors, (0), 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 03:37:20,699 INFO L87 Difference]: Start difference. First operand 107 states and 152 transitions. Second operand has 74 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 73 states have internal predecessors, (108), 0 states have call successors, (0), 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 03:37:20,700 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:20,701 INFO L93 Difference]: Finished difference Result 107 states and 152 transitions. [2022-02-21 03:37:20,701 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 152 transitions. [2022-02-21 03:37:20,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:20,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:20,701 INFO L74 IsIncluded]: Start isIncluded. First operand has 74 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 73 states have internal predecessors, (108), 0 states have call successors, (0), 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 107 states and 152 transitions. [2022-02-21 03:37:20,702 INFO L87 Difference]: Start difference. First operand has 74 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 73 states have internal predecessors, (108), 0 states have call successors, (0), 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 107 states and 152 transitions. [2022-02-21 03:37:20,702 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:20,703 INFO L93 Difference]: Finished difference Result 107 states and 152 transitions. [2022-02-21 03:37:20,703 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 152 transitions. [2022-02-21 03:37:20,703 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:20,703 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:20,703 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:20,704 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:20,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 74 states have (on average 1.4594594594594594) internal successors, (108), 73 states have internal predecessors, (108), 0 states have call successors, (0), 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 03:37:20,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 108 transitions. [2022-02-21 03:37:20,704 INFO L704 BuchiCegarLoop]: Abstraction has 74 states and 108 transitions. [2022-02-21 03:37:20,704 INFO L587 BuchiCegarLoop]: Abstraction has 74 states and 108 transitions. [2022-02-21 03:37:20,704 INFO L425 BuchiCegarLoop]: ======== Iteration 6============ [2022-02-21 03:37:20,704 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 108 transitions. [2022-02-21 03:37:20,705 INFO L131 ngComponentsAnalysis]: Automaton has 2 accepting balls. 6 [2022-02-21 03:37:20,705 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:20,705 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:20,705 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] [2022-02-21 03:37:20,705 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:37:20,705 INFO L791 eck$LassoCheckResult]: Stem: 4690#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(22, 2);call #Ultimate.allocInit(12, 3); 4657#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 4658#L29 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 4695#L79 base2flt_#res#1 := base2flt_~__retres4~0#1; 4664#L80 main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 4665#L29-1 assume !(0 == base2flt_~m#1 % 4294967296); 4666#L35-1 assume base2flt_~m#1 % 4294967296 < 16777216; 4667#L47-3 assume !false; 4702#L38-1 assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1; 4679#L47-2 assume !(base2flt_~m#1 % 4294967296 < 16777216); 4670#L73-1 assume 0 == base2flt_~m#1 || 0 == ~bitwiseComplement(16777216);base2flt_~m#1 := 0; 4647#L76-15 assume !((1 == base2flt_~m#1 && (0 == 16777216 * (128 + base2flt_~e#1) || 1 == 16777216 * (128 + base2flt_~e#1))) || ((0 == base2flt_~m#1 || 1 == base2flt_~m#1) && 1 == 16777216 * (128 + base2flt_~e#1))); 4651#L77-9 assume !(0 == base2flt_~m#1 && (0 == 16777216 * (128 + base2flt_~e#1) || 1 == 16777216 * (128 + base2flt_~e#1))); 4652#L77-11 assume !((0 == base2flt_~m#1 || 1 == base2flt_~m#1) && 0 == 16777216 * (128 + base2flt_~e#1)); 4700#L77-13 assume !(base2flt_~m#1 >= 0 && 16777216 * (128 + base2flt_~e#1) >= 0);base2flt_~res~0#1 := base2flt_#t~nondet5#1;havoc base2flt_#t~nondet5#1; 4662#L77-15 base2flt_~__retres4~0#1 := base2flt_~res~0#1; 4663#L79-1 base2flt_#res#1 := base2flt_~__retres4~0#1; 4678#L80-1 main_#t~ret23#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 4684#L29-2 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 4644#L79-2 base2flt_#res#1 := base2flt_~__retres4~0#1; 4645#L80-2 main_#t~ret24#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~a~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~mb~2#1, main_~eb~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 4694#L29-3 assume !(0 == base2flt_~m#1 % 4294967296); 4659#L35-3 assume base2flt_~m#1 % 4294967296 < 16777216; 4660#L47-7 [2022-02-21 03:37:20,708 INFO L793 eck$LassoCheckResult]: Loop: 4660#L47-7 assume !false; 4649#L38-3 assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1; 4650#L47-6 assume base2flt_~m#1 % 4294967296 < 16777216; 4660#L47-7 [2022-02-21 03:37:20,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:20,709 INFO L85 PathProgramCache]: Analyzing trace with hash 488953666, now seen corresponding path program 1 times [2022-02-21 03:37:20,709 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:20,709 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129346289] [2022-02-21 03:37:20,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:20,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:20,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:20,743 INFO L290 TraceCheckUtils]: 0: Hoare triple {5206#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(22, 2);call #Ultimate.allocInit(12, 3); {5206#true} is VALID [2022-02-21 03:37:20,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {5206#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {5206#true} is VALID [2022-02-21 03:37:20,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {5206#true} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {5206#true} is VALID [2022-02-21 03:37:20,743 INFO L290 TraceCheckUtils]: 3: Hoare triple {5206#true} base2flt_#res#1 := base2flt_~__retres4~0#1; {5206#true} is VALID [2022-02-21 03:37:20,743 INFO L290 TraceCheckUtils]: 4: Hoare triple {5206#true} main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {5208#(= |ULTIMATE.start_base2flt_~e#1| 0)} is VALID [2022-02-21 03:37:20,744 INFO L290 TraceCheckUtils]: 5: Hoare triple {5208#(= |ULTIMATE.start_base2flt_~e#1| 0)} assume !(0 == base2flt_~m#1 % 4294967296); {5208#(= |ULTIMATE.start_base2flt_~e#1| 0)} is VALID [2022-02-21 03:37:20,744 INFO L290 TraceCheckUtils]: 6: Hoare triple {5208#(= |ULTIMATE.start_base2flt_~e#1| 0)} assume base2flt_~m#1 % 4294967296 < 16777216; {5208#(= |ULTIMATE.start_base2flt_~e#1| 0)} is VALID [2022-02-21 03:37:20,744 INFO L290 TraceCheckUtils]: 7: Hoare triple {5208#(= |ULTIMATE.start_base2flt_~e#1| 0)} assume !false; {5208#(= |ULTIMATE.start_base2flt_~e#1| 0)} is VALID [2022-02-21 03:37:20,744 INFO L290 TraceCheckUtils]: 8: Hoare triple {5208#(= |ULTIMATE.start_base2flt_~e#1| 0)} assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1; {5209#(<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1))} is VALID [2022-02-21 03:37:20,745 INFO L290 TraceCheckUtils]: 9: Hoare triple {5209#(<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1))} assume !(base2flt_~m#1 % 4294967296 < 16777216); {5209#(<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1))} is VALID [2022-02-21 03:37:20,745 INFO L290 TraceCheckUtils]: 10: Hoare triple {5209#(<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1))} assume 0 == base2flt_~m#1 || 0 == ~bitwiseComplement(16777216);base2flt_~m#1 := 0; {5210#(and (<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1)) (= |ULTIMATE.start_base2flt_~m#1| 0))} is VALID [2022-02-21 03:37:20,745 INFO L290 TraceCheckUtils]: 11: Hoare triple {5210#(and (<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1)) (= |ULTIMATE.start_base2flt_~m#1| 0))} assume !((1 == base2flt_~m#1 && (0 == 16777216 * (128 + base2flt_~e#1) || 1 == 16777216 * (128 + base2flt_~e#1))) || ((0 == base2flt_~m#1 || 1 == base2flt_~m#1) && 1 == 16777216 * (128 + base2flt_~e#1))); {5210#(and (<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1)) (= |ULTIMATE.start_base2flt_~m#1| 0))} is VALID [2022-02-21 03:37:20,746 INFO L290 TraceCheckUtils]: 12: Hoare triple {5210#(and (<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1)) (= |ULTIMATE.start_base2flt_~m#1| 0))} assume !(0 == base2flt_~m#1 && (0 == 16777216 * (128 + base2flt_~e#1) || 1 == 16777216 * (128 + base2flt_~e#1))); {5210#(and (<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1)) (= |ULTIMATE.start_base2flt_~m#1| 0))} is VALID [2022-02-21 03:37:20,746 INFO L290 TraceCheckUtils]: 13: Hoare triple {5210#(and (<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1)) (= |ULTIMATE.start_base2flt_~m#1| 0))} assume !((0 == base2flt_~m#1 || 1 == base2flt_~m#1) && 0 == 16777216 * (128 + base2flt_~e#1)); {5210#(and (<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1)) (= |ULTIMATE.start_base2flt_~m#1| 0))} is VALID [2022-02-21 03:37:20,747 INFO L290 TraceCheckUtils]: 14: Hoare triple {5210#(and (<= 0 (+ |ULTIMATE.start_base2flt_~e#1| 1)) (= |ULTIMATE.start_base2flt_~m#1| 0))} assume !(base2flt_~m#1 >= 0 && 16777216 * (128 + base2flt_~e#1) >= 0);base2flt_~res~0#1 := base2flt_#t~nondet5#1;havoc base2flt_#t~nondet5#1; {5207#false} is VALID [2022-02-21 03:37:20,747 INFO L290 TraceCheckUtils]: 15: Hoare triple {5207#false} base2flt_~__retres4~0#1 := base2flt_~res~0#1; {5207#false} is VALID [2022-02-21 03:37:20,747 INFO L290 TraceCheckUtils]: 16: Hoare triple {5207#false} base2flt_#res#1 := base2flt_~__retres4~0#1; {5207#false} is VALID [2022-02-21 03:37:20,747 INFO L290 TraceCheckUtils]: 17: Hoare triple {5207#false} main_#t~ret23#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {5207#false} is VALID [2022-02-21 03:37:20,747 INFO L290 TraceCheckUtils]: 18: Hoare triple {5207#false} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {5207#false} is VALID [2022-02-21 03:37:20,747 INFO L290 TraceCheckUtils]: 19: Hoare triple {5207#false} base2flt_#res#1 := base2flt_~__retres4~0#1; {5207#false} is VALID [2022-02-21 03:37:20,747 INFO L290 TraceCheckUtils]: 20: Hoare triple {5207#false} main_#t~ret24#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~a~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~mb~2#1, main_~eb~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {5207#false} is VALID [2022-02-21 03:37:20,747 INFO L290 TraceCheckUtils]: 21: Hoare triple {5207#false} assume !(0 == base2flt_~m#1 % 4294967296); {5207#false} is VALID [2022-02-21 03:37:20,747 INFO L290 TraceCheckUtils]: 22: Hoare triple {5207#false} assume base2flt_~m#1 % 4294967296 < 16777216; {5207#false} is VALID [2022-02-21 03:37:20,747 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 03:37:20,747 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:37:20,748 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129346289] [2022-02-21 03:37:20,748 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129346289] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:37:20,748 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:37:20,748 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-21 03:37:20,748 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1248389064] [2022-02-21 03:37:20,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:37:20,748 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:37:20,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:20,748 INFO L85 PathProgramCache]: Analyzing trace with hash 361648, now seen corresponding path program 1 times [2022-02-21 03:37:20,748 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:20,748 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [109680685] [2022-02-21 03:37:20,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:20,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:20,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:20,752 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:20,753 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:20,754 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:20,772 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:20,772 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:20,772 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:20,772 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:20,772 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:37:20,772 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:20,772 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:20,772 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:20,772 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration6_Loop [2022-02-21 03:37:20,772 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:20,772 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:20,773 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 03:37:20,776 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 03:37:20,832 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:20,832 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:37:20,832 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:20,832 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:20,833 INFO L229 MonitoredProcess]: Starting monitored process 25 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 03:37:20,833 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Waiting until timeout for monitored process [2022-02-21 03:37:20,835 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:37:20,835 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:20,856 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (25)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:20,857 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:20,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:20,857 INFO L229 MonitoredProcess]: Starting monitored process 26 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 03:37:20,858 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Waiting until timeout for monitored process [2022-02-21 03:37:20,860 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:37:20,860 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:20,892 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:37:20,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (26)] Ended with exit code 0 [2022-02-21 03:37:20,895 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:20,895 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:20,895 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:20,895 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:20,895 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:37:20,895 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:20,895 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:20,895 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:20,895 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration6_Loop [2022-02-21 03:37:20,895 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:20,895 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:20,896 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 03:37:20,901 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 03:37:20,963 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:20,963 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:37:20,963 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:20,963 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:20,964 INFO L229 MonitoredProcess]: Starting monitored process 27 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 03:37:20,965 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Waiting until timeout for monitored process [2022-02-21 03:37:20,967 INFO L120 nArgumentSynthesizer]: Termination Analysis Settings: Termination analysis: LINEAR_WITH_GUESSESNumber of strict supporting invariants: 0Number of non-strict supporting invariants: 1Consider only non-deceasing supporting invariants: trueSimplify termination arguments: trueSimplify supporting invariants: trueOverapproximate stem: false [2022-02-21 03:37:20,972 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:20,972 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:20,972 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:20,972 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:20,972 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:20,973 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:20,973 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:20,980 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:37:20,982 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:37:20,982 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:37:20,982 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:20,982 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:20,983 INFO L229 MonitoredProcess]: Starting monitored process 28 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 03:37:20,984 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Waiting until timeout for monitored process [2022-02-21 03:37:20,985 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:37:20,985 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:37:20,985 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:37:20,985 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = 2*ULTIMATE.start_base2flt_~e#1 + 255 Supporting invariants [] [2022-02-21 03:37:21,002 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (27)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:21,007 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:37:21,011 INFO L390 LassoCheck]: Loop: "assume !false;" "assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1;" "assume base2flt_~m#1 % 4294967296 < 16777216;" [2022-02-21 03:37:21,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:21,023 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:21,050 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:37:21,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:21,059 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:21,089 INFO L290 TraceCheckUtils]: 0: Hoare triple {5213#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(22, 2);call #Ultimate.allocInit(12, 3); {5213#unseeded} is VALID [2022-02-21 03:37:21,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {5213#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {5213#unseeded} is VALID [2022-02-21 03:37:21,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {5213#unseeded} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {5213#unseeded} is VALID [2022-02-21 03:37:21,090 INFO L290 TraceCheckUtils]: 3: Hoare triple {5213#unseeded} base2flt_#res#1 := base2flt_~__retres4~0#1; {5213#unseeded} is VALID [2022-02-21 03:37:21,091 INFO L290 TraceCheckUtils]: 4: Hoare triple {5213#unseeded} main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {5213#unseeded} is VALID [2022-02-21 03:37:21,091 INFO L290 TraceCheckUtils]: 5: Hoare triple {5213#unseeded} assume !(0 == base2flt_~m#1 % 4294967296); {5213#unseeded} is VALID [2022-02-21 03:37:21,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {5213#unseeded} assume base2flt_~m#1 % 4294967296 < 16777216; {5213#unseeded} is VALID [2022-02-21 03:37:21,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {5213#unseeded} assume !false; {5213#unseeded} is VALID [2022-02-21 03:37:21,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {5213#unseeded} assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1; {5213#unseeded} is VALID [2022-02-21 03:37:21,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {5213#unseeded} assume !(base2flt_~m#1 % 4294967296 < 16777216); {5213#unseeded} is VALID [2022-02-21 03:37:21,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {5213#unseeded} assume 0 == base2flt_~m#1 || 0 == ~bitwiseComplement(16777216);base2flt_~m#1 := 0; {5213#unseeded} is VALID [2022-02-21 03:37:21,092 INFO L290 TraceCheckUtils]: 11: Hoare triple {5213#unseeded} assume !((1 == base2flt_~m#1 && (0 == 16777216 * (128 + base2flt_~e#1) || 1 == 16777216 * (128 + base2flt_~e#1))) || ((0 == base2flt_~m#1 || 1 == base2flt_~m#1) && 1 == 16777216 * (128 + base2flt_~e#1))); {5213#unseeded} is VALID [2022-02-21 03:37:21,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {5213#unseeded} assume !(0 == base2flt_~m#1 && (0 == 16777216 * (128 + base2flt_~e#1) || 1 == 16777216 * (128 + base2flt_~e#1))); {5213#unseeded} is VALID [2022-02-21 03:37:21,093 INFO L290 TraceCheckUtils]: 13: Hoare triple {5213#unseeded} assume !((0 == base2flt_~m#1 || 1 == base2flt_~m#1) && 0 == 16777216 * (128 + base2flt_~e#1)); {5213#unseeded} is VALID [2022-02-21 03:37:21,093 INFO L290 TraceCheckUtils]: 14: Hoare triple {5213#unseeded} assume !(base2flt_~m#1 >= 0 && 16777216 * (128 + base2flt_~e#1) >= 0);base2flt_~res~0#1 := base2flt_#t~nondet5#1;havoc base2flt_#t~nondet5#1; {5213#unseeded} is VALID [2022-02-21 03:37:21,093 INFO L290 TraceCheckUtils]: 15: Hoare triple {5213#unseeded} base2flt_~__retres4~0#1 := base2flt_~res~0#1; {5213#unseeded} is VALID [2022-02-21 03:37:21,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {5213#unseeded} base2flt_#res#1 := base2flt_~__retres4~0#1; {5213#unseeded} is VALID [2022-02-21 03:37:21,094 INFO L290 TraceCheckUtils]: 17: Hoare triple {5213#unseeded} main_#t~ret23#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {5213#unseeded} is VALID [2022-02-21 03:37:21,094 INFO L290 TraceCheckUtils]: 18: Hoare triple {5213#unseeded} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {5213#unseeded} is VALID [2022-02-21 03:37:21,094 INFO L290 TraceCheckUtils]: 19: Hoare triple {5213#unseeded} base2flt_#res#1 := base2flt_~__retres4~0#1; {5213#unseeded} is VALID [2022-02-21 03:37:21,095 INFO L290 TraceCheckUtils]: 20: Hoare triple {5213#unseeded} main_#t~ret24#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~a~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~mb~2#1, main_~eb~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {5213#unseeded} is VALID [2022-02-21 03:37:21,095 INFO L290 TraceCheckUtils]: 21: Hoare triple {5213#unseeded} assume !(0 == base2flt_~m#1 % 4294967296); {5213#unseeded} is VALID [2022-02-21 03:37:21,095 INFO L290 TraceCheckUtils]: 22: Hoare triple {5213#unseeded} assume base2flt_~m#1 % 4294967296 < 16777216; {5213#unseeded} is VALID [2022-02-21 03:37:21,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:21,102 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:37:21,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:21,106 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:21,138 INFO L290 TraceCheckUtils]: 0: Hoare triple {5216#(>= oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))} assume !false; {5216#(>= oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))} is VALID [2022-02-21 03:37:21,139 INFO L290 TraceCheckUtils]: 1: Hoare triple {5216#(>= oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))} assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1; {5300#(and (<= (+ |ULTIMATE.start_base2flt_~e#1| 1) (div (+ oldRank0 (- 255)) 2)) (< 0 (+ (div (+ oldRank0 (- 255)) 2) 128)))} is VALID [2022-02-21 03:37:21,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {5300#(and (<= (+ |ULTIMATE.start_base2flt_~e#1| 1) (div (+ oldRank0 (- 255)) 2)) (< 0 (+ (div (+ oldRank0 (- 255)) 2) 128)))} assume base2flt_~m#1 % 4294967296 < 16777216; {5226#(or (and (>= oldRank0 0) (> oldRank0 (+ (* 2 |ULTIMATE.start_base2flt_~e#1|) 255))) unseeded)} is VALID [2022-02-21 03:37:21,140 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 03:37:21,140 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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 03:37:21,158 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 03:37:21,159 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:21,159 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,159 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 03:37:21,159 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 74 states and 108 transitions. cyclomatic complexity: 39 Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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 03:37:21,231 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (28)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:21,240 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 74 states and 108 transitions. cyclomatic complexity: 39. Second operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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) Result 78 states and 112 transitions. Complement of second has 4 states. [2022-02-21 03:37:21,240 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 03:37:21,240 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:21,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 74 states and 108 transitions. cyclomatic complexity: 39 [2022-02-21 03:37:21,240 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:21,240 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:21,240 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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 03:37:21,241 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:21,241 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:21,241 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:21,241 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 78 states and 112 transitions. [2022-02-21 03:37:21,242 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:37:21,242 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:21,242 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:21,242 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 74 states and 108 transitions. cyclomatic complexity: 39 [2022-02-21 03:37:21,243 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 6 examples of accepted words. [2022-02-21 03:37:21,243 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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 03:37:21,243 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:21,243 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:37:21,243 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 78 states and 112 transitions. cyclomatic complexity: 39 [2022-02-21 03:37:21,244 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:37:21,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 108 transitions. cyclomatic complexity: 39 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:21,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:21,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 112 transitions. cyclomatic complexity: 39 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:21,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 108 transitions. cyclomatic complexity: 39 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:21,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:21,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 112 transitions. cyclomatic complexity: 39 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:21,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 108 transitions. cyclomatic complexity: 39 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:21,244 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,244 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:21,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 112 transitions. cyclomatic complexity: 39 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:21,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 108 transitions. cyclomatic complexity: 39 Stem has 78 letters. Loop has 78 letters. [2022-02-21 03:37:21,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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) Stem has 78 letters. Loop has 78 letters. [2022-02-21 03:37:21,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 112 transitions. cyclomatic complexity: 39 Stem has 78 letters. Loop has 78 letters. [2022-02-21 03:37:21,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 108 transitions. cyclomatic complexity: 39 Stem has 74 letters. Loop has 74 letters. [2022-02-21 03:37:21,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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) Stem has 74 letters. Loop has 74 letters. [2022-02-21 03:37:21,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 112 transitions. cyclomatic complexity: 39 Stem has 74 letters. Loop has 74 letters. [2022-02-21 03:37:21,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 108 transitions. cyclomatic complexity: 39 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:21,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:21,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 112 transitions. cyclomatic complexity: 39 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:21,245 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,245 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 108 transitions. cyclomatic complexity: 39 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:21,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:21,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 112 transitions. cyclomatic complexity: 39 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:21,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 108 transitions. cyclomatic complexity: 39 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:37:21,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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) Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:37:21,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 112 transitions. cyclomatic complexity: 39 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:37:21,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 108 transitions. cyclomatic complexity: 39 Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:37:21,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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) Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:37:21,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 112 transitions. cyclomatic complexity: 39 Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:37:21,246 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,246 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 108 transitions. cyclomatic complexity: 39 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:21,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:21,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 112 transitions. cyclomatic complexity: 39 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:21,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 108 transitions. cyclomatic complexity: 39 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:37:21,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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) Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:37:21,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 112 transitions. cyclomatic complexity: 39 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:37:21,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 108 transitions. cyclomatic complexity: 39 Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:37:21,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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) Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:37:21,247 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,247 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 112 transitions. cyclomatic complexity: 39 Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:37:21,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 108 transitions. cyclomatic complexity: 39 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:21,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:21,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 112 transitions. cyclomatic complexity: 39 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:21,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 108 transitions. cyclomatic complexity: 39 Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:37:21,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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) Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:37:21,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 112 transitions. cyclomatic complexity: 39 Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:37:21,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 108 transitions. cyclomatic complexity: 39 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:21,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:21,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,248 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 112 transitions. cyclomatic complexity: 39 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:21,248 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 74 states and 108 transitions. cyclomatic complexity: 39 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:37:21,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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) Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:37:21,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,249 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 78 states and 112 transitions. cyclomatic complexity: 39 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:37:21,249 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,249 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:21,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.5) internal successors, (26), 4 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 03:37:21,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-02-21 03:37:21,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 74 transitions. Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:21,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 74 transitions. Stem has 26 letters. Loop has 3 letters. [2022-02-21 03:37:21,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,250 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 74 transitions. Stem has 23 letters. Loop has 6 letters. [2022-02-21 03:37:21,250 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,250 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 78 states and 112 transitions. cyclomatic complexity: 39 [2022-02-21 03:37:21,251 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:37:21,252 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 78 states to 71 states and 104 transitions. [2022-02-21 03:37:21,252 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 54 [2022-02-21 03:37:21,252 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 54 [2022-02-21 03:37:21,252 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 104 transitions. [2022-02-21 03:37:21,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:37:21,252 INFO L681 BuchiCegarLoop]: Abstraction has 71 states and 104 transitions. [2022-02-21 03:37:21,253 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states and 104 transitions. [2022-02-21 03:37:21,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 71. [2022-02-21 03:37:21,254 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:21,254 INFO L82 GeneralOperation]: Start isEquivalent. First operand 71 states and 104 transitions. Second operand has 71 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 70 states have internal predecessors, (104), 0 states have call successors, (0), 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 03:37:21,254 INFO L74 IsIncluded]: Start isIncluded. First operand 71 states and 104 transitions. Second operand has 71 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 70 states have internal predecessors, (104), 0 states have call successors, (0), 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 03:37:21,254 INFO L87 Difference]: Start difference. First operand 71 states and 104 transitions. Second operand has 71 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 70 states have internal predecessors, (104), 0 states have call successors, (0), 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 03:37:21,254 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:21,255 INFO L93 Difference]: Finished difference Result 73 states and 106 transitions. [2022-02-21 03:37:21,255 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 106 transitions. [2022-02-21 03:37:21,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:21,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:21,256 INFO L74 IsIncluded]: Start isIncluded. First operand has 71 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 70 states have internal predecessors, (104), 0 states have call successors, (0), 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 71 states and 104 transitions. [2022-02-21 03:37:21,256 INFO L87 Difference]: Start difference. First operand has 71 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 70 states have internal predecessors, (104), 0 states have call successors, (0), 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 71 states and 104 transitions. [2022-02-21 03:37:21,256 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:21,257 INFO L93 Difference]: Finished difference Result 73 states and 106 transitions. [2022-02-21 03:37:21,257 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 106 transitions. [2022-02-21 03:37:21,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:21,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:21,257 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:21,257 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:21,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 71 states have (on average 1.4647887323943662) internal successors, (104), 70 states have internal predecessors, (104), 0 states have call successors, (0), 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 03:37:21,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 104 transitions. [2022-02-21 03:37:21,258 INFO L704 BuchiCegarLoop]: Abstraction has 71 states and 104 transitions. [2022-02-21 03:37:21,258 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:37:21,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-21 03:37:21,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-21 03:37:21,259 INFO L87 Difference]: Start difference. First operand 71 states and 104 transitions. Second operand has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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 03:37:21,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:21,392 INFO L93 Difference]: Finished difference Result 91 states and 129 transitions. [2022-02-21 03:37:21,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-21 03:37:21,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.6) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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 03:37:21,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:37:21,409 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 91 states and 129 transitions. [2022-02-21 03:37:21,410 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:37:21,411 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 91 states to 91 states and 129 transitions. [2022-02-21 03:37:21,412 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 74 [2022-02-21 03:37:21,412 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 74 [2022-02-21 03:37:21,412 INFO L73 IsDeterministic]: Start isDeterministic. Operand 91 states and 129 transitions. [2022-02-21 03:37:21,412 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is not deterministic. [2022-02-21 03:37:21,412 INFO L681 BuchiCegarLoop]: Abstraction has 91 states and 129 transitions. [2022-02-21 03:37:21,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states and 129 transitions. [2022-02-21 03:37:21,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 76. [2022-02-21 03:37:21,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 03:37:21,414 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states and 129 transitions. Second operand has 76 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 75 states have internal predecessors, (110), 0 states have call successors, (0), 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 03:37:21,414 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states and 129 transitions. Second operand has 76 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 75 states have internal predecessors, (110), 0 states have call successors, (0), 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 03:37:21,414 INFO L87 Difference]: Start difference. First operand 91 states and 129 transitions. Second operand has 76 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 75 states have internal predecessors, (110), 0 states have call successors, (0), 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 03:37:21,415 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:21,416 INFO L93 Difference]: Finished difference Result 93 states and 131 transitions. [2022-02-21 03:37:21,416 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 131 transitions. [2022-02-21 03:37:21,416 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:21,416 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:21,416 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 75 states have internal predecessors, (110), 0 states have call successors, (0), 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 91 states and 129 transitions. [2022-02-21 03:37:21,417 INFO L87 Difference]: Start difference. First operand has 76 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 75 states have internal predecessors, (110), 0 states have call successors, (0), 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 91 states and 129 transitions. [2022-02-21 03:37:21,417 INFO L149 Difference]: Subtrahend was not deterministic. Recomputing result with determinization. [2022-02-21 03:37:21,418 INFO L93 Difference]: Finished difference Result 93 states and 131 transitions. [2022-02-21 03:37:21,419 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 131 transitions. [2022-02-21 03:37:21,419 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 03:37:21,419 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 03:37:21,419 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 03:37:21,419 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 03:37:21,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 76 states have (on average 1.4473684210526316) internal successors, (110), 75 states have internal predecessors, (110), 0 states have call successors, (0), 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 03:37:21,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 110 transitions. [2022-02-21 03:37:21,420 INFO L704 BuchiCegarLoop]: Abstraction has 76 states and 110 transitions. [2022-02-21 03:37:21,420 INFO L587 BuchiCegarLoop]: Abstraction has 76 states and 110 transitions. [2022-02-21 03:37:21,420 INFO L425 BuchiCegarLoop]: ======== Iteration 7============ [2022-02-21 03:37:21,420 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 110 transitions. [2022-02-21 03:37:21,421 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 3 [2022-02-21 03:37:21,421 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:21,421 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:21,421 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] [2022-02-21 03:37:21,421 INFO L843 BuchiCegarLoop]: Counterexample loop histogram [1, 1, 1] [2022-02-21 03:37:21,422 INFO L791 eck$LassoCheckResult]: Stem: 5943#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(22, 2);call #Ultimate.allocInit(12, 3); 5911#L-1 assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 5912#L29 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 5947#L79 base2flt_#res#1 := base2flt_~__retres4~0#1; 5915#L80 main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 5916#L29-1 assume !(0 == base2flt_~m#1 % 4294967296); 5919#L35-1 assume base2flt_~m#1 % 4294967296 < 16777216; 5920#L47-3 assume !false; 5955#L38-1 assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1; 5964#L47-2 assume !(base2flt_~m#1 % 4294967296 < 16777216); 5965#L73-1 assume 0 == base2flt_~m#1 || 0 == ~bitwiseComplement(16777216);base2flt_~m#1 := 0; 5975#L76-15 assume !((1 == base2flt_~m#1 && (0 == 16777216 * (128 + base2flt_~e#1) || 1 == 16777216 * (128 + base2flt_~e#1))) || ((0 == base2flt_~m#1 || 1 == base2flt_~m#1) && 1 == 16777216 * (128 + base2flt_~e#1))); 5974#L77-9 assume !(0 == base2flt_~m#1 && (0 == 16777216 * (128 + base2flt_~e#1) || 1 == 16777216 * (128 + base2flt_~e#1))); 5973#L77-11 assume !((0 == base2flt_~m#1 || 1 == base2flt_~m#1) && 0 == 16777216 * (128 + base2flt_~e#1)); 5954#L77-13 assume base2flt_~m#1 >= 0 && 16777216 * (128 + base2flt_~e#1) >= 0;abs_77 := (if base2flt_~m#1 < 16777216 * (128 + base2flt_~e#1) then 16777216 * (128 + base2flt_~e#1) else base2flt_~m#1);assume base2flt_~m#1 >= 0 && 16777216 * (128 + base2flt_~e#1) >= 0;assume base2flt_~res~0#1 >= abs_77; 5917#L77-15 base2flt_~__retres4~0#1 := base2flt_~res~0#1; 5918#L79-1 base2flt_#res#1 := base2flt_~__retres4~0#1; 5933#L80-1 main_#t~ret23#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 5937#L29-2 assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; 5903#L79-2 base2flt_#res#1 := base2flt_~__retres4~0#1; 5904#L80-2 main_#t~ret24#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~a~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~mb~2#1, main_~eb~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; 5946#L29-3 assume !(0 == base2flt_~m#1 % 4294967296); 5913#L35-3 assume !(base2flt_~m#1 % 4294967296 < 16777216); 5914#L57-11 [2022-02-21 03:37:21,422 INFO L793 eck$LassoCheckResult]: Loop: 5914#L57-11 assume !false; 5921#L58-3 assume base2flt_~m#1 % 4294967296 >= 33554432; 5922#L59-3 assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 / 2; 5914#L57-11 [2022-02-21 03:37:21,422 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:21,422 INFO L85 PathProgramCache]: Analyzing trace with hash -191104678, now seen corresponding path program 1 times [2022-02-21 03:37:21,423 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:21,423 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [789634206] [2022-02-21 03:37:21,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:21,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:21,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:21,465 INFO L290 TraceCheckUtils]: 0: Hoare triple {6422#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(22, 2);call #Ultimate.allocInit(12, 3); {6422#true} is VALID [2022-02-21 03:37:21,465 INFO L290 TraceCheckUtils]: 1: Hoare triple {6422#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {6422#true} is VALID [2022-02-21 03:37:21,465 INFO L290 TraceCheckUtils]: 2: Hoare triple {6422#true} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {6422#true} is VALID [2022-02-21 03:37:21,465 INFO L290 TraceCheckUtils]: 3: Hoare triple {6422#true} base2flt_#res#1 := base2flt_~__retres4~0#1; {6422#true} is VALID [2022-02-21 03:37:21,465 INFO L290 TraceCheckUtils]: 4: Hoare triple {6422#true} main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {6424#(= (+ (- 1) |ULTIMATE.start_base2flt_~m#1|) 0)} is VALID [2022-02-21 03:37:21,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {6424#(= (+ (- 1) |ULTIMATE.start_base2flt_~m#1|) 0)} assume !(0 == base2flt_~m#1 % 4294967296); {6424#(= (+ (- 1) |ULTIMATE.start_base2flt_~m#1|) 0)} is VALID [2022-02-21 03:37:21,466 INFO L290 TraceCheckUtils]: 6: Hoare triple {6424#(= (+ (- 1) |ULTIMATE.start_base2flt_~m#1|) 0)} assume base2flt_~m#1 % 4294967296 < 16777216; {6424#(= (+ (- 1) |ULTIMATE.start_base2flt_~m#1|) 0)} is VALID [2022-02-21 03:37:21,466 INFO L290 TraceCheckUtils]: 7: Hoare triple {6424#(= (+ (- 1) |ULTIMATE.start_base2flt_~m#1|) 0)} assume !false; {6424#(= (+ (- 1) |ULTIMATE.start_base2flt_~m#1|) 0)} is VALID [2022-02-21 03:37:21,467 INFO L290 TraceCheckUtils]: 8: Hoare triple {6424#(= (+ (- 1) |ULTIMATE.start_base2flt_~m#1|) 0)} assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1; {6425#(and (not (<= (+ (div |ULTIMATE.start_base2flt_~m#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_base2flt_~m#1| 2))} is VALID [2022-02-21 03:37:21,467 INFO L290 TraceCheckUtils]: 9: Hoare triple {6425#(and (not (<= (+ (div |ULTIMATE.start_base2flt_~m#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_base2flt_~m#1| 2))} assume !(base2flt_~m#1 % 4294967296 < 16777216); {6423#false} is VALID [2022-02-21 03:37:21,467 INFO L290 TraceCheckUtils]: 10: Hoare triple {6423#false} assume 0 == base2flt_~m#1 || 0 == ~bitwiseComplement(16777216);base2flt_~m#1 := 0; {6423#false} is VALID [2022-02-21 03:37:21,467 INFO L290 TraceCheckUtils]: 11: Hoare triple {6423#false} assume !((1 == base2flt_~m#1 && (0 == 16777216 * (128 + base2flt_~e#1) || 1 == 16777216 * (128 + base2flt_~e#1))) || ((0 == base2flt_~m#1 || 1 == base2flt_~m#1) && 1 == 16777216 * (128 + base2flt_~e#1))); {6423#false} is VALID [2022-02-21 03:37:21,468 INFO L290 TraceCheckUtils]: 12: Hoare triple {6423#false} assume !(0 == base2flt_~m#1 && (0 == 16777216 * (128 + base2flt_~e#1) || 1 == 16777216 * (128 + base2flt_~e#1))); {6423#false} is VALID [2022-02-21 03:37:21,468 INFO L290 TraceCheckUtils]: 13: Hoare triple {6423#false} assume !((0 == base2flt_~m#1 || 1 == base2flt_~m#1) && 0 == 16777216 * (128 + base2flt_~e#1)); {6423#false} is VALID [2022-02-21 03:37:21,468 INFO L290 TraceCheckUtils]: 14: Hoare triple {6423#false} assume base2flt_~m#1 >= 0 && 16777216 * (128 + base2flt_~e#1) >= 0;abs_77 := (if base2flt_~m#1 < 16777216 * (128 + base2flt_~e#1) then 16777216 * (128 + base2flt_~e#1) else base2flt_~m#1);assume base2flt_~m#1 >= 0 && 16777216 * (128 + base2flt_~e#1) >= 0;assume base2flt_~res~0#1 >= abs_77; {6423#false} is VALID [2022-02-21 03:37:21,468 INFO L290 TraceCheckUtils]: 15: Hoare triple {6423#false} base2flt_~__retres4~0#1 := base2flt_~res~0#1; {6423#false} is VALID [2022-02-21 03:37:21,468 INFO L290 TraceCheckUtils]: 16: Hoare triple {6423#false} base2flt_#res#1 := base2flt_~__retres4~0#1; {6423#false} is VALID [2022-02-21 03:37:21,468 INFO L290 TraceCheckUtils]: 17: Hoare triple {6423#false} main_#t~ret23#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {6423#false} is VALID [2022-02-21 03:37:21,468 INFO L290 TraceCheckUtils]: 18: Hoare triple {6423#false} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {6423#false} is VALID [2022-02-21 03:37:21,468 INFO L290 TraceCheckUtils]: 19: Hoare triple {6423#false} base2flt_#res#1 := base2flt_~__retres4~0#1; {6423#false} is VALID [2022-02-21 03:37:21,469 INFO L290 TraceCheckUtils]: 20: Hoare triple {6423#false} main_#t~ret24#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~a~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~mb~2#1, main_~eb~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {6423#false} is VALID [2022-02-21 03:37:21,469 INFO L290 TraceCheckUtils]: 21: Hoare triple {6423#false} assume !(0 == base2flt_~m#1 % 4294967296); {6423#false} is VALID [2022-02-21 03:37:21,469 INFO L290 TraceCheckUtils]: 22: Hoare triple {6423#false} assume !(base2flt_~m#1 % 4294967296 < 16777216); {6423#false} is VALID [2022-02-21 03:37:21,469 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 03:37:21,469 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 03:37:21,469 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [789634206] [2022-02-21 03:37:21,469 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [789634206] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 03:37:21,470 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 03:37:21,470 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-21 03:37:21,470 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131840488] [2022-02-21 03:37:21,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 03:37:21,470 INFO L796 eck$LassoCheckResult]: stem already infeasible [2022-02-21 03:37:21,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:21,470 INFO L85 PathProgramCache]: Analyzing trace with hash 387407, now seen corresponding path program 1 times [2022-02-21 03:37:21,471 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 03:37:21,471 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [624747816] [2022-02-21 03:37:21,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 03:37:21,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 03:37:21,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:21,475 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-21 03:37:21,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-21 03:37:21,478 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-21 03:37:21,497 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:21,497 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:21,497 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:21,497 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:21,497 INFO L129 ssoRankerPreferences]: Use exernal solver: true [2022-02-21 03:37:21,497 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:21,497 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:21,497 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:21,498 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration7_Loop [2022-02-21 03:37:21,498 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:21,498 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:21,498 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 03:37:21,503 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 03:37:21,576 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:21,576 INFO L404 LassoAnalysis]: Checking for nontermination... [2022-02-21 03:37:21,577 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:21,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:21,578 INFO L229 MonitoredProcess]: Starting monitored process 29 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 03:37:21,578 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Waiting until timeout for monitored process [2022-02-21 03:37:21,580 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 0 Nilpotent components: true [2022-02-21 03:37:21,580 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:21,612 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (29)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:21,612 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:21,612 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:21,613 INFO L229 MonitoredProcess]: Starting monitored process 30 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 03:37:21,614 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Waiting until timeout for monitored process [2022-02-21 03:37:21,616 INFO L148 nArgumentSynthesizer]: Nontermination analysis: NONLINEAR Allow bounded executions: true Number of generalized eigenvectors: 3 Nilpotent components: true [2022-02-21 03:37:21,616 INFO L160 nArgumentSynthesizer]: Using integer mode. [2022-02-21 03:37:21,651 INFO L444 LassoAnalysis]: Proving nontermination failed: No geometric nontermination argument exists. [2022-02-21 03:37:21,666 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (30)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:21,667 INFO L210 LassoAnalysis]: Preferences: [2022-02-21 03:37:21,667 INFO L126 ssoRankerPreferences]: Compute integeral hull: false [2022-02-21 03:37:21,667 INFO L127 ssoRankerPreferences]: Enable LassoPartitioneer: true [2022-02-21 03:37:21,667 INFO L128 ssoRankerPreferences]: Term annotations enabled: false [2022-02-21 03:37:21,667 INFO L129 ssoRankerPreferences]: Use exernal solver: false [2022-02-21 03:37:21,667 INFO L130 ssoRankerPreferences]: SMT solver command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:21,667 INFO L131 ssoRankerPreferences]: Dump SMT script to file: false [2022-02-21 03:37:21,667 INFO L132 ssoRankerPreferences]: Path of dumped script: [2022-02-21 03:37:21,667 INFO L133 ssoRankerPreferences]: Filename of dumped script: soft_float_2a.c.cil.c_Iteration7_Loop [2022-02-21 03:37:21,667 INFO L134 ssoRankerPreferences]: MapElimAlgo: Frank [2022-02-21 03:37:21,667 INFO L276 LassoAnalysis]: Starting lasso preprocessing... [2022-02-21 03:37:21,668 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 03:37:21,672 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 03:37:21,749 INFO L294 LassoAnalysis]: Preprocessing complete. [2022-02-21 03:37:21,749 INFO L490 LassoAnalysis]: Using template 'affine'. [2022-02-21 03:37:21,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:21,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:21,750 INFO L229 MonitoredProcess]: Starting monitored process 31 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 03:37:21,751 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Waiting until timeout for monitored process [2022-02-21 03:37:21,752 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 03:37:21,758 INFO L338 nArgumentSynthesizer]: Template has degree 0. [2022-02-21 03:37:21,758 INFO L351 nArgumentSynthesizer]: There is no stem transition; disabling supporting invariant generation. [2022-02-21 03:37:21,759 INFO L203 nArgumentSynthesizer]: 1 stem disjuncts [2022-02-21 03:37:21,759 INFO L204 nArgumentSynthesizer]: 1 loop disjuncts [2022-02-21 03:37:21,759 INFO L205 nArgumentSynthesizer]: 2 template conjuncts. [2022-02-21 03:37:21,759 INFO L401 nArgumentSynthesizer]: We have 2 Motzkin's Theorem applications. [2022-02-21 03:37:21,759 INFO L402 nArgumentSynthesizer]: A total of 0 supporting invariants were added. [2022-02-21 03:37:21,783 INFO L420 nArgumentSynthesizer]: Found a termination argument, trying to simplify. [2022-02-21 03:37:21,785 INFO L443 ModelExtractionUtils]: Simplification made 3 calls to the SMT solver. [2022-02-21 03:37:21,785 INFO L444 ModelExtractionUtils]: 0 out of 3 variables were initially zero. Simplification set additionally 0 variables to zero. [2022-02-21 03:37:21,785 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 [2022-02-21 03:37:21,785 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 03:37:21,786 INFO L229 MonitoredProcess]: Starting monitored process 32 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 03:37:21,798 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Waiting until timeout for monitored process [2022-02-21 03:37:21,798 INFO L435 nArgumentSynthesizer]: Simplifying supporting invariants... [2022-02-21 03:37:21,798 INFO L438 nArgumentSynthesizer]: Removed 0 redundant supporting invariants from a total of 0. [2022-02-21 03:37:21,798 INFO L513 LassoAnalysis]: Proved termination. [2022-02-21 03:37:21,798 INFO L515 LassoAnalysis]: Termination argument consisting of: Ranking function f(ULTIMATE.start_base2flt_~e#1) = -2*ULTIMATE.start_base2flt_~e#1 + 253 Supporting invariants [] [2022-02-21 03:37:21,814 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (31)] Ended with exit code 0 [2022-02-21 03:37:21,818 INFO L297 tatePredicateManager]: 0 out of 0 supporting invariants were superfluous and have been removed [2022-02-21 03:37:21,821 INFO L390 LassoCheck]: Loop: "assume !false;" "assume base2flt_~m#1 % 4294967296 >= 33554432;" "assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 / 2;" [2022-02-21 03:37:21,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:21,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 03:37:21,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:21,856 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-21 03:37:21,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:21,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:21,903 INFO L290 TraceCheckUtils]: 0: Hoare triple {6428#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(22, 2);call #Ultimate.allocInit(12, 3); {6428#unseeded} is VALID [2022-02-21 03:37:21,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {6428#unseeded} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet18#1, main_#t~nondet19#1, main_#t~nondet20#1, main_#t~nondet21#1, main_#t~ret22#1, main_#t~ret23#1, main_#t~ret24#1, main_#t~ret25#1, main_#t~ret26#1, main_~a~0#1, main_~ma~2#1, main_~ea~2#1, main_~b~0#1, main_~mb~2#1, main_~eb~2#1, main_~r_mul~0#1, main_~zero~0#1, main_~one~0#1, main_~sa~0#1, main_~tmp~2#1, main_~tmp___0~0#1, main_~tmp___1~0#1, main_~__retres16~0#1;havoc main_~a~0#1;main_~ma~2#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1;main_~ea~2#1 := main_#t~nondet19#1;havoc main_#t~nondet19#1;havoc main_~b~0#1;main_~mb~2#1 := main_#t~nondet20#1;havoc main_#t~nondet20#1;main_~eb~2#1 := main_#t~nondet21#1;havoc main_#t~nondet21#1;havoc main_~r_mul~0#1;havoc main_~zero~0#1;havoc main_~one~0#1;havoc main_~sa~0#1;havoc main_~tmp~2#1;havoc main_~tmp___0~0#1;havoc main_~tmp___1~0#1;havoc main_~__retres16~0#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 0, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {6428#unseeded} is VALID [2022-02-21 03:37:21,904 INFO L290 TraceCheckUtils]: 2: Hoare triple {6428#unseeded} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {6428#unseeded} is VALID [2022-02-21 03:37:21,904 INFO L290 TraceCheckUtils]: 3: Hoare triple {6428#unseeded} base2flt_#res#1 := base2flt_~__retres4~0#1; {6428#unseeded} is VALID [2022-02-21 03:37:21,904 INFO L290 TraceCheckUtils]: 4: Hoare triple {6428#unseeded} main_#t~ret22#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~zero~0#1 := main_#t~ret22#1;havoc main_#t~ret22#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := 1, 0;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {6428#unseeded} is VALID [2022-02-21 03:37:21,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {6428#unseeded} assume !(0 == base2flt_~m#1 % 4294967296); {6428#unseeded} is VALID [2022-02-21 03:37:21,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {6428#unseeded} assume base2flt_~m#1 % 4294967296 < 16777216; {6428#unseeded} is VALID [2022-02-21 03:37:21,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {6428#unseeded} assume !false; {6428#unseeded} is VALID [2022-02-21 03:37:21,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {6428#unseeded} assume !(base2flt_~e#1 <= -128);base2flt_~e#1 := base2flt_~e#1 - 1;base2flt_~m#1 := 2 * base2flt_~m#1; {6428#unseeded} is VALID [2022-02-21 03:37:21,905 INFO L290 TraceCheckUtils]: 9: Hoare triple {6428#unseeded} assume !(base2flt_~m#1 % 4294967296 < 16777216); {6428#unseeded} is VALID [2022-02-21 03:37:21,906 INFO L290 TraceCheckUtils]: 10: Hoare triple {6428#unseeded} assume 0 == base2flt_~m#1 || 0 == ~bitwiseComplement(16777216);base2flt_~m#1 := 0; {6428#unseeded} is VALID [2022-02-21 03:37:21,906 INFO L290 TraceCheckUtils]: 11: Hoare triple {6428#unseeded} assume !((1 == base2flt_~m#1 && (0 == 16777216 * (128 + base2flt_~e#1) || 1 == 16777216 * (128 + base2flt_~e#1))) || ((0 == base2flt_~m#1 || 1 == base2flt_~m#1) && 1 == 16777216 * (128 + base2flt_~e#1))); {6428#unseeded} is VALID [2022-02-21 03:37:21,906 INFO L290 TraceCheckUtils]: 12: Hoare triple {6428#unseeded} assume !(0 == base2flt_~m#1 && (0 == 16777216 * (128 + base2flt_~e#1) || 1 == 16777216 * (128 + base2flt_~e#1))); {6428#unseeded} is VALID [2022-02-21 03:37:21,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {6428#unseeded} assume !((0 == base2flt_~m#1 || 1 == base2flt_~m#1) && 0 == 16777216 * (128 + base2flt_~e#1)); {6428#unseeded} is VALID [2022-02-21 03:37:21,911 INFO L290 TraceCheckUtils]: 14: Hoare triple {6428#unseeded} assume base2flt_~m#1 >= 0 && 16777216 * (128 + base2flt_~e#1) >= 0;abs_77 := (if base2flt_~m#1 < 16777216 * (128 + base2flt_~e#1) then 16777216 * (128 + base2flt_~e#1) else base2flt_~m#1);assume base2flt_~m#1 >= 0 && 16777216 * (128 + base2flt_~e#1) >= 0;assume base2flt_~res~0#1 >= abs_77; {6428#unseeded} is VALID [2022-02-21 03:37:21,912 INFO L290 TraceCheckUtils]: 15: Hoare triple {6428#unseeded} base2flt_~__retres4~0#1 := base2flt_~res~0#1; {6428#unseeded} is VALID [2022-02-21 03:37:21,912 INFO L290 TraceCheckUtils]: 16: Hoare triple {6428#unseeded} base2flt_#res#1 := base2flt_~__retres4~0#1; {6428#unseeded} is VALID [2022-02-21 03:37:21,912 INFO L290 TraceCheckUtils]: 17: Hoare triple {6428#unseeded} main_#t~ret23#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~one~0#1 := main_#t~ret23#1;havoc main_#t~ret23#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~ma~2#1, main_~ea~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {6428#unseeded} is VALID [2022-02-21 03:37:21,912 INFO L290 TraceCheckUtils]: 18: Hoare triple {6428#unseeded} assume 0 == base2flt_~m#1 % 4294967296;base2flt_~__retres4~0#1 := 0; {6428#unseeded} is VALID [2022-02-21 03:37:21,913 INFO L290 TraceCheckUtils]: 19: Hoare triple {6428#unseeded} base2flt_#res#1 := base2flt_~__retres4~0#1; {6428#unseeded} is VALID [2022-02-21 03:37:21,913 INFO L290 TraceCheckUtils]: 20: Hoare triple {6428#unseeded} main_#t~ret24#1 := base2flt_#res#1;assume { :end_inline_base2flt } true;main_~a~0#1 := main_#t~ret24#1;havoc main_#t~ret24#1;assume { :begin_inline_base2flt } true;base2flt_#in~m#1, base2flt_#in~e#1 := main_~mb~2#1, main_~eb~2#1;havoc base2flt_#res#1;havoc base2flt_#t~nondet4#1, base2flt_#t~nondet5#1, base2flt_~m#1, base2flt_~e#1, base2flt_~res~0#1, base2flt_~__retres4~0#1;base2flt_~m#1 := base2flt_#in~m#1;base2flt_~e#1 := base2flt_#in~e#1;havoc base2flt_~res~0#1;havoc base2flt_~__retres4~0#1; {6428#unseeded} is VALID [2022-02-21 03:37:21,913 INFO L290 TraceCheckUtils]: 21: Hoare triple {6428#unseeded} assume !(0 == base2flt_~m#1 % 4294967296); {6428#unseeded} is VALID [2022-02-21 03:37:21,913 INFO L290 TraceCheckUtils]: 22: Hoare triple {6428#unseeded} assume !(base2flt_~m#1 % 4294967296 < 16777216); {6428#unseeded} is VALID [2022-02-21 03:37:21,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:21,918 INFO L263 TraceCheckSpWp]: Trace formula consists of 9 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-21 03:37:21,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 03:37:21,921 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-21 03:37:21,935 INFO L290 TraceCheckUtils]: 0: Hoare triple {6431#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume !false; {6431#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} is VALID [2022-02-21 03:37:21,936 INFO L290 TraceCheckUtils]: 1: Hoare triple {6431#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume base2flt_~m#1 % 4294967296 >= 33554432; {6431#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} is VALID [2022-02-21 03:37:21,936 INFO L290 TraceCheckUtils]: 2: Hoare triple {6431#(>= oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))} assume !(base2flt_~e#1 >= 127);base2flt_~e#1 := 1 + base2flt_~e#1;base2flt_~m#1 := base2flt_~m#1 / 2; {6441#(or unseeded (and (>= oldRank0 0) (> oldRank0 (+ (* (- 2) |ULTIMATE.start_base2flt_~e#1|) 253))))} is VALID [2022-02-21 03:37:21,936 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 03:37:21,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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 03:37:21,943 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 03:37:21,943 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:21,943 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,944 INFO L152 lantAutomatonBouncer]: Defining deterministic Buchi interpolant automaton with honda bouncer for stem and without honda bouncer for loop.1 stem predicates 1 loop predicates [2022-02-21 03:37:21,944 INFO L71 iDifferenceNCSBLazy3]: Start buchiDifferenceNCSBLazy3. First operand 76 states and 110 transitions. cyclomatic complexity: 38 Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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 03:37:21,984 INFO L75 iDifferenceNCSBLazy3]: Finished buchiDifferenceNCSBLazy3. First operand 76 states and 110 transitions. cyclomatic complexity: 38. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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) Result 79 states and 114 transitions. Complement of second has 4 states. [2022-02-21 03:37:21,984 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 03:37:21,984 INFO L123 tractBuchiDifference]: Start testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:21,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 76 states and 110 transitions. cyclomatic complexity: 38 [2022-02-21 03:37:21,984 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:21,984 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:21,984 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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 03:37:21,985 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:21,985 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is false [2022-02-21 03:37:21,985 INFO L119 BuchiIsEmpty]: Starting construction of run [2022-02-21 03:37:21,985 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 114 transitions. [2022-02-21 03:37:21,985 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:37:21,985 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:37:21,985 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 76 states and 110 transitions. cyclomatic complexity: 38 [2022-02-21 03:37:21,986 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 3 examples of accepted words. [2022-02-21 03:37:21,986 INFO L70 LassoExtractor]: Start lassoExtractor. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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 03:37:21,986 INFO L131 ngComponentsAnalysis]: Automaton has 1 accepting balls. 2 [2022-02-21 03:37:21,986 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 1 examples of accepted words. [2022-02-21 03:37:21,986 INFO L70 LassoExtractor]: Start lassoExtractor. Operand 79 states and 114 transitions. cyclomatic complexity: 39 [2022-02-21 03:37:21,986 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 79 states and 114 transitions. cyclomatic complexity: 39 [2022-02-21 03:37:21,986 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:37:21,986 INFO L86 LassoExtractor]: Finished lassoExtractor. Found 0 examples of accepted words. [2022-02-21 03:37:21,986 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 110 transitions. cyclomatic complexity: 38 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:21,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:21,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 114 transitions. cyclomatic complexity: 39 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:21,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 110 transitions. cyclomatic complexity: 38 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:21,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:21,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 114 transitions. cyclomatic complexity: 39 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:21,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 110 transitions. cyclomatic complexity: 38 Stem has 79 letters. Loop has 79 letters. [2022-02-21 03:37:21,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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) Stem has 79 letters. Loop has 79 letters. [2022-02-21 03:37:21,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 114 transitions. cyclomatic complexity: 39 Stem has 79 letters. Loop has 79 letters. [2022-02-21 03:37:21,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 110 transitions. cyclomatic complexity: 38 Stem has 76 letters. Loop has 76 letters. [2022-02-21 03:37:21,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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) Stem has 76 letters. Loop has 76 letters. [2022-02-21 03:37:21,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 114 transitions. cyclomatic complexity: 39 Stem has 76 letters. Loop has 76 letters. [2022-02-21 03:37:21,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 110 transitions. cyclomatic complexity: 38 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:21,987 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,987 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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) Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:21,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 114 transitions. cyclomatic complexity: 39 Stem has 3 letters. Loop has 3 letters. [2022-02-21 03:37:21,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 110 transitions. cyclomatic complexity: 38 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:37:21,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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) Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:37:21,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 114 transitions. cyclomatic complexity: 39 Stem has 24 letters. Loop has 3 letters. [2022-02-21 03:37:21,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 110 transitions. cyclomatic complexity: 38 Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:37:21,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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) Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:37:21,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 114 transitions. cyclomatic complexity: 39 Stem has 25 letters. Loop has 3 letters. [2022-02-21 03:37:21,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 110 transitions. cyclomatic complexity: 38 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:21,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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) Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:21,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 114 transitions. cyclomatic complexity: 39 Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:21,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 76 states and 110 transitions. cyclomatic complexity: 38 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:21,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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) Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:21,988 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,988 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 79 states and 114 transitions. cyclomatic complexity: 39 Stem has 1 letters. Loop has 2 letters. [2022-02-21 03:37:21,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,989 INFO L161 tractBuchiDifference]: Finished testing correctness of buchiDifferenceNCSBLazy3 [2022-02-21 03:37:21,989 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 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 03:37:21,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 69 transitions. [2022-02-21 03:37:21,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 69 transitions. Stem has 23 letters. Loop has 3 letters. [2022-02-21 03:37:21,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 69 transitions. Stem has 26 letters. Loop has 3 letters. [2022-02-21 03:37:21,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,989 INFO L84 BuchiAccepts]: Start buchiAccepts Operand 3 states and 69 transitions. Stem has 23 letters. Loop has 6 letters. [2022-02-21 03:37:21,989 INFO L116 BuchiAccepts]: Finished buchiAccepts. [2022-02-21 03:37:21,990 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 79 states and 114 transitions. cyclomatic complexity: 39 [2022-02-21 03:37:21,990 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:37:21,990 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 79 states to 0 states and 0 transitions. [2022-02-21 03:37:21,991 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:37:21,991 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:37:21,991 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:37:21,991 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:37:21,991 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:37:21,991 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:37:21,991 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 03:37:21,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-21 03:37:21,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-21 03:37:21,991 INFO L87 Difference]: Start difference. First operand 0 states and 0 transitions. Second operand has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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 03:37:21,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 03:37:21,991 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-21 03:37:21,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 03:37:21,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) internal successors, (23), 4 states have internal predecessors, (23), 0 states have call successors, (0), 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 03:37:22,007 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 03:37:22,007 INFO L82 GeneralOperation]: Start removeNonLiveStates. Operand 0 states and 0 transitions. [2022-02-21 03:37:22,007 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:37:22,007 INFO L88 GeneralOperation]: Finished removeNonLiveStates. Reduced from 0 states to 0 states and 0 transitions. [2022-02-21 03:37:22,007 INFO L87 BuchiClosureNwa]: Accepting states before buchiClosure: 0 [2022-02-21 03:37:22,007 INFO L106 BuchiClosureNwa]: Accepting states after buchiClosure: 0 [2022-02-21 03:37:22,007 INFO L73 IsDeterministic]: Start isDeterministic. Operand 0 states and 0 transitions. [2022-02-21 03:37:22,007 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-02-21 03:37:22,007 INFO L681 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:37:22,008 INFO L704 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:37:22,008 INFO L587 BuchiCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-21 03:37:22,008 INFO L425 BuchiCegarLoop]: ======== Iteration 8============ [2022-02-21 03:37:22,008 INFO L72 BuchiIsEmpty]: Start buchiIsEmpty. Operand 0 states and 0 transitions. [2022-02-21 03:37:22,008 INFO L131 ngComponentsAnalysis]: Automaton has 0 accepting balls. 0 [2022-02-21 03:37:22,008 INFO L87 BuchiIsEmpty]: Finished buchiIsEmpty Result is true [2022-02-21 03:37:22,012 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.buchiautomizer CFG 21.02 03:37:22 BoogieIcfgContainer [2022-02-21 03:37:22,012 INFO L132 PluginConnector]: ------------------------ END BuchiAutomizer---------------------------- [2022-02-21 03:37:22,013 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-21 03:37:22,013 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-21 03:37:22,013 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-21 03:37:22,013 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 03:37:15" (3/4) ... [2022-02-21 03:37:22,015 INFO L140 WitnessPrinter]: No result that supports witness generation found [2022-02-21 03:37:22,015 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-21 03:37:22,016 INFO L158 Benchmark]: Toolchain (without parser) took 7763.86ms. Allocated memory was 100.7MB in the beginning and 199.2MB in the end (delta: 98.6MB). Free memory was 61.8MB in the beginning and 81.5MB in the end (delta: -19.7MB). Peak memory consumption was 79.2MB. Max. memory is 16.1GB. [2022-02-21 03:37:22,016 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 100.7MB. Free memory was 78.3MB in the beginning and 78.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:37:22,016 INFO L158 Benchmark]: CACSL2BoogieTranslator took 252.06ms. Allocated memory is still 100.7MB. Free memory was 61.6MB in the beginning and 70.9MB in the end (delta: -9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-21 03:37:22,016 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.68ms. Allocated memory is still 100.7MB. Free memory was 70.9MB in the beginning and 66.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-21 03:37:22,016 INFO L158 Benchmark]: Boogie Preprocessor took 26.25ms. Allocated memory is still 100.7MB. Free memory was 66.7MB in the beginning and 64.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-21 03:37:22,017 INFO L158 Benchmark]: RCFGBuilder took 746.60ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 64.2MB in the beginning and 89.6MB in the end (delta: -25.5MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. [2022-02-21 03:37:22,017 INFO L158 Benchmark]: BuchiAutomizer took 6672.38ms. Allocated memory was 121.6MB in the beginning and 199.2MB in the end (delta: 77.6MB). Free memory was 89.6MB in the beginning and 81.5MB in the end (delta: 8.1MB). Peak memory consumption was 85.4MB. Max. memory is 16.1GB. [2022-02-21 03:37:22,017 INFO L158 Benchmark]: Witness Printer took 2.37ms. Allocated memory is still 199.2MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-21 03:37:22,018 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.18ms. Allocated memory is still 100.7MB. Free memory was 78.3MB in the beginning and 78.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 252.06ms. Allocated memory is still 100.7MB. Free memory was 61.6MB in the beginning and 70.9MB in the end (delta: -9.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.68ms. Allocated memory is still 100.7MB. Free memory was 70.9MB in the beginning and 66.7MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 26.25ms. Allocated memory is still 100.7MB. Free memory was 66.7MB in the beginning and 64.2MB in the end (delta: 2.6MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 746.60ms. Allocated memory was 100.7MB in the beginning and 121.6MB in the end (delta: 21.0MB). Free memory was 64.2MB in the beginning and 89.6MB in the end (delta: -25.5MB). Peak memory consumption was 40.0MB. Max. memory is 16.1GB. * BuchiAutomizer took 6672.38ms. Allocated memory was 121.6MB in the beginning and 199.2MB in the end (delta: 77.6MB). Free memory was 89.6MB in the beginning and 81.5MB in the end (delta: 8.1MB). Peak memory consumption was 85.4MB. Max. memory is 16.1GB. * Witness Printer took 2.37ms. Allocated memory is still 199.2MB. Free memory is still 81.5MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: Constructed decomposition of program Your program was decomposed into 13 terminating modules (6 trivial, 7 deterministic, 0 nondeterministic). One deterministic module has affine ranking function -2 * e + 253 and consists of 4 locations. One deterministic module has affine ranking function 2 * e + 255 and consists of 3 locations. One deterministic module has affine ranking function -2 * e + 253 and consists of 3 locations. One deterministic module has affine ranking function -2 * e + 253 and consists of 3 locations. One deterministic module has affine ranking function 2 * e + 255 and consists of 3 locations. One deterministic module has affine ranking function 2 * e + 255 and consists of 3 locations. One deterministic module has affine ranking function -2 * e + 253 and consists of 3 locations. 6 modules have a trivial ranking function, the largest among these consists of 7 locations. - StatisticsResult: Timing statistics BüchiAutomizer plugin needed 6.6s and 8 iterations. TraceHistogramMax:2. Analysis of lassos took 3.6s. Construction of modules took 0.2s. Büchi inclusion checks took 2.3s. Highest rank in rank-based complementation 3. Minimization of det autom 3. Minimization of nondet autom 10. Automata minimization 0.1s AutomataMinimizationTime, 11 MinimizatonAttempts, 210 StatesRemovedByMinimization, 10 NontrivialMinimizations. Non-live state removal took 0.0s Buchi closure took 0.0s. Biggest automaton had 76 states and ocurred in iteration 6. Nontrivial modules had stage [7, 0, 0, 0, 0]. InterpolantCoveringCapabilityFinite: 0/0 InterpolantCoveringCapabilityBuchi: 0/0 HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 905 SdHoareTripleChecker+Valid, 0.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 905 mSDsluCounter, 1341 SdHoareTripleChecker+Invalid, 0.3s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 289 mSDsCounter, 45 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 382 IncrementalHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 45 mSolverCounterUnsat, 1052 mSDtfsCounter, 382 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown LassoAnalysisResults: nont0 unkn0 SFLI0 SFLT1 conc0 concLT0 SILN0 SILU0 SILI0 SILT6 lasso0 LassoPreprocessingBenchmarks: Lassos: inital21 mio100 ax100 hnf100 lsp56 ukn100 mio100 lsp100 div561 bol100 ite100 ukn100 eq132 hnf96 smp42 dnf100 smp100 tf105 neg100 sie102 LassoTerminationAnalysisBenchmarks: ConstraintsSatisfiability: unsat Degree: 0 Time: 53ms VariablesStem: 0 VariablesLoop: 5 DisjunctsStem: 1 DisjunctsLoop: 1 SupportingInvariants: 0 MotzkinApplications: 2 LassoTerminationAnalysisBenchmarks: LassoNonterminationAnalysisSatFixpoint: 1 LassoNonterminationAnalysisSatUnbounded: 0 LassoNonterminationAnalysisUnsat: 7 LassoNonterminationAnalysisUnknown: 0 LassoNonterminationAnalysisTime: 0.6s - TerminationAnalysisResult: Termination proven Buchi Automizer proved that your program is terminating RESULT: Ultimate proved your program to be correct! [2022-02-21 03:37:22,040 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:1024 -smt2 -in -t:12000 (32)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:22,257 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2022-02-21 03:37:22,448 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